A Novel Heuristic Approach for Multi-Mode Resource Constrained Project Scheduling Problems

  • Mazhar Ali Department of Industrial Engineering, University of Engineering & Technology (UET), Taxila.
  • Saif Ullah Department of Industrial Engineering, University of Engineering & Technology (UET), Taxila.
  • Mirza Jahanzaib Department of Industrial Engineering, University of Engineering & Technology (UET), Taxila.
Keywords: project scheduling, multi-mode problem, NP-hard, heuristic, makespan minimization

Abstract

Multimode project scheduling problem has significant application in project-based organizations. It is an NP-hard
(Non-Polynomial) problem and, therefore, several heuristic and meta heuristic techniques are employed in literature to
solve these problems. In this paper, we propose a novel heuristic approach for multimode resource constrained project
scheduling (MMRCPS). The proposed heuristic introduces an efficient technique to simultaneously optimize the
resource utilization and activity mode selection. The heuristic is designed for makespan minimization. Furthermore,
it incorporates certain activity shifting techniques to reduce makespan of the project. The proposed heuristic is tested
on benchmark instances taken from PSPLIB (Project scheduling problem library) and a comparison is performed
against optimal results. The proposed heuristic delivers better results in comparison with those reported in the
existing literature.

Published
1931-12-20
How to Cite
Ali, M., Ullah, S., & Jahanzaib, M. (1931). A Novel Heuristic Approach for Multi-Mode Resource Constrained Project Scheduling Problems. Quaid-E-Awam University Research Journal of Engineering, Science & Technology, Nawabshah., 17(2), 13-20. Retrieved from http://publications.quest.edu.pk/ojs-3.1.1-4/index.php/qrj/article/view/102