.png){kind=icon}
返回
A binary multiple knapsack model for single machine scheduling with machine unavailability
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2016.02.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses the single machine weighted number of on-time jobs scheduling problem where the machine is unavailable during one or more maintenance periods and the jobs share a common due date. It models the problem as a binary multiple knapsack (MKP), and offers an alternative proof that the problem is NP-Complete in the strong sense. Subsequently, it shows that some large-sized instances can be solved exactly within less than a second using an off-the-shelf solver. For difficult instances, the paper proposes a variable neighborhood search based heuristic V that explores the MKP nature of the problem to determine near-optima. V is dotted with two mechanisms that speed its convergence toward near global optima: a linked list data structure and a dynamic threshold acceptance criterion. Experimental results provide computational evidence of the efficiency and efficacy of V for benchmark MKP instances and for scheduling problems alike. It further discusses the robustness of V with respect to the initial solution and problem's parameters. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Binary multiple knapsack
Single machine scheduling
Weighted number of tardy jobs
Variable neighborhood search
Machine maintenance
Machine availability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Experimental study of the non-linear behaviour of beam-to-column composite joints复合梁柱节点非线性行为的实验研究
OAAI
OAAI分享收藏
查看更多内容