PREFACE |
|
xi | (2) |
ACKNOWLEDGEMENTS |
|
xiii | |
|
|
1 | (16) |
|
1.1 What Is a Schedule? What Is It Good For? |
|
|
1 | (1) |
|
1.2 Traditional Scheduling Techniques |
|
|
2 | (3) |
|
1.3 Network-Based Scheduling Techniques |
|
|
5 | (2) |
|
1.4 Network-Based Project Management: Basic Steps |
|
|
7 | (6) |
|
Step 1. Defining Activities |
|
|
7 | (1) |
|
Step 2. Defining Activity Interdependencies |
|
|
8 | (1) |
|
Step 3. Drawing the Network |
|
|
8 | (1) |
|
Step 4. Time and Resource Estimation |
|
|
9 | (2) |
|
Step 5. Basic Calculations |
|
|
11 | (1) |
|
Step 6. Advanced Calculations |
|
|
11 | (1) |
|
|
12 | (1) |
|
|
12 | (1) |
|
|
13 | (4) |
|
|
17 | (62) |
|
2.1 Introducing a Sample Project |
|
|
18 | (7) |
|
2.2 Basic Definitions. Drawing Rules |
|
|
25 | (4) |
|
2.3 Preceding (Succeeding) Activity Lists |
|
|
29 | (4) |
|
2.4 Drawing of an Arrow Diagram |
|
|
33 | (13) |
|
|
34 | (6) |
|
|
40 | (6) |
|
|
46 | (1) |
|
|
47 | (11) |
|
|
49 | (4) |
|
|
53 | (5) |
|
2.7 Information Obtained From Calculations |
|
|
58 | (6) |
|
2.8 Pros and Cons of the CPM Technique |
|
|
64 | (7) |
|
2.9 Practical Problems and Solutions |
|
|
71 | (7) |
|
|
71 | (3) |
|
|
74 | (4) |
|
|
78 | (1) |
|
CHAPTER 3 CPM Least Cost Scheduling |
|
|
79 | (54) |
|
3.1 Introducing a Sample Project |
|
|
80 | (4) |
|
|
84 | (16) |
|
|
85 | (9) |
|
|
94 | (6) |
|
|
100 | (16) |
|
3.4 Maximal Cost Solution |
|
|
116 | (6) |
|
|
122 | (2) |
|
|
124 | (2) |
|
3.7 Practical Problems and Solutions |
|
|
126 | (5) |
|
|
126 | (1) |
|
|
127 | (4) |
|
|
131 | (2) |
|
CHAPTER 4 Precedence Diagramming |
|
|
133 | (40) |
|
4.1 Introducing the Sample Project |
|
|
134 | (3) |
|
4.2 Definitions. Precedence Relationships. |
|
|
137 | (4) |
|
4.3 Preceding Activity List |
|
|
141 | (2) |
|
|
143 | (1) |
|
|
144 | (4) |
|
4.6 Notes on Calculation Rules. |
|
|
148 | (4) |
|
4.7 PDM Calculation: Splitting Allowed |
|
|
152 | (3) |
|
|
155 | (1) |
|
4.9 Notes on Negative Lag and Dangling Activities |
|
|
156 | (1) |
|
4.10 The Paradox Behavior of PDM |
|
|
157 | (1) |
|
4.11 Information Obtained from Calculations |
|
|
158 | (6) |
|
Critical Activities: No Splitting Allowed |
|
|
158 | (1) |
|
Activity Floats: No-Splitting Allowed |
|
|
159 | (1) |
|
Floats: Precedence Relationships |
|
|
160 | (2) |
|
Critical Activities: Splitting Allowed |
|
|
162 | (1) |
|
Activity Floats: Splitting Allowed |
|
|
163 | (1) |
|
|
164 | (2) |
|
4.13 Practical Problems and Solutions |
|
|
166 | (4) |
|
|
166 | (1) |
|
|
167 | (3) |
|
|
170 | (3) |
|
CHAPTER 5 Advanced Precedence Diagramming |
|
|
173 | (30) |
|
5.1 Introducing the Sample Project |
|
|
174 | (1) |
|
5.2 Maximal Type of Relationships |
|
|
175 | (8) |
|
5.3 Calculations with Maximal Relationships |
|
|
183 | (6) |
|
5.4 Information Obtained from Calculations |
|
|
189 | (1) |
|
|
190 | (4) |
|
Minimal Type Of Constraints |
|
|
190 | (1) |
|
Maximal Type Of Constraints |
|
|
191 | (1) |
|
Mixed Type Of Constraints |
|
|
191 | (3) |
|
|
194 | (2) |
|
5.7 Practical Problems and Solutions |
|
|
196 | (4) |
|
|
196 | (1) |
|
|
197 | (3) |
|
|
200 | (3) |
|
CHAPTER 6 Precedence Diagramming With Bounded Activity Duration |
|
|
203 | (16) |
|
6.1 Introducing the Sample Project |
|
|
204 | (2) |
|
6.2 Calculations With Minimal Relationships |
|
|
206 | (5) |
|
Determining the Minimal Project Duration |
|
|
207 | (2) |
|
Determining the Maximal Project Duration |
|
|
209 | (2) |
|
6.3 Calculations With Maximal Relationships |
|
|
211 | (2) |
|
Determining the Minimal Project Duration |
|
|
211 | (1) |
|
Determining the Maximal Project Duration |
|
|
212 | (1) |
|
6.4 Practical Problems and Solutions |
|
|
213 | (5) |
|
|
213 | (2) |
|
|
215 | (3) |
|
|
218 | (1) |
|
CHAPTER 7 PDM Least Cost Scheduling |
|
|
219 | (24) |
|
7.1 Introducing The Sample Project |
|
|
220 | (3) |
|
7.2 Differences Between CPM and PDM Cost Curves |
|
|
223 | (1) |
|
|
224 | (14) |
|
|
238 | (1) |
|
7.5 Practical Problems and Solutions |
|
|
239 | (2) |
|
|
239 | (1) |
|
|
240 | (1) |
|
|
241 | (2) |
|
CHAPTER 8 Resources In Scheduling |
|
|
243 | (16) |
|
8.1 Using Optimal Procedures |
|
|
244 | (1) |
|
8.2 Resource Leveling (Fixed Project Duration) |
|
|
245 | (7) |
|
8.3 Resource Allocation (Limited Resources) |
|
|
252 | (4) |
|
8.4 Maximal Precedence Relationships in Leveling |
|
|
256 | (1) |
|
8.5 Maximal Precedence Relationships in Allocation |
|
|
257 | (2) |
|
CHAPTER 9 Art of Scheduling |
|
|
259 | (26) |
|
9.1 Work Breakdown Structure |
|
|
260 | (5) |
|
9.2 Special Activity Types |
|
|
265 | (3) |
|
9.3 Cash Flow Forecasting, Monitoring And Control |
|
|
268 | (3) |
|
|
269 | (1) |
|
|
269 | (2) |
|
|
271 | (7) |
|
9.5 Multiproject Scheduling |
|
|
278 | (3) |
|
9.6 Calendar Versus Workday Schedule |
|
|
281 | (4) |
|
APPENDIX A Mathematical Basis |
|
|
285 | (32) |
|
|
285 | (2) |
|
2. Duality Theorem of Path and Cut |
|
|
287 | (4) |
|
3. Minimal Path-Maximal Potential Problem |
|
|
291 | (5) |
|
4. Maximal Flow Minimal Cut |
|
|
296 | (8) |
|
5. The First "K" Longest Path |
|
|
304 | (5) |
|
6. Linear Programming and Duality |
|
|
309 | (3) |
|
7. Practical Problems and Solutions |
|
|
312 | (3) |
|
|
312 | (2) |
|
|
314 | (1) |
|
|
315 | (2) |
|
APPENDIX B Computer Applications |
|
|
317 | (6) |
|
1. Choosing Among Available Applications |
|
|
317 | (4) |
|
|
321 | (2) |
BIBLIOGRAPHY |
|
323 | (6) |
INDEX |
|
329 | |