Previous Page | Next Page

The CPM Procedure

References

Davis, E. W. (1973), “Project Scheduling under Resource Constraints: Historical Review and Categorization of Procedures,” AIIE Transactions, 5, 297–313.

Elmaghraby, S. E. (1977), Activity Networks: Project Planning and Control by Network Models, New York: John Wiley & Sons.

Horowitz, E. and Sahni, S. (1976), Fundamentals of Data Structures, Potomac, MD: Computer Science Press.

Kulkarni, R. (1991), “Scheduling with the CPM Procedure,” in Proceedings of the Sixteenth Annual SAS Users Group International Conference, Cary, NC: SAS Institute Inc.

Malcolm, D. G., Roseboom, J. H., Clark, C. E., and Fazar, W. (1959), “Applications of a Technique for R and D Program Evaluation (PERT),” Operations Research, 7(5), 646–669.

Minieka, E. (1978), Optimization Algorithms for Networks and Graphs, New York: Marcel Dekker.

Moder, J. J., Phillips, C. R., and Davis, E. W. (1983), Project Management with CPM, PERT and Precedence Diagramming, New York: Van Nostrand Reinhold Company.

SAS Institute Inc. (1993), SAS/OR Software: Project Management Examples, Cary, NC: SAS Institute Inc.

Van Slyke, R. M. (1963), “Monte Carlo Methods and the PERT Problem,” Operations Research, 11(5), 839–860.

Wiest, J. D. (1967), “A Heuristic Model for Scheduling Large Projects with Limited Resources,” Management Science, 13, 359–377.

Previous Page | Next Page | Top of Page