.png){kind=icon}
.png){kind=icon}
Return
Resource leveling in a machine environment
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2011.01.043.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Scheduling
Parallel machines
Resource leveling
Branch and bound