Netzplantechnik bei knappen Kapazitäten — Lösungsverfahren der begrenzten Enumeration mit Hilfe disjunktiver Graphen und bewerteter Stufen-Netze

Abstract

Referring to Balas the problem of minimizing project duration under multiple resource constraints can be formulated by means of a disjunctive graph. In the following paper this graph is used to develop a new branch-and-bound algorithm, in which a sequence of feasible plans with decreasing project duration is generated by introducing supplementary arcs between unconnected nodes. Davis/Heidorn solved the same problem by finding the shortest path in a rank-ordered network with nodes representing subsets of unit-duration tasks. This procedure seems to be less efficient when applied to large projects. On the other hand rank networks can be employed to deal with the more general problem of minimizing project costs as a function of project duration and resource utilization.