Journal
IEEE ACCESS
Volume 5, Issue -, Pages 15694-15705Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2017.2732738
Keywords
Flowshop scheduling; hybrid meta-heuristic; distributed blocking flowshop
Categories
Funding
- Ministry of Science and Technology of the Republic of China, Taiwan [MOST106-2221-E-027-085, MOST105-2410-H-182-009-MY2]
- Linkou Chang Gung Memorial Hospital [CMRPD3G0011]
Ask authors/readers for more resources
This paper studies the distributed blocking flow shop scheduling problem (DBFSP) using meta-heuristics. A mixed integer programming model for solving the problem is proposed, and then three versions of the hybrid iterated greedy algorithm (HIG(1), HIG(2), and HIG(3)) are developed, combining the advantages of an iterated greedy algorithm with the operators of the variable Tabu list, the constant Tabu list, and the cooling schedule. A benchmark problem set is used to assess empirically the performance of the HIG(1), HIG(2), and HIG(3) algorithms. Computational results show that all the three versions of the proposed algorithm can efficiently and effectively minimize the maximum completion time among all factories of the DBFSP, and HIG(1) is the most effective.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available