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

Evgeny R. Gafarov; Alexandre Dolgui

doi:10.1007/s11590-013-0671-0

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.

Document type :

Journal articles

Domain :

Computer Science [cs] / Modeling and Simulation

Complete list of metadata

https://hal-emse.ccsd.cnrs.fr/emse-00847234
Contributor : Florent Breuil <>
Submitted on : Tuesday, July 23, 2013 - 10:23:00 AM
Last modification on : Wednesday, April 21, 2021 - 8:52:05 AM

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

Identifiers

Collections

Citation

Export

Metrics

279

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

Identifiers

Collections

Citation

Export

Share

Metrics

279