Heuristic methods for the single machine scheduling problem with different ready times and a common due date
| Contribuinte(s) |
UNIVERSIDADE DE SÃO PAULO |
|---|---|
| Data(s) |
01/11/2013
01/11/2013
2012
|
| Resumo |
The single machine scheduling problem with a common due date and non-identical ready times for the jobs is examined in this work. Performance is measured by the minimization of the weighted sum of earliness and tardiness penalties of the jobs. Since this problem is NP-hard, the application of constructive heuristics that exploit specific characteristics of the problem to improve their performance is investigated. The proposed approaches are examined through a computational comparative study on a set of 280 benchmark test problems with up to 1000 jobs. PRONEX-CNPq/FAPERJ [E-26/171.1510/2006-APQ1] PRONEXCNPq/FAPERJ FAPESP [2006/53768-0, 2006/03496-3, 2009/10241-0, 2010/10133-0] FAPESP CNPq [308000/2009-9, 304484/2007-5] CNPq |
| Identificador |
ENGINEERING OPTIMIZATION, ABINGDON, v. 44, n. 10, supl. 4, Part 1-2, pp. 1197-1208, DEC, 2012 0305-215X http://www.producao.usp.br/handle/BDPI/37147 10.1080/0305215X.2011.634409 |
| Idioma(s) |
eng |
| Publicador |
TAYLOR & FRANCIS LTD ABINGDON |
| Relação |
ENGINEERING OPTIMIZATION |
| Direitos |
restrictedAccess Copyright TAYLOR & FRANCIS LTD |
| Palavras-Chave | #SCHEDULING #SINGLE MACHINE #EARLINESS #TARDINESS #HEURISTIC METHODS #TARDINESS PENALTIES #WEIGHTED EARLINESS #ABSOLUTE DEVIATION #COMPLETION TIMES #RELEASE DATES #ASSIGNMENT #ENGINEERING, MULTIDISCIPLINARY #OPERATIONS RESEARCH & MANAGEMENT SCIENCE |
| Tipo |
article original article publishedVersion |
