Archivio Istituzionale della RicercaIn 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.
A note on ‘‘Two-machine flow-shop scheduling with rejection’’ and its link with flow-shop scheduling and common due date assignment / V., T’Kindt; DELLA CROCE DI DOJOLA, Federico. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 39:(2012), pp. 3244-3246. [10.1016/j.cor.2012.04.009]
A note on ‘‘Two-machine flow-shop scheduling with rejection’’ and its link with flow-shop scheduling and common due date assignment
DELLA CROCE DI DOJOLA, Federico
2012
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.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2498477
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo