Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

Celso Sakuraba Débora Ronconi Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. We present heuristics that use an algorithm, based on proposed properties, which obtains an optimal schedule for a given job sequence. A new set of benchmark problems is presented with the purpose of evaluating the heuristics. Computational experiments show that the developed heuristics outperform results found in the literature for problems up to 500 jobs.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01185237
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 3:11:55 PM
Last modification on : Thursday, November 22, 2018 - 2:07:26 PM

Identifiers

Collections

Citation

Celso Sakuraba, Débora Ronconi, Francis Sourd. Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date. Computers and Operations Research, Elsevier, 2009, 36 (1), pp.60-72. ⟨10.1016/j.cor.2007.07.005⟩. ⟨hal-01185237⟩

Share

Metrics

Record views

64