𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch-and-cut algorithm for scheduling of projects with variable-intensity activities

✍ Scribed by Tamás Kis

Book ID
106275445
Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
264 KB
Volume
103
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

✦ Synopsis

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 in the strong sense and propose a branch-and-cut algorithm for finding optimal solutions. To this end, we provide a complete description of the polytope of feasible intensity assignments to two variable-intensity activities connected by a precedence constraint along with a fast separation algorithm. A computational evaluation confirms the effectiveness of our method on various benchmark instances.

📜 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