Citation
Exact methods for the resource levelling problem. Journal of Scheduling, 14 (6): 557-569, 2011.
Selected
Abstract
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 wellknown rlp_j10 and rlp_j20 test sets devised by Kolisch et al. (Benchmark Instances for Project Scheduling Problems, Kluwer, Boston, 1999).
There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)
doi
The doi for this publication is 10.1007/s10951-010-0207-8 You can link directly to the original paper, via the doi, from here
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@ARTICLE{2011-557-569-SI, author = {T. Gather and J. Zimmermann and J-H. Bartels},
title = {Exact methods for the resource levelling problem},
journal = {Journal of Scheduling},
year = {2011},
volume = {14},
pages = {557--569},
number = {6},
note = {Selected},
abstract = {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 wellknown rlp_j10 and rlp_j20 test sets devised by Kolisch et al. (Benchmark Instances for Project Scheduling Problems, Kluwer, Boston, 1999).},
doi = {10.1007/s10951-010-0207-8},
owner = {user},
timestamp = {2012.05.25} }