Sample 1 List of Activities For A Shopping Center Project
Sample 1 List of Activities For A Shopping Center Project
)
In many situations,managers are responsible for planning,scheduling,and controling projects that consist of numerous
separate jobs or tasks performed by a variety of departments and individuals.Often these projects are so large and/or complex that
the manager cannot possibly remember all the information pertaining to the plan, schedule and progress of the project.
Program Evaluation and Review Technique(PERT) and Critical Path Method(CPM) have been used to plan,schedule and control a
wide variety of projects:
1. Research and development of new products and processes
2. Construction of plants,buildings, and highways
3. Maintenance of large and complex equipment
4. Design and installation of new systems
Project managers look for procedures that will help them answer questions such as :
1.What is the total time to complete the project?
2.What are the scheduled start and finish dates for each specific activity
3.Which activities are “critical” and must be completed exactly as scheduled to keep the project on schedule?
4.How long can “noncritical” activities be delayed before they cause an increase in the total project completion time?
Sample 1
Slack = LS –ES = LF – EF
ACTIVITY SCHEDULE
Activity Earliest Start Latest Start Earliest Finish Latest Finish Slack(LS-ES) Critical Path?
A 0 0 5 5 0 Yes
B 0 6 6 12 6
C 5 8 9 12 3
D 5 7 8 10 2
E 5 5 6 6 0 Yes
F 6 6 10 10 0 Yes
G 10 10 24 24 0 Yes
H 9 12 21 24 3
I 24 24 26 26 0 Yes
Critical Path : A – E – F – G – I
Project completion time : 26
Questions to consider:
1. How long will the project take to complete?
2. What are the scheduled start and completion times for each activity?
3. Which activities are critical and must be completed exactly as scheduled to keep the project on schedule?
4. How long can noncritical activities be delayed before they can cause an increase in the completion time of the project?
t = a + 4m + b
6
2 = b – a 2
6
Activity Description Immediate predecessor
A Overhaul Machine 1 -
B Adjust Machine 1 A
C Overhaul Machine 2 -
D Adjust Machine 2 C
E Test System B,D
Activity Earliest Start Latest Start Earliest Finish Latest Finish Slack(LS-ES) Critical Path?
A 0 0 6 6 0 Yes
B 6 6 8 8 0 Yes
C 0 0 5 5 0
D 5 5 8 8 0 Yes
E 8 8 11 11 0 Yes
Time(days) Total Cost
Activity Normal crash Normal Crash Maximum reduction in time Crash Cost per
day
A 6 4 500 800 2 150
B 2 1 200 300 1 100
C 5 4 500 700 1 200
D 3 1 200 400 2 100
E 3 2 150 300 1 150
1550 2500
EF= ES + t
Let x= earliest finish time for an activity
Y = amount of time an activity is crashed
Linear Programming
Obj Min 150Y1+100Y2+200Y3+100Y4+150Y5
St
Y1≤2
Y2≤1
Y3≤1
Y4≤2
Y5≤1
XA≥0+(6-YA)
XB≥XA+(2-YB)
XC≥0+(5-YC)
XD≥XC+(3-YD)
XE≥XB+(2-YE)
XE≥XD+(2-YE)
XE≤8
Software solution revealed crashing Activity B by 1 day, Activity D by 1 day and Activity E by 1 day, with a total crashing cost of 350