Project management with dynamic scheduling: Baseline scheduling, risk analysis and project control

Project Management with Dynamic Scheduling: Baseline Scheduling, Risk Analysis and Project Control

Volumn , Issue , 2012, Pages 1-310

  Vanhoucke, Mario ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84954595078     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-642-25175-7     Document Type: Book

References (145)

1. Abba W (2008) The trouble with earned schedule. The Measurable News Fall:29-30
2. Agrawal M, Elmaghraby S, Herroelen W (1996) DAGEN: a generator of testsets for project activity nets. Eur J Oper Res 90:376-382
3. Akkan C, Drexl A, Kimms A (2005) Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. Eur J Oper Res 165:339-358
4. Alvarez-Valdes R, Tamarit J (1989) Heuristic algorithms for resource-constrained project scheduling: a review and empirical analysis. In: Slowinski R, Weglarz J (eds) Advances in project scheduling. Elsevier
5. Amsterdam Amor J, Teplitz C (1998) An efficient approximation procedure for project composite learning curves. Proj Manag J 29:28-42
6. Amor J (2002) Scheduling programs with repetitive projects using composite learning curve approximations. Proj Manage J 33:16-29
7. Amor J, Teplitz C (1993) Improving CPM’s accuracy using learning curves. Proj Manage J 24:1519
8. Anbari F (2003) Earned value project management method and extensions. Proj Manag J 34(4): 12-23
9. Archibald RD (1976) Managing high-technology programs and projects. Wiley, New York
10. Ash R, Smith-Daniels DE (1999) The effects of learning, forgetting, and relearning on decision rule performance in multiproject scheduling. Decis Sci 30:47-82
11. Badiru A (1995) Incorporating learning curve effects into critical resource diagramming. Proj Manage J 2:38-45
12. Bartusch M, Mohring R, Radermacher F (1988) Scheduling project networks with resource constraints and time windows. Ann Oper Res 16(1):199-240
13. Bein W, Kamburowski J, Stallmann M (1992) Optimal reduction of two-terminal directed acyclic graphs. SIAM J Comput 21:1112-1129
14. Billstein N, Radermacher F (1977) Time-cost optimization. Method Oper Res 27:274-294
15. Blazewicz J, Lenstra J, Rinnooy Kan A (1983) Scheduling subject to resource constraints: classification and complexity. Discret Appl Math 5:11-24
16. Book S (2006a) Correction note: “earned schedule” and its possible unreliability as an indicator. The Measurable News Fall:22-24
17. Book S (2006b) “Earned schedule” and its possible unreliability as an indicator. The Measurable News Spring:24-30
18. Brucker P, Drexl A, Mohring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: notation, classification, models, and methods. Eur J Oper Res 112:3-41
19. Cho J, Yum B (1997) An uncertainty importance measure of activities in PERT networks. Int J Prod Res 35:2737-2758
20. Christensen D (1993) The estimate at completion problem: a review of three studies. Proj Manag J 24:37-42
21. Cooper D (1976) Heuristics for scheduling resource-constrained projects: an experimental investigation. Manag Sci 22:1186-1194
22. Cooper K (2003) Your project’s real price tag? Letters to the editor. Harv Bus Rev 81:122-122
23. Crowston W (1970) Network reduction and solution. Oper Res Q 21:435-450
24. Crowston W, Thompson G (1967) Decision CPM: a method for simultaneous planning, scheduling and control of projects. Oper Res 15:407-426
25. Dar-El E (1973) MALB - A heuristic technique for balancing large single-model assembly lines. IIE Trans 5:343-356
26. Davies E (1974) An experimental investigation of resource allocation in multiactivity projects. Oper Res Q 24:587-591
27. Davis E (1975) Project network summary measures constrained-resource scheduling. AIIE Trans 7:132-142
28. Dayanand N, Padman R (1997) On modelling payments in projects. J Oper Res Soc 48:906-918
29. Dayanand N, Padman R (2001a) Project contracts and payment schedules: the client’s problem. Manag Sci 47:1654-1667
30. Dayanand N, Padman R (2001b) A two stage search heuristic for scheduling payments in projects. Ann Oper Res 102:197-220
31. De Boer R (1998) Resource-constrained multi-project management - A hierarchical decision support system. PhD thesis, Institute for Business Engineering and Technology Application, The Netherlands
32. De P, Dunne E, Ghosh J, Wells C (1995) The discrete time-cost tradeoff problem revisited. Eur J Oper Res 81:225-238
33. De P, Dunne E, Ghosh J, Wells C (1997) Complexity of the discrete time/cost trade-off problem for project networks. Oper Res 45:302-306
34. Delisle C, Olson D (2004) Would the real project management language please stand up? Int J Proj Manag 22:327-337
35. Demeulemeester E (1995) Minimizing resource availability costs in time-limited project networks. Manag Sci 41:1590-1598
36. Demeulemeester E, Herroelen W (1996) An efficient optimal solution for the preemptive resource-constrained project scheduling problem. Eur J Oper Res 90:334-348
37. Demeulemeester E, Herroelen W (2002) Project scheduling: a research handbook. Kluwer Academic Publishers, Boston
38. Demeulemeester E, Dodin B, Herroelen W (1993) A random activity network generator. Oper Res 41:972-980
39. Demeulemeester E, De Reyck B, Foubert B, Herroelen W, Vanhoucke M (1998) New computational results on the discrete time/cost trade-off problem in project networks. J Oper Res Soc 49:1153-1163
40. Demeulemeester E, Vanhoucke M, Herroelen W (2003) Rangen: a random network generator for activity-on-the-node networks. J Sched 6:17-38
41. De Reyck B (1998) Scheduling projects with generalized precedence relations: exact and heuristic procedures. PhD thesis, Katholieke Universiteit Leuven
42. Drexl A, Nissen R, Patterson J, Salewski F (2000) ProGen/wx - an instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions. Eur J Oper Res 125:59-72
43. El-Rayes K, Moselhi O (1998) Resource-driven scheduling of repetitive activities. Constr Manage Econ 16:433-446
44. Elmaghraby S (1977) Activity networks: project planning and control by network models. Wiley, New York
45. Elmaghraby S (1995) Activity nets: a guided tour through some recent developments. Eur J Oper Res 82:383-408
46. Elmaghraby S (2000) On criticality and sensitivity in activity networks. Eur J Oper Res 127: 220-238
47. Elmaghraby S, Herroelen W (1980) On the measurement of complexity in activity networks. Eur J Oper Res 5:223-234
48. Elmaghraby S, Kamburowsky R (1992) The analysis of activity networks under generalized precedence relations. Manag Sci 38:1245-1263
49. Elmaghraby S, Fathi Y, Taner M (1999) On the sensitivity of project variability to activity mean duration. Int J Prod Econ 62:219-232
50. Etgar R, Shtub A (1999) Scheduling project activities to maximize the net present value - the case of linear time-dependent cash flows. Int J Prod Res 37:329-339
51. Fleming Q, Koppelman J (2003) What’s your project’s real price tag? Harv Bus Rev 81:20-21
52. Fleming Q, Koppelman J (2005) Earned value project management, 3rd edn. Project Management Institute, Newtown Square
53. French S (1982) Sequencing and scheduling: an introduction to the mathematics of the Job-shop. Ellis Horwood/Wiley
54. Goldratt E (1997) Critical chain. North River Press, Great Barrington Goldratt E, Cox J (1984) The goal. North River Press, Croton-on-Hudson
55. Gong D (1997) Optimization of float use in risk analysis-based network scheduling. Int J Proj Manag 15:187-192
56. Goto E, Joko T, Fujisawa K, Katoh N, Furusaka S (2000) Maximizing net present value for generalized resource constrained project scheduling problem. Working paper, Nomura Research Institute, Japan
57. Gutierrez G, Paul A (2000) Analysis of the effects of uncertainty, risk-pooling, and subcontracting mechanisms on project performance. Oper Res 48:927-938
58. Harris R, Ioannou P (1998) Scheduling projects with repeating activities. J Constr Eng Manag 124:269-278
59. Hartmann S, Briskorn D (2010) A survey of variants and extensions of the resource-constrained project scheduling problem. Eur J Oper Res 207:1-15
60. Heimerl C, Kolisch R (2010) Scheduling and staffing multiple projects with a multi-skilled workforce. OR Spectr 32:343-368
61. Herroelen W, De Reyck B (1999) Phase transitions in project scheduling. J Oper Res Soc 50: 148-156
62. Herroelen W, Leus R (2001) On the merits and pitfalls of critical chain scheduling. J Oper Manag 19:559-577
63. Herroelen W, Van Dommelen P, Demeulemeester E (1997) Project network models with discounted cash flows a guided tour through recent developments. Eur J Oper Res 100:97-121
64. Herroelen W, De Reyck B, Demeulemeester E (1998) Resource-constrained project scheduling: a survey of recent developments. Comput Oper Res 25:279-302
65. Herroelen W, Demeulemeester E, De Reyck B (1999) A classification scheme for project scheduling problem. In: Weglarz J (ed) Project scheduling - Recent models, algorithms and applications. Kluwer Academic Publishers, Dortrecht, pp 1-26
66. Herroelen W, Leus R, Demeulemeester E (2002) Critical chain project scheduling: do not oversimplify. Proj Manag J 33:48-60
67. Hindelang T, Muth J (1979) A dynamic programming algorithm for decision CPM networks. Oper Res 27:225-241
68. Hulett D (1996) Schedule risk analysis simplified. Project Management Network July:23-30
69. Icmeli O, Erenguc S, Zappe C (1993) Project scheduling problems: a survey. Int J Oper Prod Manag 13:80-91
70. Jacob D (2003) Forecasting project schedule completion with earned value metrics. The Measurable News March:1, 7-9
71. Jacob D (2006) Is “earned schedule” an unreliable indicator? The Measurable News Fall:15-21
72. Jacob D, Kane M (2004) Forecasting schedule completion using earned value metrics? Revisited. The Measurable News Summer:1, 11-17
73. Kaimann R (1974) Coefficient of network complexity. Manag Sci 21:172-177
74. Kaimann R (1975) Coefficient of network complexity: erratum. Manag Sci 21:1211-1212
75. Kang L, Park IC, Lee BH (2001) Optimal schedule planning for multiple, repetitive construction process. J Constr Eng Manag 127:382-390
76. Kao E, Queyranne M (1982) On dynamic programming methods for assembly line balancing. Oper Res 30:375-390
77. Kazaz B, Sepil C (1996) Project scheduling with discounted cash flows and progress payments. J Oper Res Soc 47:1262-1272
78. Klein R (2000) Scheduling of resource-constrained projects. Kluwer Academic, Boston
79. Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur J Oper Res 174:23-37
80. Kolisch R, Sprecher A, Drexl A (1995) Characterization and generation of a general class of resource-constrained project scheduling problems. Manag Sci 41:1693-1703
81. Kuchta D (2001) Use of fuzzy numbers in project risk (criticality) assessment. Int J Proj Manag 19:305-310
82. Kelley J, Walker M (1959) Critical path planning and scheduling: an introduction. Mauchly Associates, Ambler
83. Kelley J (1961) Critical path planning and scheduling: mathematical basis. Oper Res 9:296-320
84. Lipke W (2003) Schedule is different. The Measurable News Summer:31-34
85. Lipke W (2004) Connecting earned value to the schedule. The Measurable News Winter:1, 6-16
86. Lipke W (2006) Applying earned schedule to critical path analysis and more. The Measurable News Fall:26-30
87. Lipke W, Zwikael O, Henderson K, Anbari F (2009) Prediction of project outcome: the application of statistical methods to earned value management and earned schedule performance indexes. Int J Proj Manage 27:400-407
88. Loch C, De Meyer A, Pich M (2006) Managing the unknown: a new approach to managing high uncertainty and risk in project. Wiley, New Jersey
89. MacCrimmon K, Ryavec C (1967) An analytical study of the PERT assumptions. In: Archibald, R.D. and Villoria, R.L. (eds) Network-based management systems (PERT/CMP). Wiley, New York, pp 24-26
90. Mastor A (1970) An experimental and comparative evaluation of production line balancing techniques. Manag Sci 16:728-746
91. Mika M (2006) Modelling setup times in project scheduling. In: Perspectives in modern project scheduling, vol 92, International series in operations research & management science. Springer, New York, pp 131-163
92. Moder J, Phillips C, Davis E (1983) Project management with CPM PERT and precedence diagramming. Nostrand Reinhold, New York
93. Mohring R (1984) Minimizing costs of resource requirements in project networks subject to a fixed completion time. Oper Res 32:89-120
94. Moselhi O, El-Rayes K (1993) Scheduling of repetitive projects with cost optimization. J Constr Eng Manage 119:681-697
95. Nembhard D, Uzumeri M (2000) An individual-based description of learning within an organization. IEEE Trans Eng Manag 47(3):370-378
96. Özdamar L, Ulusoy G (1995) A survey on the resource-constrained project scheduling problem. IIE Trans 27:574-586
97. Pascoe T (1966) Allocation of resources - CPM. Revue Francaise de Recherche Operationnelle 38:31-38
98. Patterson J (1976) Project scheduling: the effects of problem structure on heuristic scheduling. Nav Res Logist 23:95-123
99. Patterson J (1979) An implicit enumeration algorithm for the time/cost trade-off problem in project network analysis. Found Control Eng 6:107-117
100. Pinnell S, Busch J (1993) How do you measure the quality of your project management? PM Network December:35-36
101. Piper C (2005) Cpsim2: the critical path simulator (windows version). Richard Ivey School of Business, London
102. PMBOK (2004) A guide to the project management body of knowledge, 3rd edn. Project Management Institute, Inc., Newtown Square Port O, Schiller Z, King R, Woodruff D
103. Phillips S, Carey J (1990) A smarter way to manufacture. Business Week April 30:110-115
104. Robinson D (1975) A dynamic programming solution to cost/time trade-off for CPM. Manag Sci 22:158-166
105. Schwindt C (1995) A new problem generator for different resource-constrained project scheduling problems with minimal and maximal time lags. WIOR-Report-449, Institut fur Wirtschaftstheorie und Operations Research, University of Karlsruhe
106. Sepil C, Ortac N (1997) Performance of the heuristic procedures for constrained projects with progress payments. J Oper Res Soc 48:1123-1130
107. Shtub, A. (1991). Shtub A (1991) Scheduling of programs with repetitive projects. Proj Manage J 22:49-53
108. Shtub A, Bard J, Globerson S (1994) Project management: engineering, technology and implementation. Prentice-Hall Inc, Englewood Cliffs
109. Shtub A, LeBlanc L, Cai Z (1996) Scheduling programs with repetitive projects: a comparison of a simulated annealing, a genetic and a pair-wise swap algorithm. Eur J Oper Res 88:124-138
110. Skutella M (1998) Approximation algorithms for the discrete time-cost tradeoff problem. Math Oper Res 23:909-929
111. Tavares L (1999) Advanced models for project management. Kluwer Academic Publishers, Dordrecht
112. Tavares L, Ferreira J, Coelho J (1999) The risk of delay of a project in terms of the morphology of its network. Eur J Oper Res 119:510-537
113. Thesen A (1977) Measures of the restrictiveness of project networks. Networks 7:193-208
114. Ulusoy G, Cebelli S (2000) An equitable approach to the payment scheduling problem in project management. Eur J Oper Res 127:262-278
115. Uyttewaal E (2005) Dynamic scheduling with Microsoft Office Project 2003: the book by and for professionals. Co-published with International Institute for Learning Inc, Boca Raton
116. Vandevoorde S, Vanhoucke M (2006) A comparison of different project duration forecasting methods using earned value metrics. Int J Proj Manag 24:289-302
117. Vanhoucke M (2005) New computational results for the discrete time/cost trade-off problem with time-switch constraints. Eur J Oper Res 165:359-374
118. Vanhoucke M (2006a) An efficient hybrid search algorithm for various optimization problems. Lect Notes Comput Sci 3906:272-283
119. Vanhoucke M (2006b) Work continuity constraints in project scheduling. J Constr Eng Manag 132:14-25
120. Vanhoucke M (2007) Work continuity optimization for the Westerscheldetunnel project in the Netherlands. Tijdschrift voor Economie en Management 52:435-449
121. Vanhoucke M (2008a) Measuring time using novel earned value management metrics. In: Proceedings of the 22nd IPMA World Congress (Rome), vol 1, pp 99-103
122. Vanhoucke M (2008b) Project tracking and control: can we measure the time? Projects and Profits, August:35-40
123. Vanhoucke M (2008c) Setup times and fast tracking in resource-constrained project scheduling. Comput Ind Eng 54:1062-1070
124. Vanhoucke M (2009) Static and dynamic determinants of earned value based time forecast accuracy. In: Kidd T (ed) Handbook of research on technology project management, planning, and operations. Information Science Reference, Hershey, pp 361-374
125. Vanhoucke M (2010a) Measuring time - Improving project performance using earned value management, vol 136, International series in operations research and management science. Springer, New York
126. Vanhoucke M (2010b) Using activity sensitivity and network topology information to monitor project time performance. Omega Int J Manag Sci 38:359-370
127. Vanhoucke M (2011) On the dynamic use of project performance and schedule risk information during project tracking. Omega Int J Manag Sci 39:416-426
128. Vanhoucke M, Debels D (2007) The discrete time/cost trade-off problem: extensions and heuristic procedures. J Sched 10:311-326
129. Vanhoucke M, Debels D (2008) The impact of various activity assumptions on the lead time and resource utilization of resource-constrained projects. Comput Ind Eng 54:140-154
130. Vanhoucke M, Vandevoorde S (2007a) Measuring the accuracy of earned value/earned schedule forecasting predictors. The Measurable News, Winter:26-30
131. Vanhoucke M, Vandevoorde S (2007b) A simulation and evaluation of earned value metrics to forecast the project duration. J Oper Res Soc 58:1361-1374
132. Vanhoucke M, Vandevoorde S (2008) Earned value forecast accuracy and activity criticality. The Measurable News Summer:13-16
133. Vanhoucke M, Vandevoorde S (2009) Forecasting a project’s duration under various topological structures. The Measurable News Spring:26-30
134. Vanhoucke M, Demeulemeester E, Herroelen W (2001a) Maximizing the net present value of a project with linear time-dependent cash flows. Int J Prod Res 39:3159-3181
135. Vanhoucke M, Demeulemeester E, Herroelen W (2001b) On maximizing the net present value of a project under renewable resource constraints. Manag Sci 47:1113-1121
136. Vanhoucke M, Demeulemeester E, Herroelen W (2002) Discrete time/cost trade-offs in project scheduling with time-switch constraints. J Oper Res Soc 53:741-751
137. Vanhoucke M, Demeulemeester E, Herroelen W (2003) Progress payments in project scheduling problems. Eur J Oper Res 148:604-620
138. Vanhoucke M, Coelho J, Debels D, Maenhout B, Tavares L (2008) An evaluation of the adequacy of project network generators with systematically sampled networks. Eur J Oper Res 187: 511-524
139. Van Peteghem V, Vanhoucke M (2010a) A genetic algorithm for the preemptive and non-preemtive multi-mode resource-constrained project scheduling problem. Eur J Oper Res 201:409-418
140. Van Peteghem V, Vanhoucke M (2010b) Introducing learning effects in resource-constrained project scheduling. Technical report, Ghent University, Ghent, Belgium
141. Walker M, Sawyer J (1959) Project planning and scheduling. Technical Report Report 6959, E.I. duPont de Nemours and Co., Wilmington
142. Wiest J, Levy F (1977) A management guide to PERT/CPM: with GERT/PDM/DCPM and other networks. Prentice-Hall, Inc, Englewood Cliffs
143. Williams T (1992) Criticality in stochastic networks. J Oper Res Soc 43:353-357
144. Wright T (1936) Factors affecting the cost of airplanes. J Aeronaut Sci 3:122-128
145. Yelle L (1979) The learning curves: historical review and comprehensive survey. Decis Sci 10(2):302-328