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

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.
Document type :
Journal articles
Complete list of metadatas

https://hal-univ-tours.archives-ouvertes.fr/hal-01003827
Contributor : Vincent t'Kindt <>
Submitted on : Tuesday, June 10, 2014 - 5:14:15 PM
Last modification on : Thursday, July 4, 2019 - 10:46:02 AM

Identifiers

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⟩

Share

Metrics

Record views

104