A note on aTwo-machine flow-shop scheduling with rejectiona and its link with flow-shop scheduling and common due date assignment

In a recent paper by Shabtay and Gasper aTwo-machine flow-shop scheduling with rejection, Computers and Operations Researcha, 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 rejecti...

Full description

Saved in:
Bibliographic Details
Published inComputers & operations research Vol. 39; no. 12; pp. 3244 - 3246
Main Authors T'kindt, V, Croce, F
Format Journal Article
LanguageEnglish
Published 01.12.2012
Subjects
Approximation
Cost engineering
Criteria
Due dates
Mathematical analysis
Operations research
Rejection
Scheduling
Online AccessGet full text

Cover

More Information
Summary:In a recent paper by Shabtay and Gasper aTwo-machine flow-shop scheduling with rejection, Computers and Operations Researcha, 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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 23
ObjectType-Feature-2
ISSN:0305-0548
DOI:10.1016/j.cor.2012.04.009