A branch-and-cut algorithm for schedulin
β
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