IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v274y2019i1d10.1007_s10479-018-2899-7.html
   My bibliography  Save this article

Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem

Author

Listed:
  • Morteza Davari

    (KU Leuven KULAK
    KU Leuven)

  • Erik Demeulemeester

    (KU Leuven)

Abstract

The proactive and reactive resource-constrained project scheduling problem (PR-RCPSP), that has been introduced recently (Davari and Demeulemeester, 2017), deals with activity duration uncertainty in a very unique way. The optimal solution to an instance of the PR-RCPSP is a proactive and reactive policy (PR-policy) that is a combination of a baseline schedule and a set of required transitions (reactions). In this research, we introduce two interesting classes of reactions, namely the class of selection-based reactions and the class of buffer-based reactions, the latter in fact being a subset of the class of selection-based reactions. We also discuss the theoretical relevance of these two classes of reactions. We run some computational results and report the contributions of the selection-based reactions and the buffer-based reactions in the optimal solution. The results suggest that although both selection-based reactions and buffer-based reactions contribute largely in the construction of the optimal PR-policy, the contribution of the buffer-based reactions is of much greater importance. These results also indicate that the contributions of non-selection-based reactions (reactions that are not selection-based) and selection-but-not-buffer-based reactions (selection-based reactions that are not buffer-based) are very limited.

Suggested Citation

  • Morteza Davari & Erik Demeulemeester, 2019. "Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem," Annals of Operations Research, Springer, vol. 274(1), pages 187-210, March.
    • Handle: RePEc:spr:annopr:v:274:y:2019:i:1:d:10.1007_s10479-018-2899-7
    DOI: 10.1007/s10479-018-2899-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-018-2899-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-018-2899-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Stefan Creemers, 2015. "Minimizing the expected makespan of a project with stochastic activity durations under resource constraints," Working Papers of Department of Decision Sciences and Information Management, Leuven 488396, KU Leuven, Faculty of Economics and Business (FEB), Department of Decision Sciences and Information Management, Leuven.
    2. Van de Vonder, Stijn & Demeulemeester, Erik & Herroelen, Willy, 2008. "Proactive heuristic procedures for robust project scheduling: An experimental analysis," European Journal of Operational Research, Elsevier, vol. 189(3), pages 723-733, September.
    3. 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.
    4. Stefan Creemers, 2015. "Minimizing the expected makespan of a project with stochastic activity durations under resource constraints," Post-Print hal-02992649, HAL.
    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. Hongbo Li & Linwen Zheng & Hanyu Zhu, 2023. "Resource leveling in projects with flexible structures," Annals of Operations Research, Springer, vol. 321(1), pages 311-342, February.
    2. Zuo, Fei & Zio, Enrico & Xu, Yue, 2023. "Bi-objective optimization of the scheduling of risk-related resources for risk response," Reliability Engineering and System Safety, Elsevier, vol. 237(C).
    3. Farnaz Torabi Yeganeh & Seyed Hessameddin Zegordi, 2020. "A multi-objective optimization approach to project scheduling with resiliency criteria under uncertain activity duration," Annals of Operations Research, Springer, vol. 285(1), pages 161-196, February.
    4. Cohen, Izack & Postek, Krzysztof & Shtern, Shimrit, 2023. "An adaptive robust optimization model for parallel machine scheduling," European Journal of Operational Research, Elsevier, vol. 306(1), pages 83-104.
    5. Nesbitt, Peter & Blake, Lewis R. & Lamas, Patricio & Goycoolea, Marcos & Pagnoncelli, Bernardo K. & Newman, Alexandra & Brickey, Andrea, 2021. "Underground mine scheduling under uncertainty," European Journal of Operational Research, Elsevier, vol. 294(1), pages 340-352.
    6. Portoleau, Tom & Artigues, Christian & Guillaume, Romain, 2024. "Robust decision trees for the multi-mode project scheduling problem with a resource investment objective and uncertain activity duration," European Journal of Operational Research, Elsevier, vol. 312(2), pages 525-540.
    7. Saad Muslet Albogami & Mohd Khairol Anuar Bin Mohd Ariffin & Eris Elianddy Bin Supeni & Kamarul Arifin Ahmad, 2021. "A New Hybrid AHP and Dempster—Shafer Theory of Evidence Method for Project Risk Assessment Problem," Mathematics, MDPI, vol. 9(24), pages 1-30, December.
    8. Balouka, Noemie & Cohen, Izack, 2021. "A robust optimization approach for the multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 291(2), pages 457-470.

    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. Salim Rostami & Stefan Creemers & Roel Leus, 2018. "New strategies for stochastic resource-constrained project scheduling," Journal of Scheduling, Springer, vol. 21(3), pages 349-365, June.
    2. Morteza Davari & Erik Demeulemeester, 2019. "The proactive and reactive resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 22(2), pages 211-237, April.
    3. Balouka, Noemie & Cohen, Izack, 2021. "A robust optimization approach for the multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 291(2), pages 457-470.
    4. Alessio Angius & András Horváth & Marcello Urgo, 2021. "A Kronecker Algebra Formulation for Markov Activity Networks with Phase-Type Distributions," Mathematics, MDPI, vol. 9(12), pages 1-22, June.
    5. Stefan Creemers, 2019. "The preemptive stochastic resource-constrained project scheduling problem," Post-Print hal-02992618, HAL.
    6. Ö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.
    7. Szmerekovsky, Joseph G. & Venkateshan, Prahalad & Simonson, Peter D., 2023. "Project scheduling under the threat of catastrophic disruption," European Journal of Operational Research, Elsevier, vol. 309(2), pages 784-794.
    8. Ripon K. Chakrabortty & Ruhul A. Sarker & Daryl L. Essam, 2020. "Single mode resource constrained project scheduling with unreliable resources," Operational Research, Springer, vol. 20(3), pages 1369-1403, September.
    9. Brčić, Mario & Katić, Marija & Hlupić, Nikica, 2019. "Planning horizons based proactive rescheduling for stochastic resource-constrained project scheduling problems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 58-66.
    10. 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).
    11. Bruni, M.E. & Di Puglia Pugliese, L. & Beraldi, P. & Guerriero, F., 2017. "An adjustable robust optimization model for the resource-constrained project scheduling problem with uncertain activity durations," Omega, Elsevier, vol. 71(C), pages 66-84.
    12. 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.
    13. Servranckx, Tom & Vanhoucke, Mario, 2019. "Strategies for project scheduling with alternative subgraphs under uncertainty: similar and dissimilar sets of schedules," European Journal of Operational Research, Elsevier, vol. 279(1), pages 38-53.
    14. Deng, Qichen & Santos, Bruno F., 2022. "Lookahead approximate dynamic programming for stochastic aircraft maintenance check scheduling optimization," European Journal of Operational Research, Elsevier, vol. 299(3), pages 814-833.
    15. Zhalechian, M. & Tavakkoli-Moghaddam, R. & Zahiri, B. & Mohammadi, M., 2016. "Sustainable design of a closed-loop location-routing-inventory supply chain network under mixed uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 182-214.
    16. Marlin W. Ulmer, 2020. "Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing," 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. 28(1), pages 279-308, March.
    17. Zhu, Xia & Ruiz, Rubén & Li, Shiyu & Li, Xiaoping, 2017. "An effective heuristic for project scheduling with resource availability cost," European Journal of Operational Research, Elsevier, vol. 257(3), pages 746-762.
    18. Qian Li & Sha Tao & Heap-Yih Chong & Zhijie Sasha Dong, 2018. "Robust Optimization for Integrated Construction Scheduling and Multiscale Resource Allocation," Complexity, Hindawi, vol. 2018, pages 1-17, July.
    19. Ya Xu & Qiushuang Chen & Xiongwen Quan, 2012. "Robust berth scheduling with uncertain vessel delay and handling time," Annals of Operations Research, Springer, vol. 192(1), pages 123-140, January.
    20. Deblaere, Filip & Demeulemeester, Erik & Herroelen, Willy, 2011. "Proactive policies for the stochastic resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 214(2), pages 308-316, October.

    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:spr:annopr:v:274:y:2019:i:1:d:10.1007_s10479-018-2899-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.