A Note on “A Genetic Algorithm for the Preemptive and Non-Preemptive Multi-Mode Resource-Constrained Project Scheduling Problem

Article Preview

Abstract:

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..

You might also be interested in these eBooks

Info:

Periodical:

Pages:

527-530

Citation:

Online since:

October 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] V. Peteghem, M. Vanhoucke, A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem, European Journal of Operational Research. 201 (2010) 409-418.

DOI: 10.1016/j.ejor.2009.03.034

Google Scholar

[2] L. Deng, Y. Lin, M. Chen, Hybrid ant colony optimization for the resource-constrained project scheduling problem, Journal of Systems Engineering and Electronics. 21 (2010), 67-71.

DOI: 10.3969/j.issn.1004-4132.2010.01.012

Google Scholar

[3] R. Kolisch, Efficient priority rules for the resource-constrained project scheduling problem, Journal of Operations Management. 14 (1996), 179-192.

DOI: 10.1016/0272-6963(95)00032-1

Google Scholar

[4] L. Deng, Y. Lin, Particle swarm optimization for resource-constrained project scheduling problems with activity splitting, Control and Decision. 23 (2008), 681-685. (In Chinese).

DOI: 10.1109/ccdc.2008.4597470

Google Scholar

[5] X. Luo, D. Wang, J. Tang, Project scheduling problem involving time-splittable tasks, Journal of Northeastern University (Natural Science). 27 (2006), 961-964. (In chinese).

Google Scholar

[6] M. Eusuff, K. Lansey, F. Pasha, Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization, Engineering Optimization. 38 (2006), 129-154.

DOI: 10.1080/03052150500384759

Google Scholar