An evolutionary algorithm for resource-constrained project scheduling

Author

Hindi, Khalil S. ; Yang, Hongbo ; Fleszar, Krzysztof

Volume

6

Issue

5

fYear

2002

fDate

10/1/2002 12:00:00 AM

Firstpage

512

Lastpage

518

Abstract

The single-mode, single-project, resource-constrained project-scheduling problem is solved by an evolutionary algorithm. The design of this algorithm is presented. Results of a computational study on two sets of benchmark problems, the first consisting of 330 problem instances and the second 2040, are presented. These results show that the proposed algorithm is effective in terms of the number of times it achieves both the best-known solutions and the average error with respect to these solutions, particularly given that the best-known solutions have been compiled from various sources, using a variety of algorithms. Moreover, the computation time requirements are quite modest

Keywords

genetic algorithms; project management; scheduling; average error; crossover operators; evolutionary algorithm; heuristics; mutation operators; resource-constrained project scheduling; sequences; Algorithm design and analysis; Costs; Evolutionary computation; Job shop scheduling; Machinery; Manufacturing; Processor scheduling; Research and development; Research and development management; Systems engineering and theory;

fLanguage

English

Journal_Title

Evolutionary Computation, IEEE Transactions on

Publisher

ieee

ISSN

1089-778X

Type

jour

DOI

10.1109/TEVC.2002.804914

Filename

1041558