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

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
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 : Thursday, October 17, 2019 - 12:36:12 PM

Identifiers

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⟩

Share

Metrics

Record views

199