Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 110, Issue -, Pages 413-423Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2017.06.025
Keywords
Scheduling; Distributed permutation flowshop; No-idle; Iterated reference greedy algorithm
Funding
- Ministry of Science and Technology of the Republic of China (Taiwan) [MOST104-2221-E-027-045, MOST105-2410-H-182-009-MY2]
- Linkou Chang Gung Memorial Hospital [CMRPD3G0011]
Ask authors/readers for more resources
This paper investigates the Distributed No-idle Permutation Flowshop Scheduling Problem (DNIPFSP) with the objective of minimizing the makespan, which has not been discussed in any previous study. This study presents an Iterated Reference Greedy (IRG) algorithm for effectively solving this problem. The performance of the proposed IRG algorithm is compared with a state-of-the-art iterated greedy (IG) algorithm, as well as the Mixed Integer Linear Programming (MILP) model on two well-known benchmark problem sets. Computational results show that the proposed IRG algorithm outperforms the IG algorithm. Given the NP-Complete nature of the DNIPFSP problem, this paper is the first study to contribute a feasible approach for solving it effectively. (C) 2017 Elsevier Ltd. All rights reserved.
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