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

Autor(es)

Sakuraba, Celso S. ; Ronconi, Debora P. ; Sourd, Francis

• Tipo de documento: Artigo Científico
• Fonte: Computers & Operations Research; v. 36, n. 1, p. 13-pg., 2009-01-01.

Resumo

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. (AU)

• Processo FAPESP: 05/60452-6 - Resolução de problemas de programação de tarefas minimizando adiantamento e atraso
• Beneficiário: Débora Pretti Ronconi
• Modalidade de apoio: Auxílio à Pesquisa - Regular