.png){kind=icon}
返回
Single-machine scheduling with an external resource
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2020.12.045.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper studies the complexity of single-machine scheduling with an external resource, which is rented for a non-interrupted period. Jobs that need this external resource are executed only when the external resource is available. There is a cost associated with the scheduling of jobs and a cost associated with the duration of the renting period of the external resource. We look at four classes of problems with an external resource: a class of problems where the renting period is budgeted and the scheduling cost needs to be minimized, a class of problems where the scheduling cost is budgeted and the renting period needs to be minimized, a class of two-objective problems where both, the renting period and the scheduling cost, are to be minimized, and a class of problems where a linear combination of the scheduling cost and the renting period is minimized. We provide a thorough complexity analysis (NP-hardness proofs and (pseudo-)polynomial algorithms) for different members of these four classes. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
Single-machine scheduling
External resource
Complexity
Pseudo-polynomial algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Overexpression of Gremlin-1 in Patients with Loeys-Dietz Syndrome: Implications on Pathophysiology and Early Disease Detection.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏Third-order exceptional point and successive switching among three states in an optical microcavity光学微腔中三阶异常点和三个状态之间的连续切换OAAI
OAAI分享收藏
查看更多内容