First, I have prepared Network Diagram based on Forward Path method and Backward Path method.
Loading schedule for each resource:
here, i have calculated Number of EE and Number of ME per day
Activity | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
1 | EE | EE | |||||||
2 | EE | EE | EE | EE | |||||
3 | ME | ME | ME | ||||||
4 | EE | ||||||||
5 | ME | ME | ME | ME | ME | ME | |||
6 | ME | ME | |||||||
7 | EE | EE | EE | EE | |||||
EE | 2 | 2 | 2 | 2 | 1 | 1 | 1 | 0 | 0 |
ME | 1 | 1 | 1 | 1 | 2 | 2 | 1 | 1 | 1 |
Below data is created using above network diagram:
Activity | ES | LS | EF | LF | SL |
1 EE | 0 | 2 | 0 | 2 | 0 |
2 EE | 0 | 4 | 3 | 7 | 3 |
3 ME | 0 | 3 | 2 | 5 | 2 |
4 EE | 2 | 3 | 2 | 3 | 0 |
5 ME | 3 | 9 | 3 | 9 | 0 |
6 ME | 4 | 6 | 7 | 9 | 3 |
7 EE | 3 | 7 | 5 | 9 | 2 |
Based on the network diagram, we can conclude that project needs at least 9 units time to complete.
SLACK for activity 2 = 3, SLACK for activity 6 = 3 and SLACK for activity 7 = 2
After Resource leveling, here, we have 1 EE and 1 ME each day.
Activity | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 |
1 | EE | EE | |||||||||
2 | EE | EE | EE | EE | |||||||
3 | ME | ME | ME | ||||||||
4 | EE | ||||||||||
5 | ME | ME | ME | ME | ME | ME | |||||
6 | ME | ME | |||||||||
7 | EE | EE | EE | EE | |||||||
EE | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
ME | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
Based on it we see that project needs at least 11 unit time to complete
here, I have considered that all activities are independent to each other.
here, critical paths are Start - 1-4-5-6- End and Start-3-7-2-End
here, critical activities are 1,2,3 4, 5 and 6
after leveling
SLACK for activity 2 = 0,
SLACK for activity 6 = 0
and
SLACK for activity 7 = 0
Network diagram after resource leveling:
Plan ME Develop a loading schedule for each resource below. (Figure 8.3) EE ME 0 1...
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...
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...
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...
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 3 backhoes. You receive a call from your partner, Brooker, who desperately needs 1 of your backhoes. You tell Brooker you would be willing to let him have the backhoe If you are still able to complete your project in 11 months. Develop a resource schedule in the loading chart that follows to see if it is...
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...
1. For the following schedule, Draw the AON network diagram for the project and calculate the schedule. а. Summarize the schedule in a tabular form, showing ES, EF, LS, LF, TF, and FF for each activity b. Denote the critical path on the network. C. d. Perform a cost analysis based on an early start, late start, and target schedule for the project. Plot the cumulative cost distribution for the three S-curves on one graph. e. f. Plot the cumulative...
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,...
QUESTION 2: (20 marks) 2. Critical Path Method (CPM) is a network diagramming technique used to predict total project duration and to determine the critical path. a) Based on the table provided, create the CPM network diagram. Analyse and show the Early Start (ES), Early Finish (EF), Late Start (LS), Late Finish (LF) and the Float/Slack duration. (14 marks) b) Analyse the diagram, state and circle the Critical Path clearly. (6 Marks) Activity Predecessor Duration A 6 B A 7...
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...