|
Activity # |
IP |
Duration (D) |
Required Resources |
|
1 |
- |
4 |
1 |
|
2 |
- |
5 |
2 |
|
3 |
1 |
4 |
2 |
|
4 |
1,2 |
5 |
1 |
|
5 |
2 |
3 |
2 |
|
6 |
3, 4, 5 |
2 |
2 |
The Gantt Chart is prepared considering Immediate predecessor and Duration, each cell under days contains number of resources
Before Resource leveling, Project needs 12 days time to complete
| Days with resources | |||||||||||||||
| Activity | Immediate Predecessor | Duration | Required Resources | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
| 1 | --- | 4 | 1 | 1 | 1 | 1 | 1 | ||||||||
| 2 | ---- | 5 | 2 | 2 | 2 | 2 | 2 | 2 | |||||||
| 3 | 1 | 4 | 2 | 2 | 2 | 2 | 2 | ||||||||
| 4 | 1,2 | 5 | 1 | 1 | 1 | 1 | 1 | 1 | |||||||
| 5 | 2 | 3 | 2 | 2 | 2 | 2 | |||||||||
| 6 | 3,4,5 | 2 | 2 | 2 | 2 | ||||||||||
| Total Resources Each Day | 3 | 3 | 3 | 3 | 4 | 5 | 5 | 5 | 1 | 1 | 2 | 2 |
After Resource leveling, as there are three resources available on each day
Project needs 14 days time to complete,
| After Resource level | |||||||||||||||||
| Days | |||||||||||||||||
| Activity | Immediate Predecessor | Duration | Required Resources | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 |
| 1 | --- | 4 | 1 | 1 | 1 | 1 | 1 | ||||||||||
| 2 | ---- | 5 | 2 | 2 | 2 | 2 | 2 | 2 | |||||||||
| 3 | 1 | 4 | 2 | 2 | 2 | 2 | 2 | ||||||||||
| 4 | 1,2 | 5 | 1 | 1 | 1 | 1 | 1 | 1 | |||||||||
| 5 | 2 | 3 | 2 | 2 | 2 | 2 | |||||||||||
| 6 | 3,4,5 | 2 | 2 | 2 | 2 | ||||||||||||
| Total Resources Each Day | 3 | 3 | 3 | 3 | 2 | 3 | 3 | 3 | 3 | 3 | 2 | 2 | 2 | 2 |
Develop a resource-constrained plan with slack, total resource load, and resource available. Assume that only three...
Plan ME Develop a loading schedule for each resource below. (Figure 8.3) EE ME 0 1 2 3 4 5 6 7 8 9 10 11 12 Fill in the times below for a resource activity schedule. ID/RES ES LSEF LF SL 1-EE Schedule 2.EE Legend ES ID EF 3-ME SL LS DUR LF 4.EE 5-ME 6-ME 7-EE Resource EX8-1 (Static) Given the network plan that... Given the network plan that follows, compute the early, late, and slack times. What...
Below is the network diagram for a construction project. Given ONLY THREE (3) workers are available at all times, develop a resource schedule using the parallel heuristics for resource-constrained projects. 0 A 1 1 2 1 1 1 2 4 E 7 0 0 4 3 7 IN نا 7 G 2 c 4 3 0 2 24 1 ON 0 7 00 000 7 1 4 1 F 1 0 B 2 02 o 0 2 2 N ON...
You have prepared the following schedule for a project in which the key resource is a backhoe. This schedule is contingent on having four backhoes. You receive a call from your partner, Brooker, who desperately needs one of your backhoes. You tell Brooker you are willing to let him have the backhoe if you are still able to complete your project in 13 months. Develop a resource schedule to see if it is possible to complete the project in 13...
In Exercise 1 Chapter 8, Given the network plan that follows, compute the early, late, and slack times. What is the project duration? Using any approach you wish (e.g., trial and error), develop a loading chart for resources, Electrical Engineers (EE), and resource, Mechanical Engineers (ME). Assume only one of each resource exists. Given your resource schedule, compute the early, late, and slack times for your project. Which activities are now critical? What is the project duration now? Could something...
Check my word 1 You have prepared the following schedule for a project in which the key resource is a tractor. There are three tractors available to the project. The resource requirements are as shown in the diagrams below. Develop a resource-constrained schedule. Use the parallel method and heuristics given. Be sure to update each period as the computer would do. ts SESSE DURU FEE eBook 1 eferences Use the following order of heuristics: 1. Minimum slack, 2. Smallest duration,...
B. Resource Loading (33 pts). The network diagram below represents a project plan. a. b. C. Compute the early, late, and slack times. Include your diagram in your paper What is the project duration? What is the critical path -illustrate it on your diagram (such as a dotted line). Ch 8 Assignment Resources: P(ainter); T(rimmer) 0 A START P & T ES ID EF SL Resour LS Dur LF 2 As your text stated, a plan isn't a schedule until...
In Exercise 1 Chapter 8, Given the network plan that follows, compute the early, late, and slack times. What is the project duration? Using any approach you wish (e.g., trial and error), develop a loading chart for resources, Electrical Engineers (EE), and resource, Mechanical Engineers (ME). Assume only one of each resource exists. Given your resource schedule, compute the early, late, and slack times for your project. Which activities are now critical? What is the project duration now? Could something...
EX8-4 (Algo) You have prepared the following schedule... You have prepared the following schedule for a project in which the key resource is a tractor. There are three tractors available to the project. The resource requirements are as shown in the diagrams below. Develop a resource-constrained schedule. Use the parallel method and heuristics given. Be sure to update each period as the computer would do. Legend ESIDER SUK RES SUK U DURU 106 12 OO 5510 0155 5 5 Use...
Dustin Co. makes three products, A, B and C. They have a constrained resource - machine hours. There are only 17,421 machine hours available a month. The three products have the following data: A B C Selling Price per unit 6.00 16.00 11.00| Variable Cost per unit 2.00 4.00 6.00 Machine hours required Demand for product in units 1,172 3,955 1,046 4 5 How much of product B should be produced?
3- Tables below show activities of a small project, predecessors, duration time, and resources that are required (machines and workers). There are 3 machines and 4 workers available each day. Please use resource allocation algorithm to optimally allocate the recourses to the activities. Please specifies the project completion time. Table 1: Activities, predecessors and duration time. Activity Predecessor Duration A - 2 B B 2 C A,B 1 D C,D 2 E D 3 Table 2: Activities and their required...