An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources

Aidin Delgoshaei (), Timon Rabczuk, Ahad Ali and Mohd Khairol Anuar Ariffin
Additional contact information
Aidin Delgoshaei: University Putra Malaysia (UPM)
Timon Rabczuk: Bauhaus-Universität Weimar
Ahad Ali: Lawrence Technological University
Mohd Khairol Anuar Ariffin: University Putra Malaysia (UPM)

Annals of Operations Research, 2017, vol. 259, issue 1, No 5, 85-117

Abstract: Abstract The issue resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resources over-allocating are frequently seen after scheduling of a project in practice which causes the schedule to be useless. Modifying an over-allocated schedule is very complicated and needs a lot of efforts and time. In this research a new method is developed for modifying over-allocated schedules in multi-mode resource constrained project scheduling problems with positive cash flows (MRCPSP-PDC). The aim is maximizing net present value of the MRCPSPs (or logically minimizing negative cash flows). The proposed method is designed to consider all types of activity precedence including Finish to Start, Start to Start, Finish to Finish and Start to Finish and also lags between activities. It can also be used alone or as a macro in Microsoft Office Project $$^{\textregistered }$$ ® Software to modify resource over-allocated days after scheduling a project. In this research progress payment method and preemptive resources are considered. The proposed approach maximizes NPV by scheduling activities through the resource calendar respecting to the available level of pre-emptive resources and activity numbers. To examine the performance of the proposed method a number of experiments that is derived from the literature are solved. The results are then compared with the state where resource constraints are relaxed and also Simulated Annealing algorithm. The outcomes show that the proposed algorithm can provide modified schedules with no over-allocated days for experiment with 1000 activities and 100 preemptive resources in a few seconds. The method is then applied for scheduling a manufacturing project in practice.

Keywords: Multi-mode resource constraint; Positive cash flow; Resource over-allocation (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-016-2336-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:annopr:v:259:y:2017:i:1:d:10.1007_s10479-016-2336-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-016-2336-8

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().