𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A genetic algorithm for multi-mode resource constrained project scheduling problem

✍ Scribed by Masao Mori; Ching Chih Tseng

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
540 KB
Volume
100
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

✦ Synopsis

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 stochastic scheduling method proposed by Drexl and Gruenewald. Computational results show that the proposed genetic algorithm is superior to the stochastic scheduling method. ~) 1997 Elsevier Science B.V.

πŸ“œ SIMILAR VOLUMES

A branch and bound algorithm for the res
A branch and bound algorithm for the resource-constrained project scheduling problem
✍ Peter Brucker; Sigrid Knust; Arno Schoo; Olaf Thiele πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 257 KB

A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacit