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

Aidin Delgoshaei, Timon Rabczuk, Ahad Ali, Mohd Khairol Anuar Ariffin

Research output: Contribution to journalArticle

2 Citations (Scopus)

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(Formula presented.) 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.

Original languageEnglish
Pages (from-to)1-33
Number of pages33
JournalAnnals of Operations Research
DOIs
Publication statusAccepted/In press - 2016 Oct 7
Externally publishedYes

Fingerprint

Schedule
Resource constraints
Resources
Cash flow
Experiment
Net present value
Project scheduling
Simulated annealing algorithm
Lag
Payment methods
Calendar
Software
Microsoft
Manufacturing
Engineers
Resource-constrained project scheduling

Keywords

  • Multi-mode resource constraint
  • Positive cash flow
  • Resource over-allocation

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research

Cite this

An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources. / Delgoshaei, Aidin; Rabczuk, Timon; Ali, Ahad; Ariffin, Mohd Khairol Anuar.

In: Annals of Operations Research, 07.10.2016, p. 1-33.

Research output: Contribution to journalArticle

@article{0198822a349149c2b197d10020115ff8,
title = "An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources",
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(Formula presented.) 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",
author = "Aidin Delgoshaei and Timon Rabczuk and Ahad Ali and Ariffin, {Mohd Khairol Anuar}",
year = "2016",
month = "10",
day = "7",
doi = "10.1007/s10479-016-2336-8",
language = "English",
pages = "1--33",
journal = "Annals of Operations Research",
issn = "0254-5330",
publisher = "Springer Netherlands",

}

TY - JOUR

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

AU - Delgoshaei, Aidin

AU - Rabczuk, Timon

AU - Ali, Ahad

AU - Ariffin, Mohd Khairol Anuar

PY - 2016/10/7

Y1 - 2016/10/7

N2 - 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(Formula presented.) 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.

AB - 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(Formula presented.) 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.

KW - Multi-mode resource constraint

KW - Positive cash flow

KW - Resource over-allocation

UR - http://www.scopus.com/inward/record.url?scp=84990943497&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84990943497&partnerID=8YFLogxK

U2 - 10.1007/s10479-016-2336-8

DO - 10.1007/s10479-016-2336-8

M3 - Article

AN - SCOPUS:84990943497

SP - 1

EP - 33

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

ER -