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

A minmax regret approach to the critical path method with task interval times

Author

Listed:
  • Conde, Eduardo

Abstract

The execution of a given project, with a number of interrelated tasks due to precedence constraints, represents a challenge when one must to control the available resources and the compromised due dates. In this paper, we analyse this problem under uncertain individual task completing times, specifically, we will assume that a given range, for the admissible values of each individual completing time, is available. Taking into account that the precedence relations between tasks must be preserved, each realization of the admissible execution times for the set of tasks will define a new scenario determining the ending time for the project and the subset of critical tasks. The minmax regret criterion will be used in order to obtain a robust approximation to the critical set of tasks determining the overall execution time for the project.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:197:y:2009:i:1:p:235-242
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00479-7
    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. 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.
    2. 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.
    3. Zielinski, Pawel, 2004. "The computational complexity of the relative robust shortest path problem with interval data," European Journal of Operational Research, Elsevier, vol. 158(3), pages 570-576, November.
    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. Hazır, Öncü & Ulusoy, Gündüz, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," International Journal of Production Economics, Elsevier, vol. 223(C).
    2. Savic, Aleksandar & Kratica, Jozef & Milanovic, Marija & Dugosija, Djordje, 2010. "A mixed integer linear programming formulation of the maximum betweenness problem," European Journal of Operational Research, Elsevier, vol. 206(3), pages 522-527, November.
    3. Öncü Hazir & Gündüz Ulusoy, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," Post-Print hal-02898162, HAL.
    4. 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. 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.
    2. 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.
    3. 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.
    4. 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.
    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. 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.
    7. Moayyad Al-Fawaeer & Abdul Sattar Al-Ali & Mousa Khaireddin, 2021. "The Impact of Changing the Expected Time and Variance Equations of the Project Activities on The Completion Time and Cost of the Project in PERT Model," International Journal of Business and Economics, School of Management Development, Feng Chia University, Taichung, Taiwan, vol. 20(2), pages 119-140, September.
    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 & Tsai, Ming-Jiun, 2011. "Time-cost trade-off analysis of project networks in fuzzy environments," European Journal of Operational Research, Elsevier, vol. 212(2), pages 386-397, July.
    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. Moayyad Al-Fawaeer & Abdul Sattar Al-Ali & Mousa Khaireddin, 2021. "The Impact of Changing the Expected Time and Variance Equations of the Project Activities on The Completion Time and Cost of the Project in PERT Model," International Journal of Business and Economics, School of Management Development, Feng Chia University, Taichung, Taiwan, vol. 20(2), pages 1-22, September.
    12. 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.
    13. 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.
    14. Luz Stella Cardona-Meza & Gerard Olivar-Tost, 2017. "Modeling and Simulation of Project Management through the PMBOK® Standard Using Complex Networks," Complexity, Hindawi, vol. 2017, pages 1-12, December.
    15. Dorota Kuchta, 2010. "Generalization of the critical chain method supporting the management of projects with a high degree of uncertainty and imperfect information," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 20(2), pages 77-90.
    16. 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.
    17. Carolin Torchiani & Jan Ohst & David Willems & Stefan Ruzika, 2017. "Shortest Paths with Shortest Detours," Journal of Optimization Theory and Applications, Springer, vol. 174(3), pages 858-874, September.
    18. 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.
    19. Nikulin, Yury, 2005. "Solving the robust shortest path problem with interval data using a probabilistic metaheuristic approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 597, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Li He & Qiyan Cao & Fengjun Shang, 2019. "Measuring Component Importance for Network System Using Cellular Automata," Complexity, Hindawi, vol. 2019, pages 1-11, May.

    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:197:y:2009:i:1:p:235-242. 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.