IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v145y2003i2p394-402.html
   My bibliography  Save this article

A new structural mechanism for reducibility of stochastic PERT networks

Author

Listed:
  • Fatemi Ghomi, S. M. T.
  • Rabbani, M.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:145:y:2003:i:2:p:394-402
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00155-8
    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. Salah E. Elmaghraby, 1967. "On the Expected Duration of PERT Type Networks," Management Science, INFORMS, vol. 13(5), pages 299-306, January.
    2. 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.
    3. Larry J. Ringer, 1969. "Numerical Operators for Statistical PERT Critical Path Analysis," Management Science, INFORMS, vol. 16(2), pages 136-143, October.
    4. Kamburowski, Jerzy, 1985. "An upper bound on the expected completion time of PERT networks," European Journal of Operational Research, Elsevier, vol. 21(2), pages 206-212, August.
    5. H. O. Hartley & A. W. Wortham, 1966. "A Statistical Theory for PERT Critical Path Analysis," Management Science, INFORMS, vol. 12(10), pages 469-481, June.
    6. 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)

    Citations

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


    Cited by:

    1. Azaron, Amir & Katagiri, Hideki & Sakawa, Masatoshi & Kato, Kosuke & Memariani, Azizollah, 2006. "A multi-objective resource allocation problem in PERT networks," European Journal of Operational Research, Elsevier, vol. 172(3), pages 838-854, August.
    2. Amir Azaron & Hideki Katagiri & Masatoshi Sakawa, 2007. "Time-cost trade-off via optimal control theory in Markov PERT networks," Annals of Operations Research, Springer, vol. 150(1), pages 47-64, March.
    3. Chen, Chen-Tung & Huang, Sue-Fen, 2006. "Order-fulfillment ability analysis in the supply-chain system with fuzzy operation times," International Journal of Production Economics, Elsevier, vol. 101(1), pages 185-193, May.
    4. Mahtab Afsari & Hesam Javadi Vasigh, 2016. "A Mathematical Modeling for Delivery Time in Dynamic PERT Networks," Modern Applied Science, Canadian Center of Science and Education, vol. 10(3), pages 214-214, 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. 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.

    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. 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.
    2. 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.
    3. Yousry Abdelkader, 2010. "Adjustment of the moments of the project completion times when activity times are exponentially distributed," Annals of Operations Research, Springer, vol. 181(1), pages 503-514, December.
    4. 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.
    5. 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.
    6. Lee, Heejung & Suh, Hyo-Won, 2008. "Estimating the duration of stochastic workflow for product development process," International Journal of Production Economics, Elsevier, vol. 111(1), pages 105-117, January.
    7. 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.
    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. Williams, Terry, 1999. "Towards realism in network simulation," Omega, Elsevier, vol. 27(3), pages 305-314, June.
    11. R. Alan Bowman, 2003. "Sensitivity curves for effective project management," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(5), pages 481-497, August.
    12. Vanhoucke, Mario, 2010. "Using activity sensitivity and network topology information to monitor project time performance," Omega, Elsevier, vol. 38(5), pages 359-370, October.
    13. Elmaghraby, Salah E., 2000. "On criticality and sensitivity in activity networks," European Journal of Operational Research, Elsevier, vol. 127(2), pages 220-238, December.
    14. Williams, Terry, 1995. "A classified bibliography of recent research relating to project risk management," European Journal of Operational Research, Elsevier, vol. 85(1), pages 18-38, August.
    15. Fernando Acebes & Javier Pajares & Jose M Gonzalez-Varona & Adolfo Lopez-Paredes, 2024. "Project Risk Management from the bottom-up: Activity Risk Index," Papers 2406.00078, arXiv.org.
    16. 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.
    17. Azaron, Amir & Katagiri, Hideki & Sakawa, Masatoshi & Kato, Kosuke & Memariani, Azizollah, 2006. "A multi-objective resource allocation problem in PERT networks," European Journal of Operational Research, Elsevier, vol. 172(3), pages 838-854, August.
    18. 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.
    19. Fernando Acebes & Javier Pajares & José M. González-Varona & Adolfo López-Paredes, 2021. "Project risk management from the bottom-up: Activity Risk Index," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1375-1396, December.
    20. Fatemi Ghomi, S. M. T. & Teimouri, E., 2002. "Path critical index and activity critical index in PERT networks," European Journal of Operational Research, Elsevier, vol. 141(1), pages 147-152, August.

    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:eee:ejores:v:145:y:2003:i:2:p:394-402. 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/locate/eor .

    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.