A Genetic Algorithm Based Solution with Schedule Mode for RCPSP

Article Preview

Abstract:

Resource-Constrained Project Scheduling Problem (RCPSP) is a well-known NP hard problem and more intelligent optimization algorithms are developed to solve it. In this paper, genetic algorithm(GA) is employed to deal with RCPSP. A priority value encoding scheme is designed to in the algorithm. The numerical results indicate that our methods is slightly better as far as solution quality is concerned and requires smaller solution time than the GA where an activity list encoding with schedule mode is used.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 268-270)

Pages:

1802-1805

Citation:

Online since:

July 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] P. Brucker, A. Drexl, R. N¨ohring, K. Neumann, E. Pesch. European, Journal of Operational Research. Vol. 112 (1999), p.262–273.

Google Scholar

[2] P. Brucker, S. Knust, A. Schoo, O. Thiele. European Journal of Operational Research. Vol. 107 (1998), p.272–288.

DOI: 10.1016/s0377-2217(97)00335-4

Google Scholar

[3] K. Bouleimen, H. Lecocq. European Journal of Operational Research. Vol. 149 (2003), p.268–281.

Google Scholar

[4] J. Alcaraz, C. Maroto. Annals of Operations Research. Vol. 102 (2001), p.83–109.

Google Scholar

[5] S. Hartmann. Naval Research Logistics. Vol. 456(1998), p.733–750.

Google Scholar