𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows

✍ Scribed by Icmeli, Oya; Erenguc, S. Selcuk

Book ID
118041365
Publisher
INFORMS
Year
1996
Tongue
English
Weight
991 KB
Volume
42
Category
Article
ISSN
0025-1909

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A metaheuristic scheduling procedure for
A metaheuristic scheduling procedure for resource-constrained projects with cash flows
✍ Dan Zhu; Rema Padman πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 244 KB πŸ‘ 2 views

Resource-constrained project scheduling problems with cash flows (RCPSPCF) are complex, combinatorial optimization problems. Many heuristics have been reported in the literature that produce reasonable schedules in limited project environments. However, the lack of a heuristic that dominates under d

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