A new evolutionary clustering search for a no-wait flow shop problem with set-up times
| Contribuinte(s) |
UNIVERSIDADE DE SÃO PAULO |
|---|---|
| Data(s) |
06/11/2013
06/11/2013
2012
|
| Resumo |
This paper addresses the m-machine no-wait flow shop problem where the set-up time of a job is separated from its processing time. The performance measure considered is the total flowtime. A new hybrid metaheuristic Genetic Algorithm-Cluster Search is proposed to solve the scheduling problem. The performance of the proposed method is evaluated and the results are compared with the best method reported in the literature. Experimental tests show superiority of the new method for the test problems set, regarding the solution quality. (c) 2012 Elsevier Ltd. All rights reserved. National Council for Scientific and Technological Development - CNPq, Brazil [554546/2009-4, 476753/2011-2, 303000/2010-4, 300692/2009-9, 470813/2010-5] National Council for Scientific and Technological Development (CNPq), Brazil |
| Identificador |
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, OXFORD, v. 25, n. 6, p. 1114-1120, SEP, 2012 0952-1976 http://www.producao.usp.br/handle/BDPI/42222 10.1016/j.engappai.2012.05.017 |
| Idioma(s) |
eng |
| Publicador |
PERGAMON-ELSEVIER SCIENCE LTD OXFORD |
| Relação |
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE |
| Direitos |
closedAccess Copyright PERGAMON-ELSEVIER SCIENCE LTD |
| Palavras-Chave | #SCHEDULING #FLOW SHOP #NO-WAIT #SET-UP TIMES SEPARATED #METAHEURISTIC #TOTAL COMPLETION-TIME #FLOWSHOPS #MINIMIZATION #MAKESPAN #AUTOMATION & CONTROL SYSTEMS #COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE #ENGINEERING, MULTIDISCIPLINARY #ENGINEERING, ELECTRICAL & ELECTRONIC |
| Tipo |
article original article publishedVersion |
