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

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.FAPESP-""Fundacao de Amparo a Pesquisa do Estado de Sao Paulo""[05/60452-6]CNPq-""Conselho Nacional de Desenvolvimento Cientifico e Tecnologico""[490333/2004-4]CNPq-""Conselho Nacional de Desenvolvimento Cientifico e Tecnologico""[131505/2004-1]CNPq-""Conselho Nacional de Desenvolvimento Cientifico e Tecnologico""[307399/2006-0