.8-6. A project consists of 12 activities, represented by the project network below, where number by each arc repres...
A construction company has a project proposal, which takes 10 activities as follows: Activity Predecessors Activity Duration Time (In DAYS ) Early Start (ES) (In DAYS ) Early Finish (EF) (In DAYS ) Late Start (LS) (In DAYS ) Late Finish (LF) (In DAYS ) SLACK (In DAYS ) A - 14 B - 13 C A 11 D A 15 E B 14 F B 11 G D, E 13 H F 15 J C 12 K G,H 11...
1. The activities needed for a new project your company is undertaking are listed in the following table. ACTIVITY IMMEDIATE PREDECESSOR(S) A ---- B ---- C A D A, B E B F C, D, E G D, E H F I F, G J G The activity times were determined for the project, and were as below. ACTIVITY ACTIVITY TIME (days) A 11 B 9 C 7 D 12 E 8 F 9 G 10 H 6 I 7...
The table below defines the activities and the normal time duration for each activities within a small project. You can decrease (crash) the durations at an additional expense. Table 1 summarizes the time-cost information for the activities to complete the project. Table 1: The time-cost information for the activities Activity Normal Completion Time (weeks) Immediate Predecessor Crash Time (weeks) Normal cost for activities Crash cost for activities/week A 2 - 1 1200 400 B 3 - 1 1400 500 C...
Provide step by step please thank you, no exce Assume you have a project with ten activities labeled A-J, as shown. Derive the earliest completion time (or early finish-EF), latest completion time (or late finish-LF), and slack for each of the following tasks (begin at time 0) the critical path on your network diagram. . Which tasks are on the critical path? Highligh Preceding Expected Critical Path? Activity Event Duration EF LF Slack A, D C,E D, E F, G...
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...
2. Assume you have a project with ten activities labeled A-J, as shown. Derive the earliest completion time (EF), latest completion time (LF) and slack for each of the following tasks (begin at time 0). Which tasks are on the critical path? Highlight the critical path on your network diagram [5] Activity Preceding Expected EF LF Slack Critical Event Duration Path? A 4 A 5 C A 6 A 7 E A, D 6 C, E 4 G D, E...
Given the following network *) Find the earliest time the project will be completed. b) Find the critical path.. c) If activity is delayed by 4 days, find the completion time of the entire project. Nativity В 10 12 B
Problem 5: For the given activity network, if there are 35 days required to complete the project, find the following Complete the network by filling in ES, LS, EF and LF Earliest start for activities D, E, F, H, G, L, M ill. Earliest finish for activities D, E, F, H,G,L,M Latest start for activities D, E, F, H, G, LM V. Latest finish activities D, E, F.H.GLM vi. Slack/Float time for each activities D, E, F, H, G, LM...
20 The late finish time (LF) is a the latest possible date an activity can be completed without delaying the project's completion b c the maximum extent to which an activity can be delayed the latest possible date an activity can be completed before the activity becomes irrelevant d the latest possible time an activity can be completed on a given day 21 A critical path a is the longest individual path in a network b is the path of...
1. State whether each of the following statement is true or false. a) The sequence of activities in a project is depicted by the precedence (0.5 mark) (0.5 mark) relationships. The critical path is the shortest path through the project network. Slack is the amount of time an activity can be delayed without delaying the project. In PERT, three time estimates (optimistic, most likely and pessimistic) provide an estimate of the mean and variance for each activity based on the...