Dynamic Project Expediting: A Stochastic Shortest-Path Approach

References

• Azaron A, Katagiri H, Sakawa M (2007) Time-cost trade-off via optimal control theory in Markov PERT networks. Ann. Oper. Res. 150(1):47–64.Crossref, Google Scholar
• Bertsekas D (2012) Dynamic Programming and Optimal Control, vol. 2, 4th ed. (Athena Scientific, Nashua, NH).Google Scholar
• Bertsekas D (2017) Dynamic Programming and Optimal Control, vol. 1, 4th ed. (Athena Scientific, Nashua, NH).Google Scholar
• Bertsekas D, Tsitsiklis J (1991) An analysis of stochastic shortest path problems. Math. Oper. Res. 16(3):580–595.Link, Google Scholar
• BioNTech (2021) Update on vaccine production at biontech’s manufacturing site in marburg. Retrieved March 23, 2021, https://investors.biontech.de/node/9301/pdf.Google Scholar
• Bregman R (2009) A heuristic procedure for solving the dynamic probabilistic project expediting problem. Eur. J. Oper. Res. 192(1):125–137.Crossref, Google Scholar
• Cormen T, Leiserson C, Rivest R, Stein C (2009) Introduction to Algorithms, 3rd ed. (MIT Press, Cambridge, MA).Google Scholar
• Creemers S, Leus R, Lambrecht M (2010) Scheduling Markovian PERT networks to maximize the net present value. Oper. Res. Lett. 38(1):51–56.Crossref, Google Scholar
• De Meyer A, Loch C, Pich M (2006) Management of novel projects under conditions of high uncertainty. Working paper, Cambridge Judge Business School, Cambridge, UK.Google Scholar
• Fulkerson D (1961) A network flow computation for project cost curves. Management Sci. 7(2):167–178.Link, Google Scholar
• Godinho P, Branco F (2012) Adaptive policies for multi-mode project scheduling under uncertainty. Eur. J. Oper. Res. 216(3):553–562.Crossref, Google Scholar
• Goh J, Hall N (2013) Total cost control in project management via satisficing. Management Sci. 59(6):1354–1372.Link, Google Scholar
• Grushka-Cockayne Y (2020) Use data to revolutionize project planning. Harvard Bus. Rev. https://hbr.org/2020/02/use-data-to-revolutionize-project-planning.Google Scholar
• Gutjahr W, Strauss C, Wagner E (2000) A stochastic branch-and-bound approach to activity crashing in project management. INFORMS J. Comput. 12(2):125–135.Link, Google Scholar
• Jensen J, Gutin G (2007) Digraphs: Theory, Algorithms and Applications (Springer-Verlag, Berlin).Google Scholar
• Jørgensen T, Wallace S (2000) Improving project cost estimation by taking into account managerial flexibility. Eur. J. Oper. Res. 127(2):239–251.Crossref, Google Scholar
• Kelley J Jr (1961) Critical path planning and scheduling: Mathematical basis. Oper. Res. 9(3):296–320.Link, Google Scholar
• Klastorin T, Mitchell G (2013) Optimal project planning under the threat of a disruptive event. IIE Trans. 45(1):68–80.Crossref, Google Scholar
• Laslo Z (2003) Activity time-cost tradeoffs under time and cost chance constraints. Comput. Industry Engrg. 44(3):365–384.Crossref, Google Scholar
• Lehman E, Leighton F, Meyer A (2017) Mathematics for Computer Science, 3rd ed. https://eng.libretexts.org/Bookshelves/Computer_Science/Programming_and_Computation_Fundamentals/Mathematics_for_Computer_Science_(Lehman_Leighton_and_Meyer) .Google Scholar
• Li H, Womer N (2015) Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming. Eur. J. Oper. Res. 246(1):20–33.Crossref, Google Scholar
• Magretta J (1998) Fast, global, and entrepreneurial: Supply chain management, Hong Kong style. Harvard Bus. Rev. https://hbr.org/1998/09/fast-global-and-entrepreneurial-supply-chain-management-hong-kong-style.Google Scholar
• Mitchell G, Klastorin T (2007) An effective methodology for the stochastic project compression problem. IIE Trans. 39(10):957–969.Crossref, Google Scholar
• Pinto J, Mantel S (1990) The causes of project failure. IEEE Trans. Engrg. Management 37(4):269–276.Crossref, Google Scholar
• PMI (2018) Project management institute: Pulse of the profession. Retrieved March 23, 2021, https://www.pmi.org/-/media/pmi/documents/public/pdf/learning/thought-leadership/pulse/pulse-of-the-profession-2018.pdf.Google Scholar
• PMI (2020) Project management institute: Pulse of the profession. Retrieved March 23, 2021, https://www.pmi.org/learning/library/forging-future-focused-culture-11908.Google Scholar
• ProjectManagementdotcom (2017) Discussion board: When should you update baselines and when should you not? Retrieved October 22, 2018, https://www.projectmanagement.com/discussion-topic/65058/When-should-you-update-baselines-and-when-should-you-not-.Google Scholar
• Shen S, Smith J, Ahmed S (2010) Expectation and chance-constrained models and algorithms for insuring critical paths. Management Sci. 56(10):1794–1814.Link, Google Scholar
• Sigal C, Pritsker A, Solberg J (1980) The stochastic shortest route problem. Oper. Res. 28(5):1122–1129.Link, Google Scholar
• Sobel MJ, Szmerekovsky JG, Tilson V (2009) Scheduling projects with stochastic activity duration to maximize expected net present value. Eur. J. Oper. Res. 198(3):697–705.Crossref, Google Scholar
• Sterman J (1992) System dynamics modeling for project management. Working paper, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
• 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(2):510–537.Crossref, Google Scholar
• 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(2):511–524.Crossref, Google Scholar