Models for robust resource allocation in project scheduling
AbstractThe vast majority of resource-constrained project scheduling efforts assumes complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. In reality, however, project activities are subject to considerable uncertainty which generally leads to numerous schedule disruptions. In this paper, we present a resource allocation model that protects the makespan of a given baseline schedule against activity duration variability. A branch-and-bound algorithm is developed that solves the proposed robust resource allocation problem in exact and approximate formulations. The procedure relies on constraint propagation during its search. We report on computational results obtained on a set of benchmark problems.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Katholieke Universiteit Leuven in its series Open Access publications from Katholieke Universiteit Leuven with number urn:hdl:123456789/202161.
Date of creation: 2001
Date of revision:
Contact details of provider:
Web page: http://www.kuleuven.be
Model; Resource allocation; Scheduling;
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Carl Demeyere).
If references are entirely missing, you can add them using this form.