Skip to Main content Skip to Navigation
Journal articles

Two-dedicated-machine scheduling problem with precedence relations to minimize makespan

Evgeny R. Gafarov 1, 2, 3 Alexandre Dolgui 1, 2
1 DEMO-ENSMSE - Département Décision en Entreprise : Modélisation, Optimisation
2 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes
3 ICS RAS - Trapeznikov Institute of Control Sciences
Abstract : Two-dedicated-parallel-machine scheduling problem with precedence constraints to minimize makespan is considered. This problem originally appeared as a sub-problem in assembly line balancing but it has also its own applications. Complexity and approximation results for this scheduling problem and its special cases with chains of jobs or equal-processing-times are presented.
Complete list of metadatas
https://hal-emse.ccsd.cnrs.fr/emse-00847234
Contributor : Florent Breuil <>
Submitted on : Tuesday, July 23, 2013 - 10:23:00 AM
Last modification on : Tuesday, January 21, 2020 - 1:25:50 AM

Identifiers

Collections

DEMO-ENSMSE | FAYOL-ENSMSE | UR-LSTI-ENSMSE | EMSE | ROGI-ENSMSE | CNRS | LIMOS | PRES_CLERMONT | TDS-MACS | INSTITUT-TELECOM | SIGMA-CLERMONT

Citation

Evgeny R. Gafarov, Alexandre Dolgui. Two-dedicated-machine scheduling problem with precedence relations to minimize makespan. Optimization Letters, Springer Verlag, 2014, Volume 8 (Issue 4), pp 1443-1451. ⟨10.1007/s11590-013-0671-0⟩. ⟨emse-00847234⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

215

Contact

Informations

CCSD