A note on "Two-machine flow-shop scheduling with rejection" and its link with flow shop scheduling and common due date assignment

Federico Della Croce 1 Vincent T'Kindt 2
2 ERL CNRS 6305 Ordonnancement et Conduite
LIFAT - Laboratoire d'Informatique Fondamentale et Appliquée de Tours
Abstract : In a recent paper by Shabtay and Gasper "Two-machine flow-shop scheduling with rejection, Computers and Operations Research", forthcoming, doi:10.1016/j.cor.2011.05.023, several complexity and approximation results are proposed for a two-criteria two-machine flow-shop scheduling problem with rejection. The two criteria to be minimized are the makespan the total rejection cost. This note positions the contribution of such results with respect to the contributions of the literature on common due date assignment and flow-shop scheduling not considered in the work of Shabtay and Gasper.
Type de document :
Article dans une revue
Computers and Operations Research, Elsevier, 2012, 39 (12), pp.3244-3246. 〈10.1016/j.cor.2012.04.009〉
Liste complète des métadonnées

https://hal-univ-tours.archives-ouvertes.fr/hal-01003827
Contributeur : Vincent T'Kindt <>
Soumis le : mardi 10 juin 2014 - 17:14:15
Dernière modification le : mardi 9 octobre 2018 - 11:46:07

Identifiants

Collections

Citation

Federico Della Croce, Vincent T'Kindt. A note on "Two-machine flow-shop scheduling with rejection" and its link with flow shop scheduling and common due date assignment. Computers and Operations Research, Elsevier, 2012, 39 (12), pp.3244-3246. 〈10.1016/j.cor.2012.04.009〉. 〈hal-01003827〉

Partager

Métriques

Consultations de la notice

69