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

This article deals with the no-wait flowshop 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 rec...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research 2006-03, Vol.44 (5), p.939-957
Main Authors: FranÇa, P. M., Tin, G., Buriol, L. S.
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Flowshop problem
Genetic algorithms
Heuristics
Machine scheduling
Memetic algorithms
No-wait flowshop
Operational research and scientific management
Operational research. Management science
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article deals with the no-wait flowshop 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.
ISSN:0020-7543
1366-588X
DOI:10.1080/00207540500282914