Critical Path Scheduling with Drag and Pull

摘要

Systems, computer-implemented methods and non-transitory computer-readable storage medium are provided for calculating drag and pull metrics in a multi-calendar schedule. A driving relationship is a relationship that determines the start date of its successor (task). Driving relationships are identified during schedule calculation. Driving successor paths, consisting of a path of tasks and relationships where each relationship is a driving relationship, are identified. Post schedule calculation, drag and pull are calculated for any driving paths in the schedule by iteratively recalculating the schedule (forward pass—early start, early finish) while incrementing the duration of each task on the driving path (one task at a time) one time unit per iteration (starting from zero and working up to the task's original duration) and measuring the effect on the end (early finish of the last task) of its successor driving path.

主权项

1. A computer-implemented method for determining a schedule comprising:
under control of one more processors configured with executable instructions: determining a driving successor path in the schedule, wherein the driving successor path comprises a path comprising at least one task, and upon the condition that the path comprises more than one tasks, determining at least one driving relationship connecting each task to its successor in the path,
wherein the schedule comprises a plurality of tasks and one or more relationships, andwherein the driving relationship determines an early start and/or an early finish of a successor task.