Two Dedicated Parallel Machines Scheduling Problem with Precedence Relations

Abstract : In this paper, we consider two dedicated parallel machines scheduling problem with precedence relations to minimize makespan. Complexity and approximation results are presented.
Type de document :
Communication dans un congrès
Stefan Helber, Michael Breitner, Daniel Rösch, Cornelia Schön, Johann-Matthias Graf von der Schulenburg, Philipp Sibbertsen, Marc Steinbach, Stefan Weber, Anja Wolter. International Annual Conference of the German Operations Research Society (OR'2012), Sep 2012, Hannovre, Germany. Springer International Publishing, pp 403-408, 2014, Operations Research Proceedings. 〈10.1007/978-3-319-00795-3_60〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00766896
Contributeur : Florent Breuil <>
Soumis le : mercredi 19 décembre 2012 - 11:04:51
Dernière modification le : jeudi 11 janvier 2018 - 06:16:31

Identifiants

Citation

Evgeny R. Gafarov, Alexandre Dolgui, Frédéric Grimaud. Two Dedicated Parallel Machines Scheduling Problem with Precedence Relations. Stefan Helber, Michael Breitner, Daniel Rösch, Cornelia Schön, Johann-Matthias Graf von der Schulenburg, Philipp Sibbertsen, Marc Steinbach, Stefan Weber, Anja Wolter. International Annual Conference of the German Operations Research Society (OR'2012), Sep 2012, Hannovre, Germany. Springer International Publishing, pp 403-408, 2014, Operations Research Proceedings. 〈10.1007/978-3-319-00795-3_60〉. 〈emse-00766896〉

Partager

Métriques

Consultations de la notice

97