Non-dominated Sorting Genetic Algorithm-II to solve bi-objective multi-mode resource-constrained project scheduling problem

Author(s):  
Najeh Damak ◽  
Bassem Jarboui ◽  
Taicir Loukil
2011 ◽  
Vol 127 ◽  
pp. 527-530
Author(s):  
Yi Han ◽  
Jian Hu Cai ◽  
Ikou Kaku ◽  
Hua Zhen Lin ◽  
Xu Hong Ye ◽  
...  

Peteghem et al. [1] considered resource-constrained project scheduling problem (RCPSP) with preemptive activities. However, some points should be made clear. How and when an activity is divided? How many parts an activity should be splitted? Whether the preemptive-based scenario is correctly performed to further improve the total makespan of a project? The first two questions are not very clearly presented. As for the last question, the answer is “no exactly” after careful examination..


Sign in / Sign up

Export Citation Format

Share Document