𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch-and-bound algorithm for scheduling of new product development projects

✍ Scribed by Ranjbar, Mohammad

Book ID
119854252
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
668 KB
Volume
20
Category
Article
ISSN
0969-6016

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 branch-and-cut algorithm for schedulin
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
✍ TamΓ‘s Kis πŸ“‚ Article πŸ“… 2005 πŸ› Springer-Verlag 🌐 English βš– 264 KB

In this paper we study a resource constrained project scheduling problem in which the resource usage of each activity may vary over time proportionally to its varying intensity. We formalize the problem by means of a mixed integer-linear program, prove that feasible solution existence is NP-complete