Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]

Subroutine A R S M E solves a resource constrained, network scheduling problem for the case in which activities may be arbitrarily interrupted and restarted later with no increase in activity duration. The number of resource types is not a limiting factor in our procedure. The amount of any one resource available at any moment is constant. We shall use the "activity-on-arc" network representation, under the commonly imposed assumption that the network contains no directed cycles and has only one "beginning" and only one "terminal" node (event). I t is further assumed that the network nodes (events) are ordered in such a way t h a t node i precedes node j, if i < j. Such an ordering is always possible and it induces an ordering among the arcs (activities).