Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions

dc.creatorFranca, PM
dc.creatorTin, G
dc.creatorBuriol, LS
dc.date2006
dc.date36951
dc.date2014-11-13T12:18:48Z
dc.date2015-11-26T18:07:10Z
dc.date2014-11-13T12:18:48Z
dc.date2015-11-26T18:07:10Z
dc.date.accessioned2018-03-29T00:49:17Z
dc.date.available2018-03-29T00:49:17Z
dc.identifierInternational Journal Of Production Research. Taylor & Francis Ltd, v. 44, n. 5, n. 939, n. 957, 2006.
dc.identifier0020-7543
dc.identifierWOS:000235277400006
dc.identifier10.1080/00207540500282914
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/67900
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/67900
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/67900
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1293523
dc.descriptionThis article deals with the no- wait. owshop problem with sequence dependent set-ups and ready times solved by an evolutionary approach. The hybrid genetic algorithm presented here addresses a new hierarchically organized complete ternary tree to represent the population that put together with a recombination plan resembles a parallel processing scheme for solving combinatorial optimization problems. Embedded in the hybrid approach, a novel recursive local search scheme, recursive arc insertion (RAI), is also proposed. The effectiveness of the local search phase is crucial given that it is responsible for about 90% of the total processing time of the algorithm. Instances with known optimal solution are used to test the new algorithm and compare it to a previously proposed heuristic approach.
dc.description44
dc.description5
dc.description939
dc.description957
dc.languageen
dc.publisherTaylor & Francis Ltd
dc.publisherAbingdon
dc.publisherInglaterra
dc.relationInternational Journal Of Production Research
dc.relationInt. J. Prod. Res.
dc.rightsfechado
dc.rightshttp://journalauthors.tandf.co.uk/permissions/reusingOwnWork.asp
dc.sourceWeb of Science
dc.subjectmachine scheduling
dc.subjectflowshop problem
dc.subjectno-wait flowshop
dc.subjectheuristics
dc.subjectgenetic algorithms
dc.subjectmemetic algorithms
dc.subjectTotal Completion-time
dc.subjectScheduling Problems
dc.subjectRemoval Times
dc.subjectIn-process
dc.subjectSetup
dc.titleGenetic algorithms for the no-wait flowshop sequencing problem with time restrictions
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución