Skip to Main content Skip to Navigation
Conference papers

Branch-and-Bound Algorithms to Minimize Total Weighted and Total Completion Time for the Dedicated Two-Processor Task Scheduling Problems P2|fixj|SwjCj and P2|fixj|SCj

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-02860306
Contributor : Jean-Baptiste Vu Van Connect in order to contact the contributor
Submitted on : Monday, June 8, 2020 - 12:57:17 PM
Last modification on : Friday, August 27, 2021 - 3:14:08 PM

Identifiers

  • HAL Id : hal-02860306, version 1

Collections

UTT | CNRS

Citation

Adel Manaa, Chengbin Chu, Alice Yalaoui. Branch-and-Bound Algorithms to Minimize Total Weighted and Total Completion Time for the Dedicated Two-Processor Task Scheduling Problems P2|fixj|SwjCj and P2|fixj|SCj. International Conference on industrial Engineering and Systems Management (IESM 07), May 2007, Beijing, China. ⟨hal-02860306⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

12