Scheduling of multiple projects with constrained resources and preemption

Carlos A. Salazar-García, Jairo R. Montoya-Torres and Edgar H. Alfonso-Lizarazo

International Journal of Operational Research, 2016, vol. 27, issue 1/2, 127-148

Abstract: The resource-constrained (single) project scheduling problem has been widely studied in literature. A common assumption in its basic version is that the execution of activities cannot be interrupted, that is activities are non-preemptable. Very little effort has been made to analyse the impact of activity preemption. In addition, classical project scheduling models only consider the case of a single project. This paper considers the problem of scheduling multiple projects under the assumption of activities preemption. A heuristic algorithm is proposed and its performance is analysed using several well-known priority rules. Computational experiments are carried out using the well-known datasets from the PSP Library. Results show the advantages of incorporating activity preemption when scheduling multiple projects.

Keywords: project scheduling; multiple projects; resource constraints; priority rules; activity preemption; heuristics; multi-project scheduling; resource-constrained scheduling. (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=78458 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:27:y:2016:i:1/2:p:127-148

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().