Introducing Learning Effects in Resource-constrained Project Scheduling
AbstractLearning effects assume that the efficiency of a resource increases with the duration of a task. Although these effects are commonly used in machine scheduling environments, they are rarely used in a project scheduling setting. In this paper, we study and model learning effects in a project scheduling environment and apply the model to the discrete time/resource trade-o_ scheduling problem (DTRTP), where each activity has a _fixed work content for which a set of execution modes (duration/resource requirement pairs) can be defined. Computational results emphasize the significant impact of learning effects on the project schedule, measure the margin of error made by ignoring learning and show that timely incorporation of learning effects can lead to significant makespan improvements.
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 Ghent University, Faculty of Economics and Business Administration in its series Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium with number 10/633.
Length: 2 pages
Date of creation: Jan 2010
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-04-17 (All new papers)
- NEP-CMP-2010-04-17 (Computational Economics)
- NEP-PPM-2010-04-17 (Project, Program & Portfolio Management)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Nathalie Verhaeghe).
If references are entirely missing, you can add them using this form.