Unformatted text preview: the pizza, and none of the paths in (a) satisfy this. From the network, we can see that this means he must begin in the order 8BDH. It is clear then by inspection that the shortest path will be 8BDH JT, requiring fourteen hours. 18. (a) Since the time for various tasks depends on which tasks have already been completed, this is a Type I scheduling problem. F(H,22) (b) ® ®3 1:1 T(P,30) S( -,0) A(S,3) J( ® ®3 3 @ O(N,20) L(A,6) @ (c) The groceries can be purchased, bagged and on the truck in 30 units time, along the route 8ALJ K I PT....
View Full Document
- Summer '10
- Graph Theory, Shortest path problem, Study Session