Breakout dynasearch for the single-machine total weighted tardiness problem
详细信息 查看全文
- 作者：Junwen Dinga ; dingjunwen@hust.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Zhipeng Lü ; a ; b ; zhipeng.lui@gmail.com" class="auth_mail" title="E-mail the corresponding author ; T.C.E. Chengb ; lgtcheng@polyu.edu.hk" class="auth_mail" title="E-mail the corresponding author ; Liping Xua ; xlphust@163.com" class="auth_mail" title="E-mail the corresponding author
- 关键词：Heuristic ; Single-machine scheduling ; Breakout local search ; Adaptive perturbation strategy ; Dynasearch
- 刊名：Computers & Industrial Engineering
- 出版年：2016
- 出版时间：August 2016
- 年：2016
- 卷：98
- 期：Complete
- 页码：1-10
- 全文大小：706 K
文摘
- •
BDS combines the dynasearch and an adaptive perturbation mechanism.
- •
The dynasearch is improved with a fast neighbourhood search.
- •
BDS is a competitive metaheuristic to solve 300-job instances in 252 s in average.