Multi-project scheduling using an heuristic and a genetic algorithm
β Scribed by S. Kumanan; G. Jegan Jose; K. Raja
- Book ID
- 105851380
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Weight
- 149 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0268-3768
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Genetic algorithms (GA) have been widely used to solve planning problems. However, they require one to determine the optimal values of many genetic parameters, such as population sizes, crossover probability, mutation probability, and so on. To make matters worse, the most suitable combination of pa
This article considers a general class of nonpreemptive multi-mode resource-constrained project scheduling problems in which activity durations depend on committed renewable resources (multi-mode time resource tradeoff). We propose a genetic algorithm for these problems and compare it with a stochas