𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Project Scheduling under Time Dependent Costs – A Branch and Bound Algorithm

✍ Scribed by N.R. Achuthan; A. Hardjawidjaja


Book ID
110344605
Publisher
Springer US
Year
2001
Tongue
English
Weight
143 KB
Volume
108
Category
Article
ISSN
0254-5330

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