IDEAS home Printed from https://ideas.repec.org/p/bbu/wpaper/10.html
   My bibliography  Save this paper

On Calculating Activity Slack In Stochastic Project Networks

Author

Listed:
  • DEDIU MAGDALENA

    (Dunarea de Jos University)

  • DOBREA ALINA

    (Dunarea de Jos University)

Abstract

Problem statement: Identifying critical tasks in a project network is easily done when task times are deterministic, but doing so under stochastic task times is problematic. The few methods that have been proposed contain serious drawbacks which lead to identifying critical tasks incorrectly, leaving project managers without the means to: (1) identify and rank the most probable sources of project delays, (2) assess the magnitude of each source of schedule risk, and (3) identify which tasks represent the best opportunities for successfully addressing schedule risk?

Suggested Citation

  • Dediu Magdalena & Dobrea Alina, "undated". "On Calculating Activity Slack In Stochastic Project Networks," Description: Managerial Challenges of the Contemporary Society 10, Faculty of Economics and Business Administration, Babes-Bolyai University.
    • Handle: RePEc:bbu:wpaper:10
    as

    Download full text from publisher

    File URL: http://conference.ubbcluj.ro/mccs/RePEc/bbu/wpaper/55-59.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Bajis Dodin, 1984. "Determining the K Most Critical Paths in PERT Networks," Operations Research, INFORMS, vol. 32(4), pages 859-877, August.
    2. J. J. Martin, 1965. "Distribution of the Time Through a Directed, Acyclic Network," Operations Research, INFORMS, vol. 13(1), pages 46-66, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gary Mitchell, 2010. "On Calculating Activity Slack in Stochastic Project Networks," American Journal of Economics and Business Administration, Science Publications, vol. 2(1), pages 78-85, March.
    2. Bregman, Robert L., 2009. "A heuristic procedure for solving the dynamic probabilistic project expediting problem," European Journal of Operational Research, Elsevier, vol. 192(1), pages 125-137, January.
    3. Elmaghraby, Salah E., 2000. "On criticality and sensitivity in activity networks," European Journal of Operational Research, Elsevier, vol. 127(2), pages 220-238, December.
    4. Fatemi Ghomi, S. M. T. & Rabbani, M., 2003. "A new structural mechanism for reducibility of stochastic PERT networks," European Journal of Operational Research, Elsevier, vol. 145(2), pages 394-402, March.
    5. Azaron, Amir & Fatemi Ghomi, S.M.T., 2008. "Lower bound for the mean project completion time in dynamic PERT networks," European Journal of Operational Research, Elsevier, vol. 186(1), pages 120-127, April.
    6. Li, Haitao & Womer, Norman K., 2015. "Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming," European Journal of Operational Research, Elsevier, vol. 246(1), pages 20-33.
    7. Badinelli, Ralph D., 1996. "Approximating probability density functions and their convolutions using orthogonal polynomials," European Journal of Operational Research, Elsevier, vol. 95(1), pages 211-230, November.
    8. Azaron, Amir & Fynes, Brian & Modarres, Mohammad, 2011. "Due date assignment in repetitive projects," International Journal of Production Economics, Elsevier, vol. 129(1), pages 79-85, January.
    9. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Longest path analysis in networks of queues: Dynamic scheduling problems," European Journal of Operational Research, Elsevier, vol. 174(1), pages 132-149, October.
    10. Song, Jie & Martens, Annelies & Vanhoucke, Mario, 2022. "Using Earned Value Management and Schedule Risk Analysis with resource constraints for project control," European Journal of Operational Research, Elsevier, vol. 297(2), pages 451-466.
    11. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Modelling complex assemblies as a queueing network for lead time control," European Journal of Operational Research, Elsevier, vol. 174(1), pages 150-168, October.
    12. Sigal, C.E. & Pritsker, A.A.B. & Solberg, J.J., 1979. "The use of cutsets in Monte Carlo analysis of stochastic networks," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 21(4), pages 376-384.
    13. Rabbani, M. & Fatemi Ghomi, S.M.T. & Jolai, F. & Lahiji, N.S., 2007. "A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept," European Journal of Operational Research, Elsevier, vol. 176(2), pages 794-808, January.
    14. Azaron, Amir & Fatemi Ghomi, S. M. T., 2003. "Optimal control of service rates and arrivals in Jackson networks," European Journal of Operational Research, Elsevier, vol. 147(1), pages 17-31, May.
    15. Schmidt, Craig W. & Grossmann, Ignacio E., 2000. "The exact overall time distribution of a project with uncertain task durations," European Journal of Operational Research, Elsevier, vol. 126(3), pages 614-636, November.
    16. R. Alan Bowman, 2003. "Sensitivity curves for effective project management," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(5), pages 481-497, August.
    17. Vanhoucke, Mario, 2010. "Using activity sensitivity and network topology information to monitor project time performance," Omega, Elsevier, vol. 38(5), pages 359-370, October.
    18. Tetsuo Iida, 2000. "Computing bounds on project duration distributions for stochastic PERT networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(7), pages 559-580, October.
    19. Madadi, M. & Iranmanesh, H., 2012. "A management oriented approach to reduce a project duration and its risk (variability)," European Journal of Operational Research, Elsevier, vol. 219(3), pages 751-761.
    20. Fatemi Ghomi, S. M. T. & Hashemin, S. S., 1999. "A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network," European Journal of Operational Research, Elsevier, vol. 114(3), pages 610-625, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bbu:wpaper:10. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Monica ZAHARIE (email available below). General contact details of provider: http://econ.ubbcluj.ro .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.