.png){kind=icon}
返回
Optimal interval scheduling with a resource constraint
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2014.06.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a scheduling problem where n jobs have to be carried out by m parallel identical machines. The attributes of a job j are a fixed start time S-j, a fixed finish time f(j), a resource requirement r(i), and a value v. Every machine owns R units of a renewable resource necessary to carry out jobs. A machine can process more than one job at a time, provided the resource consumption does not exceed R. The jobs must be processed in a non-preemptive way. Within this setting, we ask for a subset of jobs that can be feasibly scheduled with the maximum total value. For this strongly NP-hard problem, we first discuss an approximation result. Then, we propose a column generation scheme for the exact solution. Finally, we suggest some greedy heuristics and a restricted enumeration heuristic. All proposed algorithms are implemented and tested on a large set of randomly generated instances. It turns out that the column generation technique clearly outperforms the direct resolution of a natural compact formulation; the greedy algorithms produce good quality solutions in negligible time, whereas the restricted enumeration averages the performance of the greedy methods and the exact technique. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Scheduling
Fixed job scheduling
Resource allocation
Complexity
Branch and price
Heuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Psychiatric Sequelae Following Breast Cancer Chemotherapy: A Pilot Study Using Claims Data乳腺癌化疗后的精神病后遗症: 一项使用索赔数据的初步研究
OAAI
OAAI分享收藏The Impact of Participation in Victim-Offender Mediation Sessions on Recidivism of Serious Offenders
PREAI
分享收藏
查看更多内容