Artículos de revistas
Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
Fecha
2009Registro en:
COMPUTERS & OPERATIONS RESEARCH, v.36, n.1, p.60-72, 2009
0305-0548
10.1016/j.cor.2007.07.005
Autor
SAKURABA, Celso S.
RONCONI, Debora P.
SOURD, Francis
Institución
Resumen
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 fora 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. (C) 2007 Elsevier Ltd. All rights reserved.