1 / 17

Management of Engineering Projects Limited Resources

Management of Engineering Projects Limited Resources. Dr. L. K. Gaafar. Example. Example. 3. B4 (2). A 3 (2). 0. 13. D 7 (2). C 6 (3). 6. Critical path is CD. Minimum completion time is 13. 3. B4 (2). A 3 (2). 0. 13. D 7 (2). C 6 (3). 6. A (2). B (2). C (3). D (2).

jun
Download Presentation

Management of Engineering Projects Limited Resources

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Management of Engineering ProjectsLimited Resources Dr. L. K. Gaafar

  2. Example

  3. Example 3 B4 (2) A 3 (2) 0 13 D 7 (2) C 6 (3) 6 Critical path is CD. Minimum completion time is 13.

  4. 3 B4 (2) A 3 (2) 0 13 D 7 (2) C 6 (3) 6 A (2) B (2) C (3) D (2) Resources 5 4 2 Resource Profile 1 5 needed 0 Time 13 6

  5. Example Next slide shows 2 possible schedules to finish the project on time (13), and the associated resource profile in each case. 3 B4 (2) A 3 (2) 0 13 D 7 (2) C 6 (3) 6 Critical path is CD. Minimum completion time is 13.

  6. 3 B4 (2) A 3 (2) 0 13 D 7 (2) C 6 (3) 6 A (2) A (2) B (2) B (2) Schedule 1 Schedule 2 C (3) D (2) C (3) D (2) Resources Resources 5 4 4 3 2 Resource Profile 2 Only 4 needed Resource Profile 1 5 needed 0 Time 0 Time 13 13 6 6

  7. Single Resource AllocationBrooks’ Algorithm 1. Develop the activity network. 2. Determine the activity control time (ACTIM) for all activities. ACTIM is the longest path to the end of the project starting from the activity. 3. Rank activities in a descending order of their ACTIM with ties broken according to longest duration followed by largest resource requirements. 4. Set TNOW to 0. 5. Set the early start (TEARL) of all activities that may start at TNOW. 6. Schedule all possible activities that could be started and allocated enough resource units. Stop when all available activities are scheduled, or when you run out of resource units for the next available activity. Determine the finishing time for all scheduled activities (TFIN). 7. Update TEARL of remaining activities based on TFIN of scheduled activities. 8. Advance TNOW to next available TEARL or TFIN and repeat step 5. Continue until all activities are scheduled.

  8. Resource allocation assuming 4 units are available Order is CDABD is ranked before A because it has a longer duration C and A may start at time 0 and their TEARL is set accordingly. 4 units are available for assignment Since B depends on A, its TEARL cannot be determined at this time. Since D depends on C, its TEARL cannot be determined at this time. Algorithm setup at TNOW = 0

  9. 3 B4 (2) A 3 (2) 0 13 TNOW = 0 D 7 (2) C 6 (3) 6 Resource allocation assuming 4 units are available C and A may be scheduled. C is allocated 3 units of the resource and its TSTART and TFIN are set to 0 and 6. TEARL of D is set to 6 (TFIN of C). A cannot be scheduled at this time as only one resource unit is left. TNOW will be set to 6 for next iteration After First Iteration

  10. 3 B4 (2) A 3 (2) 0 13 TNOW = 6 D 7 (2) C 6 (3) 6 Resource allocation assuming 4 units are available C is done and 3 units of the resource are recovered. Resource capacity upgraded to 4. D and A may be scheduled and enough resource units are available TSTART and TFIN of D and A are updated. TEARL of B is set to 9 (TFIN of A). TNOW will be set to 9 for next iteration After Second Iteration

  11. 3 B4 (2) A 3 (2) 0 13 TNOW = 9 D 7 (2) C 6 (3) 6 Resource allocation assuming 4 units are available A is done and 2 units of the resource are recovered. Resource capacity upgraded to 2. B may be scheduled and enough resource units are available TSTART and TFIN of B are updated. All activities have been scheduled. The project completion time is the maximum TFIN (13). After Third Iteration

  12. Results of applying Brooks’ algorithm Same as Schedule 2 before Resources A (2) B (2) Schedule C (3) D (2) 3 B4 (2) A 3 (2) 0 13 D 7 (2) Resource Profile C 6 (3) 4 6 3 0 Time Time 13 6

  13. ExampleBus Shelter Construction Assume only 4 units of the resource are available.

  14. B(1,1) D(3,2) C(2,2) A(2,2) E(2,3) H(1,1) I(1,2) F(2,3) G(1,2) Critical path is EABDCHI, completion time is 12 without resource constraints With resource constraints, completion time is 13.

  15. Example I I. Given the following Project: 1. Determine the Critical Path 2. What is the minimum Project completion time assuming no constraints? 16 3. Use Brooks' algorithm to schedule the project assuming 3 units of the resource are available. What is the project completion time? 4. Use Brooks' algorithm to schedule the project assuming 2 units of the resource are available. What is the project completion time? A 5 B 4 E 4 C 5 D 7 F 8 G 16

  16. A 5 B 4 E 4 C 5 D 7 F 8 Assuming 3 resource units G 16

  17. A 5 B 4 E 4 C 5 D 7 F 8 Assuming 2 resource units G 16

More Related