Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/10417
Title: A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan
Authors: Xu, J
Yin, Y
Cheng, TCE 
Wu, CC
Gu, S
Keywords: Makespan
Memetic algorithm
Re-entrant permutation flowshop scheduling
Issue Date: 2014
Publisher: Elsevier
Source: Applied soft computing, 2014, v. 24, p. 277-283 How to cite?
Journal: Applied soft computing 
Abstract: A common assumption in the classical permutation flowshop scheduling model is that each job is processed on each machine at most once. However, this assumption does not hold for a re-entrant flowshop in which a job may be operated by one or more machines many times. Given that the re-entrant permutation flowshop scheduling problem to minimize the makespan is very complex, we adopt the CPLEX solver and develop a memetic algorithm (MA) to tackle the problem. We conduct computational experiments to test the effectiveness of the proposed algorithm and compare it with two existing heuristics. The results show that CPLEX can solve mid-size problem instances in a reasonable computing time, and the proposed MA is effective in treating the problem and outperforms the two existing heuristics.
URI: http://hdl.handle.net/10397/10417
ISSN: 1568-4946
EISSN: 1872-9681
DOI: 10.1016/j.asoc.2014.07.002
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

6
Last Week
0
Last month
1
Citations as of Sep 11, 2017

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Sep 20, 2017

Page view(s)

44
Last Week
0
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.