The CPM Procedure
- Overview
- Getting Started
-
Syntax
Functional Summary Dictionary of Options PROC CPM Statement ACTIVITY Statement ACTUAL Statement ALIGNDATE Statement ALIGNTYPE Statement BASELINE Statement CALID Statement DURATION Statement HEADNODE Statement HOLIDAY Statement ID Statement PROJECT Statement RESOURCE Statement SUCCESSOR Statement TAILNODE Statement -
Details
Scheduling Subject to Precedence Constraints Using the INTERVAL= Option Nonstandard Precedence Relationships Time-Constrained Scheduling Finish Milestones OUT= Schedule Data Set Multiple Calendars Baseline and Target Schedules Progress Updating Resource-Driven Durations and Resource Calendars Resource Usage and Allocation RESOURCEOUT= Usage Data Set RESOURCESCHED= Resource Schedule Data Set Multiproject Scheduling Macro Variable ORCPM Input Data Sets and Related Variables Missing Values in Input Data Sets FORMAT Specification Computer Resource Requirements
-
Examples
Activity-on-Node Representation Activity-on-Arc Representation Meeting Project Deadlines Displaying the Schedule on a Calendar Precedence Gantt Chart Changing Duration Units Controlling the Project Calendar Scheduling around Holidays CALEDATA and WORKDATA Data Sets Multiple Calendars Nonstandard Relationships Activity Time Constraints Progress Update and Target Schedules Summarizing Resource Utilization Resource Allocation Using Supplementary Resources INFEASDIAGNOSTIC Option and Aggregate Resource Type Variable Activity Delay Activity Splitting Alternate Resources PERT Assumptions and Calculations Scheduling Course - Teacher Combinations Multiproject Scheduling Resource-Driven Durations and Resource Calendars Resource-Driven Durations and Alternate Resources Multiple Alternate Resources Auxiliary Resources and Alternate Resources Use of the SETFINISHMILESTONE Option Negative Resource Requirements Auxiliary Resources and Negative Requirements Resource-Driven Durations and Negative Requirements Statement and Option Cross-Reference Tables
- References
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.