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
β¦ LIBER β¦
The multi-mode resource-constrained project scheduling problem with generalized precedence relations
β Scribed by Bert De Reyck; Willy Herroelen
- Book ID
- 108445562
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 186 KB
- Volume
- 119
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A genetic algorithm for multi-mode resou
β
Masao Mori; Ching Chih Tseng
π
Article
π
1997
π
Elsevier Science
π
English
β 540 KB
PROGRESS: Optimally solving the generali
β
Robert Klein; Armin Scholl
π
Article
π
2000
π
Springer
π
English
β 292 KB
A mathematical model for the multi-mode
β
Majid Sabzehparvar; S. Mohammad Seyed-Hosseini
π
Article
π
2007
π
Springer US
π
English
β 426 KB
Local search techniques for the generali
β
Scott E. Sampson; Elliott N. Weiss
π
Article
π
1993
π
John Wiley and Sons
π
English
β 665 KB
In this article we address the problem of scheduling a single project network with both precedence and resource constraints through the use of a local search technique. We choose a solution definition which guarantees precedence feasibility, allowing the procedure to focus on overcoming resource inf
A new formulation of the resource-uncons
β
Lucio Bianco; Massimiliano Caramia
π
Article
π
2010
π
John Wiley and Sons
π
English
β 273 KB
Tabu search for multi-mode resource-cons
β
Marek Mika; Grzegorz WaligΓ³ra; Jan WΔglarz
π
Article
π
2008
π
Elsevier Science
π
English
β 187 KB