Discrete Mathematics with Graph Theory (3rd Edition) 319

Discrete Mathematics with Graph Theory (3rd Edition) 319 -...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Section 11.5 317 and where arcs correspond to tasks. The weight of an arc is the cost of the task. One shortest path costs $2000 and passes through vertices VI, V2, V4, V7, VS, Vll, V12. On this path, tasks should be completed in the order B, A, D, C, F, E. The other shortest path goes through vertices VI, V2, V4, V6, Vs, Vn, Vn On this path, the tasks are completed in the order B, A, C, D, F, E. V12 T ® 17. (a) Since the time for a given task is independent on which other tasks have already been completed,
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: and since some tasks may occur simultaneously, this is a type II scheduling problem. (b) U(P1,28) Q(8,10) 25 (c) The critical path is Q, B. There is no slack in any task on the critical path. The table shows the slack in the other activities. B(Q,35) Task PI P2 U The shortest time is the length of the longest path from S to T. This is 35 units of time. Slack 7 10 7 Task Tp C P Slack 16 15 10...
View Full Document

Ask a homework question - tutors are online