Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
| Contribuinte(s) |
UNIVERSIDADE DE SÃO PAULO |
|---|---|
| Data(s) |
18/10/2012
18/10/2012
2009
|
| 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. 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] |
| Identificador |
COMPUTERS & OPERATIONS RESEARCH, v.36, n.1, p.60-72, 2009 0305-0548 http://producao.usp.br/handle/BDPI/18595 10.1016/j.cor.2007.07.005 |
| Idioma(s) |
eng |
| Publicador |
PERGAMON-ELSEVIER SCIENCE LTD |
| Relação |
Computers & Operations Research |
| Direitos |
restrictedAccess Copyright PERGAMON-ELSEVIER SCIENCE LTD |
| Palavras-Chave | #Scheduling #Earliness and tardiness #Common due date #Flowshop #Heuristics #TARDINESS PENALTIES #COMPLETION TIMES #SINGLE-MACHINE #MINIMIZING EARLINESS #BENCHMARKS #ALGORITHM #ART #Computer Science, Interdisciplinary Applications #Engineering, Industrial #Operations Research & Management Science |
| Tipo |
article original article publishedVersion |
