Solving Resource Constrained Project Scheduling Problem by a Discrete Version of Cuckoo Search Algorithm

Author(s):  
Huu Dang Quoc ◽  
Loc Nguyen The ◽  
Cuong Nguyen Doan ◽  
Toan Phan Thanh
2020 ◽  
Vol 65 (6) ◽  
pp. 98-109
Author(s):  
Huu Dang Quoc ◽  
Loc Nguyen The ◽  
Cuong Nguyen Doan ◽  
Toan Phan Thanh

The purpose of this paper is to consider the project scheduling problem under such limited constraint, called Multi-Skill Resource-Constrained Project Scheduling Problem or MS-RCPSP. The algorithm proposed in this paper is to find the optimal schedule, determine the start time for each task so that the execution time (also called makespan) taken is minimal. At the same time, our scheduling algorithm ensures that the given priority relationships and constraints are not violated. Our scheduling algorithm is built based on the Cuckoo Search strategy. In order to evaluate the proposed algorithm, experiments were conducted by using the iMOPSE dataset. The experimental results proved that the proposed algorithm found better solutions than the previous algorithm.


2018 ◽  
Vol 69 ◽  
pp. 493-503 ◽  
Author(s):  
Kirils Bibiks ◽  
Yim-Fun Hu ◽  
Jian-Ping Li ◽  
Prashant Pillai ◽  
Aleister Smith

Sign in / Sign up

Export Citation Format

Share Document