DIVISIBLE AND MOVABLE ACTIVITIES IN CRITICAL PATH ANALYSIS
Abstract
In a previous paper (AD-603 940), an analysis was given of a model in which a single job can be divided up in any manner among an arbitrary number of locations; the resulting algorithm was of the optimal network flow type, which can be simply and efficiently solved using available computer codes. In the first part of the present paper, this model is extended to multiple jobs of divisible type. The general approach is via the decomposition method of linear programming; however, the resulting algorithm is again fairly simple. When these special jobs can only be moved about the network in their entirety, or in certain indivisible modules, the problem takes on the form of an integer program. In the second part of the paper, a branch-and-bound procedure will be given for the problem of movable activities, together with efficient heuristics for arbitrating and bounding these locations, using only the ordinary critical- path algorithm. Examples are given for both models.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1969
- Accession Number
- AD0699950
Entities
People
- William S. Jewell
Organizations
- University of California, Berkeley