Please enable JavaScript.

Coggle requires JavaScript to display documents.

Discrete Maths (Scheduling (Activity Network (Critical Paths (critical…

- - - - source node α + sink node β
      - Cannot have loops and triangles
    - - critical activity ESi=LSi, EFi=LFi
      - gives the minimum completion time
      - there can be multiple critical paths, and critical activities are not necessary to be on the critical path
      - critical activity has a total float of 0 #
    - - ESi= max{EFi*}
      - LFi = min{LSi#}
      - work forward to get EFβ, then work backward for LF and LS
    - - accumulated time which is free in the sense that not starting the activity in the time will not lead to a delay
      - TFi= LSi -ESi
    - - the amount of spare time in the sense of not delaying any successor activity
      - FFi = min {ESi# - EFi}
      - FFi ≤ TFi (necessary condition: not critical activity + more than one successor)