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.
https://hal-emse.ccsd.cnrs.fr/emse-00847234
Contributeur : Florent Breuil
<>
Soumis le : mardi 23 juillet 2013 - 10:23:00
Dernière modification le : dimanche 28 janvier 2018 - 15:22:05
