The Solution of Multi-Objective Multimode Resource-Constrained Project Scheduling Problem with Multi-Objective Bees Metaheuristic Algorithm
Subject Areas : Industrial Management
Amir Sadeghi
1
(Faculty of management and accounting, South Tehran Branch, Islamic Azad University, Tehran, Iran)
Sina Namazi
2
(Karaj Branch, Islamic Azad University, Karaj, Iran)
Zahra Ghorajehlo
3
(Isfahan University of Technology, Isfahan, Iran)
Behnam Rezvanpour
4
(Rasht Branch, Islamic Azad University, Rasht, Iran)
Keywords:
Abstract :
Resource Constrained Project Scheduling Problem (RCPSP) is the most general scheduling problem. Job shop scheduling, flow shop scheduling and other scheduling problems are the subsets of RCPSP. The present paper examines the multimode multi-objective resource-constrained project scheduling problem (RCPSP) with partial precedence relations. To enhance the practical aspects of this prominent problem, important practical purposes including minimizing the completion time of the project, maximizing the quality of project activities and minimizing the total cost of the project were considered. After validation of the model using the Bees Algorithm, the proposed multi-objective model was solved. The results obtained from the proposed model were compared with those obtained from NSGA-II. The results demonstrated the good performance of the proposed algorithm in solving RCPSPs.
_||_