Network Models Part 2
114
Introduction
114 114
Three Estimates of Activity Time Computing the Weighted Average
115 Determining the Probabilities of Completion in PERT 116 Cost-Time Relationships 119 Conclusion 124 Review Question 124 Case Problems 124
CHAPTER 11
Markov Analysis
126
Introduction
126 127 127 128 133 136 136 136
Markov Analysis Assumptions
MANAGEMENT SCIENCE
Information Flow in the Markov Analysis
Transition Movements and Transition Probabilities
Steady State Probabilities
Conclusion
Conclusion
92 92 92
Review Questions Case Problems
Review Questions Case Problems
CHAPTER 12
CHAPTER 8
Dynamic Programming
138
Distribution Models Part 2
95
Introduction
138 138 139 143 143 144 144
Introduction
95 95 96 97 97
Philosophy of Dynamic Programming Dynamic Programming Problem Six Major Terms of Dynamic Programming
Characteristics of the Assignment Problem Presentation of the Assignment Problem Methods for Solving the Assignment Problem
Conclusion
The Hungarian Method
Review Questions
Conclusion
101 101 102
Case Problem
Review Questions Case Problems
ix
CHAPTER 13
Game Theory
145
CHAPTER 9
Network Models Part 1
103
Introduction
145 145 146 146 147 149 149 150 151 151 152 153 153 154 155 156 157 158 159 160 163 163 164 165 165
Presentation of Game Theory Assumptions of Game Theory
Introduction
103 104
Characteristics of Project Management Terminologies in Program Evaluation and Review Technique (PERT) and Critical Path Method (CPM) Differences between PERT and CPM
Classification of Games
Zero-sum Games
104 105 105 106 105 107 111 111 112
Conclusion
Review Question Case Problems
Purpose of PERT/CPM Advantages of PERT/CPM
PERT/CPM Procedure
CHAPTER 14
Solving CPM Conclusion
Waiting Lines
Introduction
Review Questions Case Problems
Characteristics of Waiting Line Situations
Structure of a Queuing System
CHAPTER 10
Major Costs Considered in a Queuing System
Network Models Part 2
114
Methodology of Queuing Analysis
viii
Arrival Process Service Process
Introduction
114 114
Three Estimates of Activity Time Computing the Weighted Average
Waiting Line
115 Determining the Probabilities of Completion in PERT 116 Cost-Time Relationships 119 Conclusion 124 Review Question 124 Case Problems 124
Queuing Models and Solution Approaches
Deterministic Queuing Systems
Basic Poisson-Exponential Model (M/M/1) Cost Analysis of Queuing Systems Applications of Poisson-Exponential Queuing Systems
Conclusion
CHAPTER 11
Review Questions Case Problems
Markov Analysis
126
Introduction
126 127 127 128 133 136 136 136
Markov Analysis Assumptions
Information Flow in the Markov Analysis
x
Transition Movements and Transition Probabilities
Steady State Probabilities
Conclusion
Review Questions Case Problems
62
CHAPTER 12
Dynamic Programming
138
Made with FlippingBook - Online Brochure Maker