Erratum to ''Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods'' [International Journal of Production Economics 121 (2009) 81-87] - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Production Economics Année : 2013

Erratum to ''Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods'' [International Journal of Production Economics 121 (2009) 81-87]

Résumé

In Allaoui H., Artiba A, ''Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods'' [International Journal of Production Economics 121 (2009)] the authors propose optimality conditions for the Johnson sequence in presence of one unavailability period on the first machine and pretend for a performance guarantee of 2 when several unavailability periods may occur. We establish in this note that these conditions are false, and that minimizing the makespan in presence of more than one unavailability period is not in APX, unless P=NP. We also point out that the results given for the stochastic part of the problem are incorrect. Finally, we propose a simplified proof and a generalization for the two-stage hybrid flowshop.
Fichier principal
Vignette du fichier
erratum.pdf (81.55 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00697092 , version 1 (14-05-2012)

Identifiants

Citer

Christophe Rapine. Erratum to ''Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods'' [International Journal of Production Economics 121 (2009) 81-87]. International Journal of Production Economics, 2013, 144 (2), pp.641-643. ⟨10.1016/j.ijpe.2012.11.010⟩. ⟨hal-00697092⟩
62 Consultations
294 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More