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

The computational complexity of the criticality problems in a network with interval activity times

Author

Listed:
  • Chanas, Stefan
  • Zielinski, Pawel

Abstract

No abstract is available for this item.

Suggested Citation

  • Chanas, Stefan & Zielinski, Pawel, 2002. "The computational complexity of the criticality problems in a network with interval activity times," European Journal of Operational Research, Elsevier, vol. 136(3), pages 541-550, February.
    • Handle: RePEc:eee:ejores:v:136:y:2002:i:3:p:541-550
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(01)00048-0
    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. Elmaghraby, Salah E., 2000. "On criticality and sensitivity in activity networks," European Journal of Operational Research, Elsevier, vol. 127(2), pages 220-238, December.
    2. 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.
    3. James E. Kelley, 1961. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, INFORMS, vol. 9(3), pages 296-320, June.
    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. Yakhchali, Siamak Haji & Ghodsypour, Seyed Hassan, 2010. "Computing latest starting times of activities in interval-valued networks with minimal time lags," European Journal of Operational Research, Elsevier, vol. 200(3), pages 874-880, February.
    2. Li He & Qiyan Cao & Fengjun Shang, 2019. "Measuring Component Importance for Network System Using Cellular Automata," Complexity, Hindawi, vol. 2019, pages 1-11, May.
    3. Carlo Meloni & Marco Pranzo, 2020. "Expected shortfall for the makespan in activity networks under imperfect information," Flexible Services and Manufacturing Journal, Springer, vol. 32(3), pages 668-692, September.
    4. Kasperski, Adam & Zielinski, Pawel, 2010. "Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights," European Journal of Operational Research, Elsevier, vol. 200(3), pages 680-687, February.
    5. 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.
    6. 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.
    7. Mukesh Kumar Mehlawat & Nishtha Grover, 2018. "Intuitionistic fuzzy multi-criteria group decision making with an application to critical path selection," Annals of Operations Research, Springer, vol. 269(1), pages 505-520, October.
    8. Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2022. "Evaluation of VaR and CVaR for the makespan in interval valued blocking job shops," International Journal of Production Economics, Elsevier, vol. 247(C).
    9. Chen, Shih-Pin, 2007. "Analysis of critical paths in a project network with fuzzy activity times," European Journal of Operational Research, Elsevier, vol. 183(1), pages 442-459, November.
    10. Kasperski, Adam & Zielinski, Pawel, 2007. "On combinatorial optimization problems on matroids with uncertain weights," European Journal of Operational Research, Elsevier, vol. 177(2), pages 851-864, March.
    11. Conde, Eduardo, 2009. "A minmax regret approach to the critical path method with task interval times," European Journal of Operational Research, Elsevier, vol. 197(1), pages 235-242, August.
    12. 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.
    13. Conde, Eduardo, 2012. "On a constant factor approximation for minmax regret problems using a symmetry point scenario," European Journal of Operational Research, Elsevier, vol. 219(2), pages 452-457.

    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. 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.
    2. Abdelkader, Yousry H., 2004. "Evaluating project completion times when activity times are Weibull distributed," European Journal of Operational Research, Elsevier, vol. 157(3), pages 704-715, September.
    3. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    4. Richard E. Wendell & Timothy J. Lowe & Mike M. Gordon, 2023. "Dangers in using earned duration and other earned value metrics to measure a project’s schedule performance," 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. 31(2), pages 665-680, June.
    5. Mehrnoosh Zohrehvandi & Shakib Zohrehvandi & Mohammad Khalilzadeh & Maghsoud Amiri & Fariborz Jolai & Edmundas Kazimieras Zavadskas & Jurgita Antucheviciene, 2024. "A Multi-Objective Mathematical Programming Model for Project-Scheduling Optimization Considering Customer Satisfaction in Construction Projects," Mathematics, MDPI, vol. 12(2), pages 1-16, January.
    6. 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.
    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. A B Hafızoğlu & M Azizoğlu, 2010. "Linear programming based approaches for the discrete time/cost trade-off problem in project networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 676-685, April.
    9. Herroelen, Willy & Leus, Roel, 2004. "The construction of stable project baseline schedules," European Journal of Operational Research, Elsevier, vol. 156(3), pages 550-565, August.
    10. Geng, Zhichao & Yuan, Jinjiang, 2023. "Single-machine scheduling of multiple projects with controllable processing times," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1074-1090.
    11. Williams, Terry, 1999. "Towards realism in network simulation," Omega, Elsevier, vol. 27(3), pages 305-314, June.
    12. Zhen Song & Håkan Schunnesson & Mikael Rinne & John Sturgul, 2015. "An Approach to Realizing Process Control for Underground Mining Operations of Mobile Machines," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-17, June.
    13. Vaseghi, Forough & Martens, Annelies & Vanhoucke, Mario, 2024. "Analysis of the impact of corrective actions for stochastic project networks," European Journal of Operational Research, Elsevier, vol. 316(2), pages 503-518.
    14. Bowman, R. Alan, 2006. "Developing activity duration specification limits for effective project control," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1191-1204, October.
    15. Manuel A. Alba Martínez & Jean-François Cordeau & Mauro Dell'Amico & Manuel Iori, 2013. "A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 41-55, February.
    16. Abdelkader, Yousry H., 2011. "A Laplace transform method for order statistics from nonidentical random variables and its application in Phase-type distribution," Statistics & Probability Letters, Elsevier, vol. 81(8), pages 1143-1149, August.
    17. Trietsch, Dan & Mazmanyan, Lilit & Gevorgyan, Lilit & Baker, Kenneth R., 2012. "Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation," European Journal of Operational Research, Elsevier, vol. 216(2), pages 386-396.
    18. Wauters, Mathieu & Vanhoucke, Mario, 2017. "A Nearest Neighbour extension to project duration forecasting with Artificial Intelligence," European Journal of Operational Research, Elsevier, vol. 259(3), pages 1097-1111.
    19. 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.
    20. Chen, Yen-Liang & Rinks, Dan & Tang, Kwei, 1997. "Critical path in an activity network with time constraints," European Journal of Operational Research, Elsevier, vol. 100(1), pages 122-133, July.

    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:136:y:2002:i:3:p:541-550. 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.