IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v24y1996i1p37-46.html
   My bibliography  Save this article

Identifying critical activities in stochastic resource constrained networks

Author

Listed:
  • Bowers, J.

Abstract

The analysis of the stochastic project network can provide indications of both the magnitude of temporal risk and the sources of that risk. In a project dominated by technological dependencies rather than resource constraints, the sources of risk can be identified by examining the probabilities of each activity lying on a critical path. Similar criticality probabilities can also be derived for resource constrained stochastic networks if the definition of the critical path is revised. The use of this revised criticality probability is illustrated in an analysis of an example project and other possible measures of identifying the important activities are considered. A quantitative test of the value of the information provided by the criticality probability is developed and applied to a set of 100 randomly generated project networks, comparing the possible measures. This test indicates that the criticality probability provides valuable management information, extending the familiar concept of the critical path to the resource constrained stochastic network.

Suggested Citation

  • Bowers, J., 1996. "Identifying critical activities in stochastic resource constrained networks," Omega, Elsevier, vol. 24(1), pages 37-46, February.
    • Handle: RePEc:eee:jomega:v:24:y:1996:i:1:p:37-46
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(95)00046-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Christofides, Nicos & Alvarez-Valdes, R. & Tamarit, J. M., 1987. "Project scheduling with resource constraints: A branch and bound approach," European Journal of Operational Research, Elsevier, vol. 29(3), pages 262-273, June.
    2. Soroush, H. M., 1994. "The most critical path in a PERT network: A heuristic approach," European Journal of Operational Research, Elsevier, vol. 78(1), pages 93-105, October.
    3. Bajis M. Dodin & Salah E. Elmaghraby, 1985. "Approximating the Criticality Indices of the Activities in PERT Networks," Management Science, INFORMS, vol. 31(2), pages 207-223, February.
    4. E. Demeulemeester & B. Dodin & W. Herroelen, 1993. "A Random Activity Network Generator," Operations Research, INFORMS, vol. 41(5), pages 972-980, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sławomir Biruk & Piotr Jaśkowski & Magdalena Maciaszczyk, 2022. "Conceptual Framework of a Simulation-Based Manpower Planning Method for Construction Enterprises," Sustainability, MDPI, vol. 14(9), pages 1-13, April.
    2. 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.

    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. Mori, Masao & Tseng, Ching Chih, 1997. "A genetic algorithm for multi-mode resource constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 134-141, July.
    2. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    3. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    4. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    5. Jan Böttcher & Andreas Drexl & Rainer Kolisch & Frank Salewski, 1999. "Project Scheduling Under Partially Renewable Resource Constraints," Management Science, INFORMS, vol. 45(4), pages 543-559, April.
    6. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    7. Luis F. Machado-Domínguez & Carlos D. Paternina-Arboleda & Jorge I. Vélez & Agustin Barrios-Sarmiento, 2021. "A memetic algorithm to address the multi-node resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 24(4), pages 413-429, August.
    8. George L. Vairaktarakis, 2003. "The Value of Resource Flexibility in the Resource-Constrained Job Assignment Problem," Management Science, INFORMS, vol. 49(6), pages 718-732, June.
    9. Drexl, Andreas & Nissen, Rudiger & Patterson, James H. & Salewski, Frank, 2000. "ProGen/[pi]x - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions," European Journal of Operational Research, Elsevier, vol. 125(1), pages 59-72, August.
    10. 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.
    11. Kolisch, Rainer, 1994. "Serial and parallel resource-constrained projekt scheduling methodes revisited: Theory and computation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 344, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. Simpson, Wendell P. & Patterson, James H., 1996. "A multiple-tree search procedure for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 89(3), pages 525-542, March.
    13. Luh, Peter B. & Liu, Feng & Moser, Bryan, 1999. "Scheduling of design projects with uncertain number of iterations," European Journal of Operational Research, Elsevier, vol. 113(3), pages 575-592, March.
    14. Tao, Liangyan & Wu, Desheng & Liu, Sifeng & Lambert, James H., 2017. "Schedule risk analysis for new-product development: The GERT method extended by a characteristic function," Reliability Engineering and System Safety, Elsevier, vol. 167(C), pages 464-473.
    15. Kreter, Stefan & Schutt, Andreas & Stuckey, Peter J. & Zimmermann, Jürgen, 2018. "Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 472-486.
    16. Demeulemeester, Erik L. & Herroelen, Willy S. & Elmaghraby, Salah E., 1996. "Optimal procedures for the discrete time/cost trade-off problem in project networks," European Journal of Operational Research, Elsevier, vol. 88(1), pages 50-68, January.
    17. Brucker, Peter & Knust, Sigrid & Schoo, Arno & Thiele, Olaf, 1998. "A branch and bound algorithm for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 107(2), pages 272-288, June.
    18. 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.
    19. Williams, Terry, 1999. "Towards realism in network simulation," Omega, Elsevier, vol. 27(3), pages 305-314, June.
    20. Drexl, Andreas & Kimms, Alf, 1998. "Minimizing total weighted completion times subject to precedence constraints by dynamic programming," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 475, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:eee:jomega:v:24:y:1996:i:1:p:37-46. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.