Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
详细信息 查看全文
- 作者：M. Fatih Tasgetirena ; fatih.tasgetiren@yasar.edu.tr" class="auth_mail" title="E-mail the corresponding author ; Damla Kizilaya ; Quan-Ke Panb ; P.N. Suganthanc
- 关键词：Meta-heuristics ; Blocking flowshop ; Iterated greedy algorithm ; Variable neighborhood search ; Constructive heuristics
- 刊名：Computers and Operations Research
- 出版年：2017
- 出版时间：January 2017
- 年：2017
- 卷：77
- 期：Complete
- 页码：111-126
- 全文大小：2167 K
文摘
- •
A new constructive heuristic is proposed.
- •
Speed-up methods from the literature are adapted very well.
- •
IG algorithm is superior with the speed-up method. But without a speed-up method, its performance is poor.
- •
We propose an iteration jumping probability to employ the swap neighborhood structure.
- •
Ultimately, 85 out of 90 problem instances are further improved.