Abstract
In this article, we analyze the precedence diagramming method, the only published algorithm for time-only project scheduling with activity splitting allowed. The criteria used in this method (forward and backward pass computations) for deciding when an activity has to be interrupted are shown to be invalid in some situations. We look into the causes of these failures and propose new formulae that always provide feasible solutions. The new algorithm has been tested on 240 randomly generated problems ranging up to 600 activities and 7,200 precedence relationships, resulting in an average deviation from optima of less than 1 percent.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
CrandallK.C. (1973). “Project Planning with Precedence Lead/Lag Factors”. Project Management Quarterly 4, 18–27.
ModerJ.J., C.R.Phillips, and E.W.Davis. (1983). Project Management with CPM, PERT and Precedence Diagramming (3rd ed.). New York: Van Nostrand Reinhold.
WiestJ.D., and F.K.Levy. (1977). A Management Guide to PERT/CPM with GERT/PDM/DCPM and Other Networks (2nd ed). Englewood Cliffs, NJ: Prentice-Hall.
WiestJ.D. (1981). “Precedence Diagramming Method: Some Unusual Characteristics and Their Implications for Project Managers”, Journal of Operations Management 1, 121–130.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Valls, V., Martí, R. & Lino, P. A heuristic algorithm for project scheduling with splitting allowed. J Heuristics 2, 87–104 (1996). https://doi.org/10.1007/BF00226294
Issue Date:
DOI: https://doi.org/10.1007/BF00226294