Scheduling of multiple projects with constrained resources and preemption
by Carlos A. Salazar-García; Jairo R. Montoya-Torres; Edgar H. Alfonso-Lizarazo
International Journal of Operational Research (IJOR), Vol. 27, No. 1/2, 2016

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.

Online publication date: Mon, 22-Aug-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com