Name
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1109/TEVC.2002.804914 | IEEE Trans. Evolutionary Computation |
Keywords | Field | DocType |
manufacturing,project management,genetic algorithms,evolutionary computation,heuristics,machinery,project scheduling,scheduling,single mode,sequences,job shop scheduling,algorithm design and analysis,evolutionary algorithm | Mathematical optimization,Schedule (project management),Evolutionary algorithm,Computer science,Scheduling (computing),Evolutionary computation,Cultural algorithm,Genetic algorithm,Project management,Computation | Journal |
Volume | Issue | ISSN |
6 | 5 | 1089-778X |
Citations | PageRank | References |
33 | 2.13 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Khalil S. Hindi | 1 | 398 | 22.75 |
| Hongbo Yang | 2 | 33 | 2.13 |
| Krzysztof Fleszar | 3 | 368 | 25.38 |