A new evolutionary clustering search for a no-wait flow shop problem with set-up times

Authors:
Marcelo Seido Nagano;Augusto Almeida Da Silva;Luiz Antonio Nogueira Lorena
Affiliations:
University of São Paulo, School of Engineering of Sao Carlos, Department of Production Engineering, São Carlos, SP, Brazil;University of São Paulo, School of Engineering of Sao Carlos, Department of Production Engineering, São Carlos, SP, Brazil;National Institute for Space Research, Computing and Applied Mathematics Laboratory, São José dos Campos, SP, Brazil
Venue:
Engineering Applications of Artificial Intelligence
Year:
2012

Citing 7
Cited 2

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
Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time

Computers and Industrial Engineering
Genetic forma recombination in permutation flowshop problems

Evolutionary Computation
A Constructive Genetic Algorithm for permutation flowshop scheduling

Computers and Industrial Engineering
Evolutionary clustering search for flowtime minimization in permutation flow shop

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics

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 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.