Title
A new evolutionary clustering search for a no-wait flow shop problem with set-up times
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.
Year
DOI
Venue
2012
10.1016/j.engappai.2012.05.017
Eng. Appl. of AI
Keywords
Field
DocType
processing time,genetic algorithm-cluster search,new hybrid metaheuristic,no-wait flow shop problem,performance measure,new method,new evolutionary clustering search,best method,set-up time,test problem,scheduling problem,metaheuristic,scheduling,flow shop
Mathematical optimization,Job shop scheduling,Scheduling (computing),Computer science,Flow shop scheduling,Evolutionary clustering,Metaheuristic
Journal
Volume
Issue
ISSN
25
6
0952-1976
Citations 
PageRank 
References 
18
0.64
11
Authors
3
Name
Order
Citations
PageRank
Marcelo Seido Nagano19812.52
Augusto Almeida Da Silva2291.12
Luiz Antonio Nogueira Lorena349836.72