Abstract
This paper investigates the problem of setting target finish times (due dates) for project activities with random durations. Using two-stage integer linear stochastic programming, target times are determined in the first stage followed by the development of a detailed project schedule in the second stage. The objective is to balance (1) the cost of project completion as a function of activity target times with (2) the expected penalty incurred by deviating from the specified values. It is shown that the results may be significantly different when deviations are considered, compared to when activities are scheduled as early as possible in the traditional way. For example, the optimal target completion time for a project may be greater than the makespan of the early-start schedules under any scenario. To find solutions, an exact algorithm is developed for the case without a budget constraint and is used as a part of a heuristic when crashing is permitted. All computational procedures are demonstrated on a set of 150 benchmark problems consisting of 90 activities each.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adlakha, V. G., & Kulkarni, V. G. (1989). A classified bibliography of research on stochastic PERT networks. INFOR, 27(3), 272–296.
Baker, K. R., & Scudder, G. D. (1990). Sequencing with earliness and tardiness penalties: a review. Operations Research, 38(1), 22–36.
Birge, J. R. (1997). Stochastic programming computation and applications. INFORMS Journal of Computing, 9(2), 111–133.
Bottcher, J., Drexl, A., Kolisch, R., & Salewski, F. (1999). Project scheduling under partially renewable resource constraints. Management Science, 45(4), 543–559.
Buss, A. H., & Rosenblatt, M. J. (1997). Activity delay in stochastic project networks. Operations Research, 45(1), 126–139.
Chapman, C. (1997). Project risk analysis and management—PARM the generic process. International Journal of Project Management, 15(5), 273–281.
Chrétienne, P., & Sourd, F. (2003). PERT scheduling with convex cost functions. Theoretical Computer Science, 292(1), 145–164.
Clausen, J., Hansen, J., Larsen, J., & Larsen, A. (2001). Disruption management. ORMS Today, 28(5), 40–43.
Davenport, A. J., & Beck, J. C. (2000). A survey of techniques for scheduling under uncertainty. Unpublished manuscript, Toronto, Canada. Available at http://www.mie.utoronto.ca/staff/profiles/beck/publications.html
Elmaghraby, S. E., Ferreira, A. A., & Tavares, L. V. (2000). Optimal start times under stochastic activity durations. International Journal of Production Economics, 64(1–3), 153–164.
Goldberg, A. V. (1997). An efficient implementation of a scaling minimum-cost flow algorithm. Journal of Algorithms, 22(1), 1–29.
Herroelen, W., & Leus, R. (2004a). The construction of stable project baseline schedules. European Journal of Operational Research, 156(3), 550–565.
Herroelen, W., & Leus, R. (2004b). Robust and reactive project scheduling: A review and classification of procedures. International Journal of Production Research, 42(8), 1599–1620.
Herroelen, W., De Reyck, B., & Demeulemeester, E. (1998). Resource-constrained project scheduling: A survey of recent developments. Computers & Operations Research, 25(4), 279–302.
ILOG (2002). CPLEX 7.5, Reference Manual. ILOG, Inc, Mountain View, CA.
Klein Haneveld, W. K., & van der Vlerk, M. H. (1999). Stochastic integer programming: General models and algorithms. Annals of Operations Research, 85, 39–57.
Kolisch, R., & Padman, R. (2001). An integrated survey of deterministic project scheduling. Omega, 29(3), 249–272.
Kolisch, R., Sprecher, A., & Drexl, A. (1995). Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science, 41(10), 1693–1703. Online library PSPLIB available at http://www.bwl.uni-kiel.de/Prod/psplib/
Kouvelis, P., & Yu, G. (1997). Robust discrete optimization and its application. Norwell: Kluwer Academic.
Miller, R., & Lessard, D. (2001). Understanding and managing risks in large engineering projects. International Journal of Project Management, 19(8), 437–443.
Nemhauser, G., & Wolsey, L. (1988). Integer and combinatorial optimization. New York: Wiley.
Pich, M. T., Loch, C. H., & De Meyer, A. (2002). On uncertainty, ambiguity, and complexity in project management. Management Science, 48(8), 1008–1023.
Porteus, E. L. (1990). Stochastic inventory theory. In: D.P. Heyman M.J. Sobel (Eds.), Handbooks in operations research and management science: Vol. 2. Stochastic models. Amsterdam: North-Holland.
Sourd, F., & Kedad-Sidhoum, S. (2003). The one-machine problem with earliness and tardiness penalties. Journal of Scheduling, 6(6), 533–549.
Vanhoucke, M., Demeulemeester, E., & Herroelen, W. (2001). An exact procedure for the resource-constrained weighted earliness—tardiness project scheduling problem. Annals of Operations Research, 102(1–4), 179–196.
Van Mieghem, J. A. (2003). Capacity management, investment, and hedging: review and recent developments. Manufacturing & Service Operations Management, 5(4), 269–302.
Yang, K.-K. (1996). Effects of erroneous estimation of activity durations on scheduling and dispatching a single project. Decision Sciences, 27(2), 255–290.
Yu, G., & Qi, X. (2004). Disruption management: framework, models and applications. Singapore: Word Scientific.
Yu, G., Argüello, M., Song, G., McCowan, S. M., & White, A. (2003). A new era for crew recovery at continental airlines. Interfaces, 33(1), 5–22.
Zhu, G., Bard, J. F., & Yu, G. (2005). Disruption management for resource-constraint project scheduling. Journal of the Operational Research Society, 56, 365–381.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhu, G., Bard, J.F. & Yu, G. A two-stage stochastic programming approach for project planning with uncertain activity durations. J Sched 10, 167–180 (2007). https://doi.org/10.1007/s10951-007-0008-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-007-0008-x