An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

2012 ◽  
Vol 45 (3) ◽  
pp. 351-362 ◽  
Author(s):  
Guanlong Deng ◽  
Xingsheng Gu
Keyword(s):  
Greedy Algorithm ◽  
Single Machine ◽  
Setup Times ◽  
Total Weighted Tardiness ◽  
Weighted Tardiness ◽  
Iterated Greedy Algorithm ◽  
Sequence Dependent Setup ◽  
Iterated Greedy ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times

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