Professional Documents
Culture Documents
Functional Matrix
Project Matrix
Accounting
Department Chair Larry Zelda Diane
B Functional Matrix 142 1.91 (.77) 2.00 (.85) 2.37 (.73) 2.21 (.75)
C Balanced Matrix 90 2.39 (.73) 2.15 (.82) 2.64 (.61) 2.52 (.61)
D Project Matrix 156 2.64 (.76) 2.30 (.79) 2.67 (.57) 2.54 (.66)
E Project Team 87 2.22 (.82) 2.32 (.80) 2.64 (.61) 2.52 (.70)
Total Sample 546 2.12 (.79) 2.14 (.83) 2.53 (.66) 2.38 (.70)
F-statistic 10.38* 6.94* 7.42* 11.45*
A,B < C,D,E
Scheffe Results E<D A,B < C < D,E A,B < C,D,E A,B < C,D,E
• Project matrix was better able to control costs than project team
How is knowledge
transferred?
Personality Compatibility
Subcontractor
Corporate Personality
Personality
Project
Individual
Personality
Subcontracting Issues
n• What part of project will be subcontracted?
n• What type of bidding process will be used? What type of
contract?
n• Should you use a separate RFB (Request for Bids) for
Firm 1 Firm 2
Fixed Fee (bid) $5 M $7 M
Project Cost $105 M $95 M
(inefficient producer)
Steven Goldblatt
Department of Building
Construction
University of Washington
The Seattle Times, Nov 1,
1987
Precedence Networks
Networks represent immediate precedence relationships
among tasks (also known as work packages or activities)
and milestones identified by the WBS
Milestones (tasks that take no time and cost $0 but indicate
significant events in the life of the project)
Two types of networks: Activity-on-Node (AON)
Activity-on-Arc (AOA)
All networks: must have only one (1) starting and one (1)
ending point
Precedence Networks: Activity-on-Node (AON)
A C
Start End
B D
Precedence Diagramming
Standard precedence network (either AOA or AON) assumes that a successor
task cannot start until the predecessor(s) task(s) have been completed.
Alternative relationships can be specified in many software packages:
Finish-to-start (FS = ): Job B cannot start until days after Job A is
finished
Start-to-start (SS = ): Job B cannot start until days after Job A has
started
Finish-to-finish (FF = ): Job B cannot finish until days after Job A
is finished
Start-to-finish (SF = ): Job B cannot finish until days after Job A
has started
Critical Path Method (CPM): Basic Concepts
Task A Task B
7 months 3 months
Start
End
Task C
11 months
Critical Path Method (CPM): Basic Concepts
ESA = 0 ESB = 7
LFA = 8 LFB = 11
Start
End
Task C
11 months
ESC = 0
LFC = 11
Task A Task B
2 7d 3 3d
Wed 12/20/00 Thu 12/28/00 Fri 12/29/00 Tue 1/2/01
Start
1 0d End
Wed 12/20/00 Wed 12/20/00
5 0d
Wed 1/3/01 Wed 1/3/01
Task C
4 11d
Wed 12/20/00 Wed 1/3/01
Critical Path Method (CPM): Example 2
ES A =
LFA =
ES F =
LFF =
Task A
14 wks ES D =
LFD = Task F
ES START = 0 9 wks ES END =
LF START = 0 LFEND=
ES B = Task D
LFB = 12 wks
START END
Task B ES E =
9 wks LFE =
Task E
ES C = 6 wks
LFC =
Task C
20 wks
Example 2: Network Paths
Expected
Path Tasks Duration (wks)
1 START-A-D-F-END 35
2 START-A-D-E-END 32
3 START-B-D-F-END 30
4 START-B-D-E-END 27
5 START-C-E-END 26
Example 2: CPM Calculations
EARLI E ST LA T E S T
Earliest Lastest
Task or Duration Start Time Finish Time Total Slack Critical
Milestone ( ti ) (ESi) (LFi) (TSi) Task?
START 0 0 0 0 Yes
A 14 0 14 0 Yes
B 9 0 14 5 No
C 20 0 29 9 No
D 12 14 26 0 Yes
E 6 26 35 3 No
F 9 26 35 0 Yes
END 0 35 35 0 Yes
Slack (Float) Definitions (for task i)
Total Slack (TSi) = LFi - ESi - ti
Minimize END
subject to
STARTj ≥ FINISHi for all tasks i that immediately precede task j
2 Task A Workers[5]
3 Task B Workers[7]
4 Task C Workers[3]
5 Task D Workers[12]
6 Task E Workers[2]
7 Task F Workers
8 Task G Workers[2]
9 Task H Workers[5]
10 Task J Workers[6]
11 End 5/10
• Other issues?
Critical Path Method (CPM): Example 2
ES A = 0
LFA = 14
ES F = 26
LFF = 35
Task A
14 wks ES D = 14
LFD = 26 Task F
ES START = 0 9 wks ES END = 35
LF START = 0 LFEND= 35
ES B = 0 Task D
LFB = 14 12 wks
START END
Task B ES E = 26
9 wks LFE = 35
Task E
ES C = 0 6 wks
LFC = 29
Task C
20 wks
Project Budget Example
No. of No. of
Task or Duration Early Start Latest Start Resource A Resource B Material Direct Labor Labor +
Milestone (tj) Time (ESj) Time (LSj) workers workers Costs Cost/wk Materials
START 0 0 0 - - - - -
A 14 0 0 2 0 $ 340 $ 800 $ 1,140
B 9 0 5 4 12 $ 125 $ 8,800 $ 8,925
C 20 0 9 3 14 $ - $ 9,600 $ 9,600
D 12 14 14 0 8 $ 200 $ 4,800 $ 5,000
E 6 26 29 1 0 $ 560 $ 400 $ 960
F 9 26 26 4 10 $ 90 $ 7,600 $ 7,690
END 0 35 35 - - - - -
400000
350000
300000 Range of
Cumulative Cost
200000
150000
100000
50000
0
1
11
13
15
17
19
21
23
25
27
29
31
33
Week
20000
15000
Weekly Costs
10000
5000
0
1
11
13
15
17
19
21
23
25
27
29
31
33
Week
M1
Task A
2 mos
Receive payment
Task D of $3000
8 mos
START Task C
4 mos
END
Task B
8 mos Task E
3 mos
M2
Receive payment
of $3000
Cash Flow Example: Solver Model
Material Management Issues
Example:
• Single material needed for Task B (2 units) and Task E (30 units)
• Fixed cost to place order = S
• Cost of holding raw materials proportional to number of unit-weeks in
stock
• Cost of holding finished product greater than the cost of holding raw
materials
• Project can be delayed (beyond 17 weeks) at cost of $P per week
Material Management Example
LSA = 0 LSB = 4 LSC = 12
Start 2 units
End
LSD = 6 LSE = 12 LSF = 14
30 units
Lot-Sizing Decisions in Projects
• To minimize holding costs, only place orders at Late Starting Times
• Can never reduce holding costs by delaying project
Time
1 2 3 4 5 6 7 8 9 10 11 12
Demand: 2 30
Choose the option that minimizes inventory cost = order cost + holding
cost of raw materials