# You have prepared the following schedule for a project in which the key resource is a...

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 months with only three backhoes. The number of backhoes required by each activity is as shown in the diagram. No splitting of activities is possible. K 033 0 1 01110 SIS 0315 0 1 Use the following order of heuristics: 1. Minimum slack, 2. Smallest duration, 3. Lowest identification number
Use the following order of heuristics: 1. Minimum slack, 2. Smallest duration, 3. Lowest identification number Schedule resource load chart with ES and stack updates Resource Duration ES U SLTP 1 TP 2 TP 3 TP 4 TP STP 6 TP 7 TP TP 9 TP 10 TP 11 TP 12 TP 13 TP 14 TP 15 ID 1 2 3 4 2 2 030 1 2 0 30 1 5 0 5 0 1 6 9 0 2 4 5 9 0 2 9 12 0 Resources scheduled Resources available 5 6 3 3 3 3 3 3 3 3 3 Note: Recall, in the schedule resource load chart the time-constrained scheduling interval (ES through LF) has been shaded. A resource scheduled beyond the shaded area will delay the project. "TP" stands for time period,
How long will the project take if only three backhoes are available? time periods. List the order in which you scheduled the activities of the resource-constrained project. First Second Third Fourth Fifth Sixth

Gantt chart and Resource loading chart based on Early start and early finish times are following:

Looking at the resource loading chart, we see that 4 backhoes are scheduled in periods 4 through 7 .

Therefore, based on the early start time schedule, it is not possible to finish the project using 3 backhoes.

We can finish the project using 3 backhoes by rescheduling activity 3 or 5, we reschedule activity 5, because as per minimum slack heuristic, activity 3 must be scheduled before activity 5.

We see that with 3 backhoes, the duration of the project increases to 15 time periods. This is more than permissible duration of 13 time periods (or months) . Therefore, we CANNOT say Yes to to the partner, Brooker.

1)

If only three backhoes are available, then the project will take = 15 time periods

2)

Order in which, activities of the resource-constrained project are scheduled, is following:

 First 1 Second 2 Third 3 Fourth 4 Fifth 5 Sixth 6

#### Earn Coin

Coins can be redeemed for fabulous gifts.

Similar Homework Help Questions
• ### Check my word 1 You have prepared the following schedule for a project in which the...

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,...

• ### You have prepared the following schedule for a project in which the key resource is a...

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...

• ### Plan ME Develop a loading schedule for each resource below. (Figure 8.3) EE ME 0 1...

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...

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...

• ### B. Resource Loading (33 pts). The network diagram below represents a project plan. a. b. C....

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...

• ### 2. Prepare a project schedule for Infotech software company. Assign the relevant resource Name and project...

2. Prepare a project schedule for Infotech software company. Assign the relevant resource Name and project Starts Calculate the total duration of the project: InfoTech software development company to develop the software by the following task and subtask all the events are linear form. 5/7/2019 on 2. System Design 1.Software Requirement Specification Database Design (3 days) Detailed Design (2 days) Architectural Design (2 days) Requirement gathering (1 day) (3 days) (2 days) (2 days) Data collection Cost Analysis Risk Analysis...

• ### CME403/603 Scheduling and Project Control (10 pts PDM) For the following PDM schedule, manually perform CPM...

CME403/603 Scheduling and Project Control (10 pts PDM) For the following PDM schedule, manually perform CPM calculation to show items as on legend (key) node - ES, EF, LS, LF, TF, SF and FNF. Highlight critical path(s). 2. 25 8 8 D 11 | 42 46 34 42 3 8 1 3 B 10 C T 16 10 18 29 40 37 Start Finis h 2 0 0 9 12 37 G 24 10 12 4 Legend ES Activity N...

• ### 1. For the following schedule, Draw the AON network diagram for the project and calculate the...

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...

• ### QUESTION 9 Consider the following project; for which activities is it possible that the slack can...

QUESTION 9 Consider the following project; for which activities is it possible that the slack can be greater than zero? Activity Immediate Predecessors B, E a. Only activities B or E could have slack, but they could not both have slack. Ob. Only activities B or C could have slack, but they could not both have slack. Oc. It is possible for any or all activities in this project to have slack. Od. It is possible for either all three...

• ### Consider a project having the following six activities:

Consider a project having the following six activities:                                                      Immediate                                                  Max        Crash cost             Activity                           Predecessors           Time (weeks)             Crash*    per week                   A                                none                                    6                          6                N/A                   B                                none                                    5                          2               \$500                   C                                A                                       3                          2             \$1000                   D                                A, B                                    4                          2             \$2000                   E                                 C, D                                    5                          2             \$1250                   F                                D                                       6                          2             \$1000                                                                                                 *Shortest possible time for the task 1. Draw the project network and list...