A note on "Two-machine flow-shop scheduling with rejection" and its link with flow shop scheduling and common due date assignment - Université de Tours Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2012

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

Résumé

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.

Dates et versions

hal-01003827 , version 1 (10-06-2014)

Identifiants

Citer

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, 2012, 39 (12), pp.3244-3246. ⟨10.1016/j.cor.2012.04.009⟩. ⟨hal-01003827⟩
35 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More