Player A (7) Player M (8) Player G I IL Il Il & Player B I 0 WwW 180 60 -90 -100 -40 120 100 80 140 Player N I I Il -200 100 140 -100 80 -400° 200 240 300 Player H I Il Il 200 . 240 300 200 230 270 -100 -160 400 -(4) Six jobs I, II, III, IV, V, VI are to be processed on two machines A and B in the order AB. Processing Time (Hrs.) 7 10 4 8 Tl 12 5 Iv 11 6 8 5 10 Find: (a) Total minimum elapsed time. (b) Idle time for each machine.(6) Five jobs 1, II, I, IV, V are to be Processed on three machines A, B and C in the order ABC. Processing Time (Hrs.) Jobs Machine A | Machine B | Machine C I 10 12 20 0 12 15, 26 ml . 18 10 24 IV 21 8 22 Vv | 15 18 23 Find: (a) Total elapsed time (minimum). (b) Idle time for each machine A, B, C.@) For the following project, draw PERT network and find expected projeq completion time. Activity Preceding Optimistic Most likely Pessimistic Activity time (a) in time (m) in time (b) in weeks weeks weeks A = 2 4 12 B - 10 12 26 c A 8 9 10 D A 10 15 20 E A % 75 11 F B,C 9 9 9 G D 3 3.5 7 H EEG 5 5 5 Answer the following questions. (i) Find probability of project completion in 32 weeks, (ii) Find probability of project completion in 27 weeks. (iii) Find project completion time for 95% probability. (iv) Find probability of not completing project in 30 weeks,©) A small project consists of following activities, Activity Normal time | Normal cost Crash time Crash (weeks) (Rs.) (weeks) “Rs . | 7 1000 4 1300 13 8 1400 7 1440 14 6 750 4 900 25 9 1200 7 1350 36 5 1500 5 1500 “7 6 1150 5 1220 58 4 800 3 850 5 4 600 1 840 ut i 400 3 450 Overhead cost is Rs. 150 per week. Find:(a), Normal project completion time and normal cost. (b) Optimal project cost and optimal project completion time. Minimum project completion time and its corresponding cost. ©(18) A small project consists of following activities. Construct a network diagram for the project and identify critical path and Project completion time. Find: (a) Earliest and Latest starting and finishing times for each activity (b) Total, Free, Independent and Interfering float for each activity (c) _ Tail slack and Head slack for each activity [Activity A|B|C|[D[E|[F]G]H|1I Preceding Activity 2 i - | AT BIC B|F Time (days) afe{s]s[e]3 4] 9(9) The municipal corporation of a city has decided to carry out road repairs i, four main areas of the city. The estimated cost of the project is Rs. 100 lakhs If necessary, then a supplementary provision of funds will also be made The corporation has invited tenders and 5 contractors have sent in their bids (In Rs. lakhs). One road will be awarded to only one contractor. Roads Contractors Ri R2 R3 l R4 cl 18 28 38 30 C2 14 34 40 38 C3 18 36 42 36 C4 20 24, 1 36 38 cS 20 30 42 32 (a) Find the best way of assigning the repair work to the contractors anc the costs. (b) If it is necessary to seek supplementary grants, then what should > the amount sought? (c) Which of the five contractors will be unsuccessful in his bid?(7) A company has three plants A, B and G from where it supplies to three warehouses X, Y and Z. Supply at each plant {5 200 units. Demand at the Warehouses is 100, 300 and 150 units respectively. Unit cost of transportation is given in the table below. Find optimal transportation schedule and optimal transportation cost. cf (8) . From three warehouses W1, W2, and W3 the stocks are to be transported to four markets M1, M2, M3 and M4. The supplies from warehouses are 300, 200, and 250 tons respectively, where as the requirements of markets are 325, 175, 100, 150 tons respectively. The cost matrix and a solution to the problem are given in the following table. Answer the following questions. WH : Markets Mi |_M2 M3 | M4 Wi 10 10 16 [20 w2 1%]. 16 @ 17 25 w3 8 © 21 10 15 : (a) _ Is the above solution feasible? (b) Is it degenerate? (c) Is the solution optimal? Is there more than one solution? (d) Calculate the opportunity cost of transporting one unit from W1 to M4. (e) The manager is forced to transport one unit from W2 to M4, find the rate of increase in the cost per unit. (f). If a transport carrier offers 20% discount on route W2 to Mt should the management accept the offer?2) Explain in brief following terms of a Game Theory problem: (a) Players (b) Strategies (¢) Play (d) Payoff (e) Payoff matrix Anc:(1) Explain the following terms in a job sequencing problem: (a) Processing time (b) Processing order (c) Elapsed time (d) idle time (e) Job sequence.(2) What are the main assumption for finding solution to a job sequencing ' problem.4 lad send ava pas calutation in CPM,©) Whatis a float? What are different types of floats? (MU, April 2019)(3) What is time-cost trade-off in Project Crashing? (April 19) = Ans.: The execution of a project involves two types of costs, direct cost and indirect cost. @) b) Direct costs: These include costs of materials, machinery, tools, manhours etc. When we estimate the duration of various activities in the project, it is assumed that normal amount of labour (manhours) & machines will be required to complete these activities. The estimation of direct costs is done based on the normal amount of resource required. This estimation gives us minimum possible direct cost required to complete the project. When we want to complete the project in a shorter period than critical path, we will need to employ more resources. Hence, direct cost will increase. Indirect costs: These include rent, overheads, administrative costs etc. Indirect costs vary with time. They are expressed on per day (or per week etc.) basis. Hence, when we shorten the project completion time, total indirect cost reduces. Total Project Cost = Direct Cost + Indirect Cost Project Cost _- Total cost curve Indirect cost Direct cost Project completion time(4) Explain - “normal time, normal cost, crash time, crash cost” in project crashing. Ans.: (a) Normal time: The normal time is the activity duration under norma] circumstances. j (b) Normal cost: The direct cost associated with the normal completion time. This is the minimum direct cost required for performing that activity. E () Crash time: The minimum possible time in which an activity can be completed. (d) Crash cost: The direct cost associated with crash time of an activity. When an activity is crashed, its direct cost will increase. < Normal time} >___Normal cost Actual direct cost curve Linear approximation of \— direct cost curve Activity cost [Direct) Activity time(1) What are three time estimates in PERT? + nen.(4) Compare PERT & CPM. (MU, April 2019) Ans.: CPM PERT () In CPM there is only one time] (1) In PERT there are three time given for each activity. estimates. Optimistic time, Most likely time and Pessimistic time. From these, we find Expected time for completion of an activity (te).(2) After drawing the network we find critical path, which gives us project completion time. (2) We draw the network using Expected time (te) and then we find critical path, which gives us expected project completion time. (3) There is = no information in CPM. probability (4) There is no standard deviation and variance for activities. We assume that all activities will be (3) Probability is associated with Project] completion time (Te). The Probability of completing the project in that| duration is 50% (0.5). In other words, the probability’ that the project will be completed in| expected project completion time is| 50%. | (4) We find standard deviation and| variance of critical activities and from| that we find variance and standard completed in specified time. deviation of the critical path. (5) As there is no probability, there is | (5) We can find “z” value and from “z” no relation with normal value the probability of completing distribution table. the project in specified time duration.