.png){kind=icon}
返回
Resource leveling in a machine environment
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2011.01.043.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We address resource leveling problems in a machine environment. Given a set of m machines, one or more renewable resources, and a set of n tasks, each assigned to exactly one of the machines. Each task has a processing time, an earliest start time, a deadline, and resource requirements. There are no precedence relations between the tasks. The tasks have to be sequenced on the machines while minimizing a function of the level of resource utilization from each resource over time. We provide various complexity results including a polynomial time algorithm for a one machine special case. We also propose an exact method using various techniques to find optimal or close-to-optimal solutions. The computational experiments show that our exact method significantly outperforms heuristics and a commercial MIP solver. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
Parallel machines
Resource leveling
Branch and bound
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints具有一般时间和资源限制的项目计划中的资源均衡和净现值问题的程序
PREAI
分享收藏分享收藏
查看更多内容