The activities for a breakfast are shown in the table below.
Activity |
Description |
Duration (in minute) |
Preceding Activity |
A |
Get up |
15 |
- |
B |
Make tea |
3 |
D, E |
C |
Fill kettle |
1 |
A |
D |
Fetch milk |
1 |
A |
E |
Boil water |
5 |
C |
F |
Milk on cereal |
1 |
D |
G |
Make toast |
4 |
H |
H |
Cut bread |
2 |
A |
I |
Eat |
8 |
B, F, G |
(a) Use the activity network construction algorithm to number the vertices and to draw a fully-labelled activity network. (No need to key-in here)
(b) Apply Critical path construction algorithm to the activity
network to find a critical path:
(do not include START or FINISH, Eg.
ABCDEFG).
(c) Write down the minimum breakfast time (in minutes):
(d) Write down the earliest starting time and latest starting time for activity D (in minutes)
(e) Write down the earliest starting time and latest starting time for activity G (in minutes)
The activities for a breakfast are shown in the table below. Activity Description Duration (in minute)...
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...
use excel to solve the problem You and several friends are about to prepare a lasagna dinner. The tasks to be performed, their immediate predecessors, and their estimated durations are as follows: Tasks That Time Task Description (minutes) Must Precede 30 Buy the mozzarella cheese* Slice the mozzarella Beat 2 eggs Mix eggs and ricotta cheese Cut up onions and mushrooms Cook the tomato sauce 25 15 10 Boil large quantity of water Boil the lasagna noodles Drain the lasagna...
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...
Activity Duration Precedence Problem# 3 For the project information given below (wecks) information a) Draw the network diagram to accurately B must be after C represent the information given C must be after A 10 15 b) Determine the earliest start, earliest D must be after B E must be after C F must be after D and E G must be after F H must be after G 1 must be after F finished, latest start, latest finish for...
F: The activities in the following table describe the construction of a new house. Activity Predecessor(s) Duration(days) A: Clear site B: Bring utilities to site Excavate D: Pour foundation E: Outside plumbing B, C Frame house D G: Do electric wiring H: Lay floor Lay roof F Inside plumbing E, H K: Shingling Outside sheathing insulation F.J M: Install windows and outside doors F Do brick work L, M 0: Insulate walls and ceiling GJ Cover walls and ceiling 0...
The critical path for the network activities shown below is __ with duration ___ Activity Duration Immediate Predecessors A 2 - B 4 - C 1 A,B D 6 A,B E 3 B,C,D
QUESTION 1 The following table provides information about a particular project:ActivityDuration (Days)PrecedingActivityA5_B6_C4AD3AE1AF4EG14D,EH12B,CI2G,H (a) Represent the project by means of a simple network diagram. (b) Prepare in tabular form, an activity schedule showing the following details: Earliest-start, earliest-finish, latest-start, latest-finish and slack times. (c) Identify the critical path. ...
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...
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...
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...