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.
Type de document :
Article dans une revue
Optimization Letters, Springer Verlag, 2014, Volume 8 (Issue 4), pp 1443-1451. 〈10.1007/s11590-013-0671-0〉
Liste complète des métadonnées

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

Identifiants

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〉

Partager

Métriques

Consultations de la notice

131