A binary multiple knapsack model for single machine scheduling with machine unavailability
详细信息 查看全文
- 作者：Y. Laalaouia ; y.laalaoui@tu.edu.sa" class="auth_mail" title="E-mail the corresponding author ; R. M&rsquo ; Hallahb ; rymmha@yahoo.com" class="auth_mail" title="E-mail the corresponding author ; rym.mhallah@ku.edu.kw" class="auth_mail" title="E-mail the corresponding author
- 关键词：Binary multiple knapsack ; Single machine scheduling ; Weighted number of tardy jobs ; Variable neighborhood search ; Machine maintenance ; Machine availability
- 刊名：Computers and Operations Research
- 出版年：2016
- 出版时间：August 2016
- 年：2016
- 卷：72
- 期：Complete
- 页码：71-82
- 全文大小：469 K
文摘
- •
multiple knapsack.- •
Alternative proof that this scheduling problem is NP-Complete in the strong sense.
- •
Large-sized easy instances solved within less than a second.
- •
A variable neighborhood search with linked data structure/threshold acceptance.
- •
Results show good performance/robustness, and what constitutes a difficult instance.