An Enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
详细信息 查看全文
- 作者：Omid Shahvari shahvaro@oregonstate.edu" class="auth_mail" title="E-mail the corresponding author ; Rasaratnam Logendran ; Logen.Logendran@oregonstate.edu" class="auth_mail" title="E-mail the corresponding author
- 关键词：Bi-criteria ; Batch scheduling ; Group scheduling ; Unrelated-parallel machines ; Tabu search ; Sequence- and machine-dependent setup time
- 刊名：Computers and Operations Research
- 出版年：2017
- 出版时间：January 2017
- 年：2017
- 卷：77
- 期：Complete
- 页码：154-176
- 全文大小：2735 K
文摘
- •
A batching and scheduling problem with desired lower bounds on batch sizes.
- •
Bi-objective to minimize production cost and maximize customer satisfaction.
- •
An MILP model to address the problem including job releases/machine availabilities.
- •
Several lemmas to enhance the efficiency and effectiveness of TS-based algorithms.
- •
A benchmark to show the benefits of integrating the batching decision.