The CPM Procedure
- Overview
- Getting Started
-
Syntax
-
DetailsScheduling Subject to Precedence ConstraintsUsing the INTERVAL= OptionNonstandard Precedence RelationshipsTime-Constrained SchedulingFinish MilestonesOUT= Schedule Data SetMultiple CalendarsBaseline and Target SchedulesProgress UpdatingResource-Driven Durations and Resource CalendarsResource Usage and AllocationRESOURCEOUT= Usage Data SetRESOURCESCHED= Resource Schedule Data SetMultiproject SchedulingMacro Variable _ORCPM_Input Data Sets and Related VariablesMissing Values in Input Data SetsFORMAT SpecificationComputer Resource Requirements
-
ExamplesActivity-on-Node RepresentationActivity-on-Arc RepresentationMeeting Project DeadlinesDisplaying the Schedule on a CalendarPrecedence Gantt ChartChanging Duration UnitsControlling the Project CalendarScheduling around HolidaysCALEDATA and WORKDATA Data SetsMultiple CalendarsNonstandard RelationshipsActivity Time ConstraintsProgress Update and Target SchedulesSummarizing Resource UtilizationResource AllocationUsing Supplementary ResourcesINFEASDIAGNOSTIC Option and Aggregate Resource TypeVariable Activity DelayActivity SplittingAlternate ResourcesPERT Assumptions and CalculationsScheduling Course - Teacher CombinationsMultiproject SchedulingResource-Driven Durations and Resource CalendarsResource-Driven Durations and Alternate ResourcesMultiple Alternate ResourcesAuxiliary Resources and Alternate ResourcesUse of the SETFINISHMILESTONE OptionNegative Resource RequirementsAuxiliary Resources and Negative RequirementsResource-Driven Durations and Negative RequirementsStatement 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, 700–714. Cary, NC: SAS Institute Inc. http://www.sascommunity.org/sugi/SUGI91/Sugi-91-118%20Kulkarni.pdf.
-
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: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.
-
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:839–860.
-
Wiest, J. D. (1967). “A Heuristic Model for Scheduling Large Projects with Limited Resources.” Management Science 13:359–377.