Paper Info
Title
A modified cuckoo search algorithm for flow shop scheduling problem with blocking
Abstract
This paper presents a Modified Cuckoo Search (MCS) algorithm for solving flow shop scheduling problem with blocking to minimize the makespan. To handle the discrete variables of the job scheduling problem, the smallest position value (SPV) rule is used to convert continuous solutions into discrete job permutations. The Nawaz-Enscore-Ham (NEH) heuristic method is utilized for generating high quality initial solutions. Moreover, two frequently used swap and insert operators are employed for enhancing the local search. To verify the performance of the proposed MCS algorithm, experiments are conducted on Taillard's benchmark set. Results show that MCS performs better than the standard CS and some previous algorithms proposed in the literature.
Year
DOI
Venue
2015
10.1109/CEC.2015.7256925
2015 IEEE Congress on Evolutionary Computation (CEC)
Keywords
Field
DocType
cuckoo search,flow shop scheduling,blocking,makespan,optimization
Mathematical optimization,Job shop scheduling,Fair-share scheduling,Computer science,Flow shop scheduling,Algorithm,Cuckoo search,MCS algorithm,Rate-monotonic scheduling,Local search (optimization),Dynamic priority scheduling
Conference
ISSN
Citations 
PageRank 
1089-778X
0
0.34
References 
Authors
17
6
Name
Order
Citations
PageRank
Hui Wang127717.29
Wenjun Wang230442.81
Hui Sun31768.68
Changhe Li4104443.37
Shahryar Rahnamayan5143983.52
Yong Liu62526265.08