![]() Chapter Contents |
![]() Previous |
![]() Next |
Introduction to Project Management |
Having defined the project and ensured that all the relationships have been modeled correctly, you can schedule the activities in the project by invoking PROC CPM. Suppose the activities can occur only on weekdays, and there is a holiday on July 3, 1998. Holiday information is passed to PROC CPM using the Holiday data set holidata. The following statements schedule the project to start on July 1, 1998. The early and late start schedules and additional project information are saved in the output data set survschd. The output data set produced by PROC CPM can then be used to generate a variety of reports. In this example, the data set is first sorted by the variable E_START and then displayed using the PRINT procedure (see Output 1.3.1).
data holidata; format hol date7.; hol = '3jul98'd; run; proc cpm data=survey date='1jul98'd out=survschd interval=weekday holidata=holidata; activity activity; successor succ1-succ3; duration duration; id id phase; holiday hol; run; proc sort; by e_start; run; proc print; run;Output 1.3.1: Project Schedule: Listing
goptions hpos=80 vpos=43; pattern1 c=green v=s; /* duration of a non-critical activity */ pattern2 c=green v=e; /* slack time for a noncrit. activity */ pattern3 c=red v=s; /* duration of a critical activity */ pattern4 c=magenta v=e; /* slack time for a supercrit. activity */ pattern5 c=magenta v=s; /* duration of a supercrit. activity */ pattern6 c=cyan v=s; /* actual duration of an activity */ pattern7 c=black v=e; /* break due to a holiday */ title c=black f=swiss 'Conducting a Market Survey'; title2 c=black f=swiss h=1.5 'Early and Late Start Schedule'; proc gantt graphics data=survschd holidata=holidata; chart / holiday=(hol) interval=weekday font=swiss skip=2 height=1.2 nojobnum compress noextrange activity=activity succ=(succ1-succ3) cprec=blue caxis=black ; id id phase; run;Output 1.3.2: Gantt Chart of SURVEY Project
![]() |
![]() Chapter Contents |
![]() Previous |
![]() Next |
![]() Top |
Copyright © 1999 by SAS Institute Inc., Cary, NC, USA. All rights reserved.