Skip to Main content Skip to Navigation
Conference papers

Branch-and-bound algorithm to minimize the makespan for the dedicated two-processors task scheduling problem with release dates

Adel Manaa Chengbin Chu 1 Alice Yalaoui 2 
1 M2S - Modélisation et Sûreté des Systèmes
ISTIT - Institut des Sciences et Technologies de l'Information de Troyes
2 LOSI - Laboratoire d'Optimisation des Systèmes Industriels
ICD - Institut Charles Delaunay
Document type :
Conference papers
Complete list of metadata
https://hal-utt.archives-ouvertes.fr/hal-02860275
Contributor : Jean-Baptiste VU VAN Connect in order to contact the contributor
Submitted on : Monday, June 8, 2020 - 12:41:10 PM
Last modification on : Sunday, June 26, 2022 - 4:39:36 AM

Identifiers

  • HAL Id : hal-02860275, version 1

Collections

CNRS | UTT | LOSI | LM2S-UTT

Citation

Adel Manaa, Chengbin Chu, Alice Yalaoui. Branch-and-bound algorithm to minimize the makespan for the dedicated two-processors task scheduling problem with release dates. 7ème Conférence Internationale de Modélisation Optimisation et Simulation des Systèmes :Communication, Coopération et Coordination. (MOSIM'08), Mar 2008, Paris, France. ⟨hal-02860275⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

12