Author(s):
1. Mazhar Ali:
Department of Industrial Engineering, University of Engineering & Technology (UET), Taxila, Pakistan
2. Saif Ullah:
Department of Industrial Engineering, University of Engineering & Technology (UET), Taxila, Pakistan
3. Mirza Jahanzaib:
Department of Industrial Engineering, University of Engineering & Technology (UET), Taxila, Pakistan
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.
Page(s):
13-20
DOI:
DOI not available
Published:
Journal: Quaid-e-Awam University Research Journal of Engineering, Science and Technology, Volume: 17, Issue: 2, Year: 2019
Keywords:
multimode problem
,
makespan minimization
,
Heuristic
,
NPhard
,
project scheduling
References:
References are not available for this document.
Citations
Citations are not available for this document.