Two-dedicated-machine scheduling problem with precedence relations to minimize makespan - Archive ouverte HAL Access content directly
Journal Articles Optimization Letters Year : 2014

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

(1, 2, 3) , (1, 2)
1
2
3

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.
Not file

Dates and versions

emse-00847234 , version 1 (23-07-2013)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More