![]() Chapter Contents | ![]() Previous | ![]() Next |
The Projman Application
The primary scheduling rule is used to order the list of activities whosepredecessor activities have been completed whilescheduling activities subject to resource constraints. The secondary schedulingrule is used to break ties caused by the primary scheduling rule. The schedulingrule choices are
Activity Priority | Late Finish Time | ||
Delayed Late Start | Resource Priority | ||
Late Start Time | Shortest Duration |
The default primary scheduling rule is Late Start Time, while the default secondaryscheduling rule is Shortest Duration.
Activity Priority
The Activity Priority scheduling rule specifies that activities in thewaiting list (for resources) should be sorted in the order of increasingvalues of their priority.Delayed Late Start
The Delayed Late Start scheduling rule specifies that activities in thewaiting list (for resources) should be sorted in the order of increasingvalues of their late start plus theirdelay.Late Start Time
The Late Start Time scheduling rule specifies that activities in thewaiting list (for resources) should be sorted in the order of increasingvalues of their late start.Late Finish Time
The Late Finish Time scheduling rule specifies that activities in thewaiting list (for resources) should be sorted in the order of increasingvalues of their late finish.Resource Priority
The Resource Priority scheduling rule specifies that activities in thewaiting list (for resources) should be sorted in the order of increasingvalues of the resource priority for the mostimportant resource used by each activity. In other words, the resourcepriorities are used to assign priorities to the activities in the project;these activity priorities are then used to order the activities in the waitinglist (in increasing order).Shortest Duration
The Shortest Duration scheduling rule specifies that activities in thewaiting list (for resources) should be sorted in the order of increasingvalues of their durations. ![]() Chapter Contents | ![]() Previous | ![]() Next | Top |
Copyright © 1999 by SAS Institute Inc., Cary, NC, USA. All rights reserved.