An effective iterated greedy algorithm for PCBs grouping problem to minimize setup times

2021 ◽  
Vol 112 ◽  
pp. 107830
Author(s):  
Jiang-Ping Huang ◽  
Quan-Ke Pan ◽  
Liang Gao ◽  
Ling Wang
Keyword(s):  
Greedy Algorithm ◽  
Setup Times ◽  
Iterated Greedy Algorithm ◽  
Grouping Problem ◽  
Iterated Greedy

A Hybrid Iterated Greedy Algorithm for No-Wait Flowshop with Sequence Dependent Setup Times to Minimize Makespan

2014 ◽  
Vol 933 ◽  
pp. 459-466 ◽  
Author(s):  
Wei Jin Zhuang ◽  
Tao Xu ◽  
Ming Yang Sun
Keyword(s):  
Greedy Algorithm ◽  
Setup Times ◽  
Reconstruction Procedure ◽  
Sequence Dependent ◽  
Iterated Greedy Algorithm ◽  
Sequence Dependent Setup ◽  
No Wait ◽  
Iterated Greedy ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times

In this paper, the widespread no-wait flowshop in industries is considered with sequence dependent setup times to minimize makespan. A hybrid iterated greedy framework is constructed. A destruction-reconstruction procedure and a composite local search are introduced to improve the initial solution, respectively. To enhance the diversification of the proposal, a solution acceptance criterion is adopted to accept a worse solution with a probability. An efficient hybrid iterated greedy algorithm is investigated for the considered problem. The proposal is compared with the existing best deterministic heuristics and non-deterministic algorithm on Taillards benchmark instances. Experimental results show that the proposal gets best performance against the deterministic heuristics. The proposed algorithm outperforms the non-deterministic one on most instances with the same computation-time.

Sign in / Sign up

Export Citation Format

Share Document