𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch-and-bound algorithm for the resource-constrained project scheduling problem

✍ Scribed by U. Dorndorf; E. Pesch; T. Phan-Huy

Publisher
Springer
Year
2000
Tongue
English
Weight
184 KB
Volume
52
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

πŸ“œ 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

A genetic algorithm for multi-mode resou
A genetic algorithm for multi-mode resource constrained project scheduling problem
✍ Masao Mori; Ching Chih Tseng πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 540 KB

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