CSc 233 Fall 2010 Improvements on Beating a Dead Horse The tribal wisdom of the Dakota Indians, passed on from generation to generation, says that "When you discover that you are riding a dead horse, the best strategy is to dismount." However, in many organizations a range of far more advanced strategies are often employed. SUCH AS… 1
29
Embed
CSc 233 Fall 2010 Improvements on Beating a Dead Horse
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
CSc 233 Fall 2010
Improvements on Beating a Dead HorseThe tribal wisdom of the Dakota Indians, passed on
from generation to generation, says that "When you discover that you are riding a dead horse,
the best strategy is to dismount."
However, in many organizations a range of far more advanced strategies are often employed.
SUCH AS…
1
CSc 233 Fall 2010
• Buying a stronger whip • Changing riders • Saying things like, "This is the way we have always ridden this
horse." • Appointing a committee to study the horse • Arranging to visit other sites to see how others ride dead
horses • Lowering the standards so that dead horses can be included • Appointing a tiger team to revive the dead horse • Sending riders to training sessions to improve riding ability • Comparing the state of dead horses in today's environment • Changing the requirements to declare that "This horse is not
dead." • Declaring that "No horse is too dead to beat."
2
CSc 233 Fall 2010
• Reclassifying the dead horse as "living impaired" • Doing a Cost Analysis study to see if contractors can ride the
horse more cheaply. • Purchasing a product that claims to make dead horses run
faster • Hiring an outside contractor to ride the dead horse • Harnessing several dead horses together to increase the speed • Providing additional funding and/or training to increase the
dead horse's performance • Forming a quality circle to find uses for dead horses • Saying "This horse was procured with cost as an independent
variable." • Doing a productivity study to see if lighter riders would
improve the dead horse's performance 3
CSc 233 Fall 2010
• Declaring that the horse is "better, faster and cheaper" dead (i.e. as the dead horse does not have to be fed, it is less costly, carries lower overhead, and therefore contributes substantially more to the mission of the organization than do some other horses)
• Rewriting the expected performance requirements for all horses
• Promoting the dead horse to a supervisory position...
• Used to plan, schedule, and control a wide variety of projects
• Schedule and coordinate the various tasks so that the project is completed on time
• Managers want to know:What is the expected project completion dateWhat is the scheduled start & completion date for each specific taskWhich tasks are “critical” and must be completed exactly as scheduled
to keep the project on scheduleHow long can “noncritical” tasks be delayed before they cause a delay in
the total project
5
CSc 233 Fall 2010How to Draw a Pert Chart• Make a list of all the tasks that are required to complete the project.• Put the tasks in order by dependency.
For example, two tasks are design and coding. You can't design and code until the requirements are specified. Requirements comes before design and coding.
• Number (or letter) your sorted list, starting with assigning the lowest number (or letter) to the first task and the highest number to the last task.
• Draw the graph, with earlier tasks on the left and later tasks moving right. Tasks that can be done at the same time should be vertically aligned.
• Draw arrows from prerequisite tasks to the tasks that depend on them.
6
CSc 233 Fall 2010
The Network?
7
IMMEDIATETASK PREDECESSORS
A -B -C AD AE AF CG DH B, EI HJ F, G, I
CSc 233 Fall 2010
The Network
8
IMMEDIATETASK PREDECESSORS Left to Right
A -B - C FC A AD A D GE A JF C EG DH B, E B H II HJ F, G, I
CSc 233 Fall 2010
Critical Path Calculation
9
Left to Right
C FA
D GJ
E
B H I
ES EFTask ID
DurationLS LF
CSc 233 Fall 2010
Each Task
10
Begin with the first task (ES = 0)Duration = t
ES Earliest start timeEF Earliest finish time (ES + t)
Earliest start: largest value of EF times for all predecessor tasksBegin after you have the EF for the last task (set LF = EF)
LF Latest finish timeLS Latest start time (LF – t)
Latest finish Rule: smallest value of LS times for all successor tasks
ES EFTask ID
DurationLS LF
CSc 233 Fall 2010
Assignment
11
Task Predecessor DurationA - 10B - 5C A 20D B 5E C, D 20F D 15G D 5H E 10I F 5J G, H, I 10
1
A
B
CSc 233 Fall 2010
12
Task Predecessor DurationA - 10B - 5C A 20D B 5E C, D 20F D 15G D 5H E 10I F 5J G, H, I 10
1 2
A C
B D
CSc 233 Fall 2010
13
Task Predecessor DurationA - 10B - 5C A 20D B 5E C, D 20F D 15G D 5H E 10I F 5J G, H, I 10
1 2 3
A C E
FB D
G
CSc 233 Fall 2010
14
Task Predecessor DurationA - 10B - 5C A 20D B 5E C, D 20F D 15G D 5H E 10I F 5J G, H, I 10
1 2 3 4
A C E H
F IB D
G
CSc 233 Fall 2010
15
Task Predecessor DurationA - 10B - 5C A 20D B 5E C, D 20F D 15G D 5H E 10I F 5J G, H, I 10