Exact methods for the resource levelling problem

We present a project scheduling problem subject to general temporal constraints where the utilization of a set of renewable resources has to be smoothed over time. For solving the NP-hard optimization problem, we point out some important structural properties and introduce a new enumeration scheme....

Full description

Saved in:
Bibliographic Details
Published in:Journal of scheduling 2011-12, Vol.14 (6), p.557-569
Main Authors: Gather, Thorsten, Zimmermann, Jürgen, Bartels, Jan-Hendrik
Format: Article
Language:English
Subjects:
Artificial Intelligence
Benchmarking
Business and Management
Calculus of Variations and Optimal Control
Optimization
Dynamic programming
Enumeration
Heuristic
Information technology
Levelling
Linear programming
Methods
Operations research
Operations Research/Decision Theory
Optimization
Project management
Renewable resources
Scheduling
Software
Studies
Supply Chain Management
Temporal logic
Test sets
Workloads
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a project scheduling problem subject to general temporal constraints where the utilization of a set of renewable resources has to be smoothed over time. For solving the NP-hard optimization problem, we point out some important structural properties and introduce a new enumeration scheme. Combining this enumeration scheme with some branch-and-bound techniques, we propose an appropriate solution procedure for the project scheduling problem at hand. To outline the practical importance of resource levelling, we sketch exemplary the optimization of mid-term planning schedules with regard to the resource requirements of IT projects. Finally, we present results from a comprehensive computational study on problem instances of the well-known rlp _ j 10 and rlp _ j 20 test sets devised by Kolisch et al. (Benchmark Instances for Project Scheduling Problems, Kluwer, Boston, 1999 ).
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-010-0207-8