Boundry Time Calculations

BTC can be very useful in software project scheduling. Slipage in the design of one function, for example, can retard further development of other functions. Here is a description boudary times used in the program:

• EST = (Earliest Start Time) - The earliest time that a task can begin when all preceding tasks are completed in the shortest possible time.

• EFT = (Earliest Finish Time) - It is the earliest time (EST) + duration of a task.
• LST = (Latest Start Time) - The latest time that a task can begin.
• LFT = (Latest Finish Time) - It is the min(LST of all predecessors).
• Slack =(Slack Time) - The amount of surplus time allowed in scheduling tasks BUT staying on schedule.

"Critical Path is when all slack times = 0."

next ->