Affiliations: [a] School of Computer Science and Engineering, Southeast University, Nanjing, Jiangsu, China | [b] Key Laboratory of Computer Network and Information Integration, Ministry of Education, Nanjing, Jiangsu, China
Correspondence:
[*]
Corresponding author: Xiaoping Li, School of Computer Science and Engineering, Southeast University, Nanjing, Jiangsu 211189, China. Tel./Fax: +86 25 5209 0916; E-mail:[email protected]
Abstract: In this paper, we consider the no-wait flowshop
scheduling problem with sequence-dependent setup times to minimize makespan,
which is widespread in industries. An enhanced greedy random adaptive search
procedure is combined with the Path-Relinking and the GRPEP method is
proposed for the problem under study. An evolutionary local search algorithm
is integrated to improve the exploration of the search process. Two local
search methods, with and without memory, are introduced to improve the
intensification. An ageing strategy is developed to increase the
diversification. The proposed algorithm is compared with existing approaches
for the considered problem and some recent effective algorithms for flowshop
scheduling problems with sequence-dependent setup times on benchmark
instances. Experimental results show that GRPEP outperforms all the compared
meta-heuristics with the same CPU-times. GRPEP obtains better solutions than
the compared heuristics
Keywords: No-wait flowshops, sequence-dependent setup times, GRASP, path-relinking, ELS
