𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tight LP bounds for resource constrained project scheduling

✍ Scribed by Philippe Baptiste; Sophie Demassey


Publisher
Springer
Year
2004
Tongue
German
Weight
128 KB
Volume
26
Category
Article
ISSN
0171-6468

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A branch and bound algorithm for the res
✍ 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