Discrete Mathematics with Graph Theory (3rd Edition) 317

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

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

View Full Document Right Arrow Icon
Section 11.5 315 (c) [BB] One of several ways in which this time can be achieved is to first conduct the library search, then do the field work, then the laboratory analysis, then create the database and finally do the write-up. 12. (a) Since the times for the various tasks are independent of which tasks have already been completed, and since various tasks can occur simultaneously, this is a problem of type IT . P(S,2) S( -,0) -L--. ..----«>-_ ~~O _ _e T(G,12) W(S,4) (b) As the digraph shows, the shortest time in which dinner can be prepared is 12 units. The critical path is FCG: Catch the fish, cook the food and greet the guests. (c) The slack in
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: W is 3 since buying the wine could take as long as seven units with dinner still being prepared in 12 units. The slack in C is 0 because C is on the critical path. The slack in D is four. Dusting could take as long as seven units without increasing the minimal time (12) for the whole job. (If it took more than seven, then DTVG would become the critical path.) 13. (a) The new digraph is shown. P(S,2) S( -,0) r6.--",---<C>-_ W(S,4) ~~0--e T(G, 12) G(C,12) (b) As shown, the critical path is still FCG and the time is still 12 units. (c) The slack in W is now two. The slack in C is still 0 and the slack in D is still four....
View Full Document

This note was uploaded on 11/08/2010 for the course MATH discrete m taught by Professor Any during the Summer '10 term at FSU.

Ask a homework question - tutors are online