Patent ID: 6115642
Filing Date: 2000-09-05
Classification: G06Q

Abstract:
A scheduling method comprising the steps of:storing in a data processing system, a schedule having a plurality of interrelated activities, wherein selected ones of said interrelated activities form a critical path, said critical path defining the time required to complete said schedule, wherein each of said activities has a projected starting time and a projected ending time;identifying a first activity in said critical path having an actual ending time later than a projected ending time;assigning a float time to a projected starting time of a second activity not in said critical path and downstream from said identified first activity such that an actual starting time of said second activity is earlier or identical to said projected starting time of said second activity; andutilizing said assigned float time to absorb delays in completing activities downstream from said second activity caused by said identified first activity to thereby reduce the time to complete said schedule.