Performance evaluation of scheduling policies for the dynamic and stochastic resource-constrained multi-project scheduling problem

Creative Commons License

Satıç U., Jacko P., Kirkbride C.

International Journal of Production Research, vol.60, no.4, pp.1411-1423, 2022 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 60 Issue: 4
  • Publication Date: 2022
  • Doi Number: 10.1080/00207543.2020.1857450
  • Journal Name: International Journal of Production Research
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, ABI/INFORM, Aerospace Database, Business Source Elite, Business Source Premier, Communication Abstracts, Compendex, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Page Numbers: pp.1411-1423
  • Keywords: Dynamic and stochastic resource-constrained multi-project scheduling problem, stochastic&#160, dynamic programming, reactive scheduling, genetic algorithm, scheduling policies
  • Abdullah Gül University Affiliated: Yes


In this study, we consider the dynamic and stochastic resource-constrained multi-project scheduling problem where projects generate rewards at their completion, completions later than a due date cause tardiness costs, task duration is uncertain, and new projects arrive randomly during the ongoing project execution both of which disturb the existing project scheduling plan. We model this problem as a discrete-time Markov decision process and explore the performance and computational limitations of solving the problem by dynamic programming. We run and compare five different solution approaches, which are: a dynamic programming algorithm to determine a policy that maximises the time-average profit, a genetic algorithm and an optimal reactive baseline algorithm, both generate a schedule to maximise the total profit of ongoing projects, a rule-based algorithm which prioritises processing of tasks with the highest processing durations, and a worst decision algorithm to seek a non-idling policy that minimises the time-average profit. The performance of the optimal reactive baseline algorithm is the closest to the optimal policies of the dynamic programming algorithm, but its results are suboptimal, up to 37.6%. Alternative scheduling algorithms are close to optimal with low project arrival probability but quickly deteriorate their performance as the probability increases.