Divisible Activities in Critical Path Analysis

William S. Jewell
Additional contact information
William S. Jewell: University of California, Berkeley, California

Operations Research, 1965, vol. 13, issue 5, 747-760

Abstract: A critical path scheduling problem is investigated in which a single activity can have its completion time divided up and allocated to different “locations” in the project precedence network. An algorithm for determining the allocation that minimizes total project duration is given, together with an outline of an optimality proof, and an example. Although the algorithm is very similar to those used in network-flow type problems, and uses only integer-valued variables, the final results for the divisible-activity network are, in general, rational numbers.

Date: 1965
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.13.5.747 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:13:y:1965:i:5:p:747-760

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().