Date post: | 20-Jan-2018 |
Category: |
Documents |
Upload: | matilda-mccarthy |
View: | 215 times |
Download: | 0 times |
Critical Path Scheduling
(Txt: 8.5 & SOL: DM.10)
CLASSWORK (DAY 30)EXAMPLE IN CLASS
HOMEWORK (DAY 30):WORKSHEET DAY 30QUIZ NEXT BLOCK
Critical Path Scheduling (do not confuse with Critical Paths)
Build your on list: 1) list all paths and totals2) Eliminate/change totals. Pick the task list with the largest
totals until you use all tasks; this will result in your priority list3) Schedule your priority list with two processors.4) Use the processors with your priority list.5) Determine your decreasing task time. Your task list starts at
the largest time and decreases to the smallest time Directive arrows do not matter.
6) Determine “loosen” diagraph constraints; everything is Independent (just go through the list)
Critical Path Scheduling
https://www.youtube.com/watch?v=3dYJRpsmSgY