Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling

Authors:
Geraldo Ribeiro Filho;Marcelo Seido Nagano;Luiz Antonio Nogueira Lorena
Affiliations:
Faculdade Bandeirantes de Educação Superior, Suzano, SP, Brazil;Escola de Engenharia de São Carlos, USP, São Carlos, SP, Brazil;Instituto Nacional de Pesquisas Espaciais, LAC, São José dos Campos, SP, Brazil
Venue:
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Year:
2007

Citing 8
Cited 4

A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Genetic algorithms applied to the continuous flow shop problem

Computers and Industrial Engineering
Total flowtime in no-wait flowshops with separated setup times

Computers and Operations Research
A new heuristic and dominance relations for no-wait flowshops with setups

Computers and Operations Research
Uniform Crossover in Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
New heuristics for no-wait flowshops to minimize makespan

Computers and Operations Research
Genetic forma recombination in permutation flowshop problems

Evolutionary Computation
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem

Computers and Operations Research

An island model for the no-wait flow shop scheduling problem

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Fitness landscape analysis for the no-wait flow-shop scheduling problem

Journal of Heuristics
An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop

Computers and Industrial Engineering
An evolutionary clustering search for the no-wait flow shop problem with sequence dependent setup times

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This research presents a novel approach to solve m-machine no-wait flowshop scheduling problem. A continuous flowshop problem with total flowtime as criterion is considered applying a hybrid evolutionary algorithm. The performance of the proposed method is evaluated and the results are compared with the best known in the literature. Experimental tests show the superiority of the evolutionary hybrid regarding the solution quality.