๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A branch-and-bound algorithm for the solution of two network scheduling problems

โœ Scribed by A. I. Kuksa; B. E. Polyachenko


Publisher
Springer US
Year
1984
Tongue
English
Weight
397 KB
Volume
20
Category
Article
ISSN
1573-8337

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