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

The preemptive stochastic resource-constrained project scheduling problem

Author

Listed:
  • Creemers, Stefan

Abstract

Preemption (or the splitting of activities) is a common practice in many project environments, and has been a standard feature of commercial project management software packages for years. Despite its prevalence in daily practice, preemption has received little attention in the project scheduling literature. A possible explanation for this lack of research interest is the common assumption that preemption only has a limited impact on the optimal makespan of a project. In this article, however, we show that the benefit of preemption can be significant, and that it increases with the size and the complexity of the project network. In addition, we also investigate how activity duration variability impacts the benefits of preemption. To this end, we study the preemptive stochastic resource-constrained project scheduling problem (PSRCPSP), and present an exact solution procedure. Even though the deterministic preemptive resource-constrained project scheduling problem (PRCPSP) has received some attention in the literature, we are the first to study the PSRCPSP. We use hypoexponential distributions to model the activity durations, and define a new continuous-time Markov chain (CTMC) that drastically reduces memory requirements when compared to the well-known CTMC of Kulkarni and Adlakha (1986) (Operations Research, 34(5), 769–781). In addition, we also propose a new and efficient approach to structure the state space of the CTMC.

Suggested Citation

  • Creemers, Stefan, 2019. "The preemptive stochastic resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 238-247.
    • Handle: RePEc:eee:ejores:v:277:y:2019:i:1:p:238-247
    DOI: 10.1016/j.ejor.2019.02.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171930178X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.02.030?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. Moukrim, Aziz & Quilliot, Alain & Toussaint, Hélène, 2015. "An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration," European Journal of Operational Research, Elsevier, vol. 244(2), pages 360-368.
    2. Demeulemeester, Erik L. & Herroelen, Willy S., 1996. "An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 90(2), pages 334-348, April.
    3. Eli Gutin & Daniel Kuhn & Wolfram Wiesemann, 2015. "Interdiction Games on Markovian PERT Networks," Management Science, INFORMS, vol. 61(5), pages 999-1017, May.
    4. Brucker, Peter & Knust, Sigrid, 2003. "Lower bounds for resource-constrained project scheduling problems," European Journal of Operational Research, Elsevier, vol. 149(2), pages 302-313, September.
    5. Xiaoqiang Cai & Xianyi Wu & Xian Zhou, 2009. "Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information," Operations Research, INFORMS, vol. 57(5), pages 1236-1249, October.
    6. 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.
    7. Creemers, Stefan & De Reyck, Bert & Leus, Roel, 2015. "Project planning with alternative technologies in uncertain environments," European Journal of Operational Research, Elsevier, vol. 242(2), pages 465-476.
    8. Sprecher, Arno & Kolisch, Rainer & Drexl, Andreas, 1995. "Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 94-102, January.
    9. Sobel, Matthew J. & Szmerekovsky, Joseph G. & Tilson, Vera, 2009. "Scheduling projects with stochastic activity duration to maximize expected net present value," European Journal of Operational Research, Elsevier, vol. 198(3), pages 697-705, November.
    10. Arnold H. Buss & Meir J. Rosenblatt, 1997. "Activity Delay in Stochastic Project Networks," Operations Research, INFORMS, vol. 45(1), pages 126-139, February.
    11. S. Creemers & R. Leus & M. Lambrecht, 2010. "Scheduling Markovian PERT networks to maximize the net present value," Post-Print hal-00800198, HAL.
    12. Erik L. Demeulemeester & Willy S. Herroelen, 1997. "New Benchmark Results for the Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 43(11), pages 1485-1492, November.
    13. Damay, Jean & Quilliot, Alain & Sanlaville, Eric, 2007. "Linear programming based algorithms for preemptive and non-preemptive RCPSP," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1012-1022, November.
    14. Christoph Schwindt & Tobias Paetz, 2015. "Continuous Preemption Problems," International Handbooks on Information Systems, in: Christoph Schwindt & Jürgen Zimmermann (ed.), Handbook on Project Management and Scheduling Vol.1, edition 127, chapter 0, pages 251-295, Springer.
    15. Stefan Creemers & Bert De Reyck & Roel Leus, 2015. "Project planning with alternative technologies in uncertain environments," Post-Print hal-01563008, HAL.
    16. V. G. Kulkarni & V. G. Adlakha, 1986. "Markov and Markov-Regenerative pert Networks," Operations Research, INFORMS, vol. 34(5), pages 769-781, October.
    17. Kolisch, Rainer & Sprecher, Arno, 1996. "PSPLIB - a project scheduling problem library," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 396, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. 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.
    19. Stefan Creemers, 2015. "Minimizing the expected makespan of a project with stochastic activity durations under resource constraints," Post-Print hal-02992649, HAL.
    20. James H. Patterson, 1984. "A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem," Management Science, INFORMS, vol. 30(7), pages 854-867, July.
    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. Peymankar, Mahboobeh & Davari, Morteza & Ranjbar, Mohammad, 2021. "Maximizing the expected net present value in a project with uncertain cash flows," European Journal of Operational Research, Elsevier, vol. 294(2), pages 442-452.
    2. Aditya Vedantam & Ananth Iyer, 2021. "Capacity Investment under Bayesian Information Updates at Reporting Periods: Model and Application," Production and Operations Management, Production and Operations Management Society, vol. 30(8), pages 2707-2725, August.
    3. 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.
    4. Sha, Yue & Zhang, Junlong & Cao, Hui, 2021. "Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties," European Journal of Operational Research, Elsevier, vol. 290(3), pages 886-900.
    5. Thul, Lawrence & Powell, Warren, 2023. "Stochastic optimization for vaccine and testing kit allocation for the COVID-19 pandemic," European Journal of Operational Research, Elsevier, vol. 304(1), pages 325-338.
    6. Masoud Arjmand & Amir Abbas Najafi & Majid Ebrahimzadeh, 2020. "Evolutionary algorithms for multi-objective stochastic resource availability cost problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(3), pages 935-985, September.

    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. Stefan Creemers, 2019. "The preemptive stochastic resource-constrained project scheduling problem," Post-Print hal-02992618, HAL.
    2. 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).
    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. Creemers, Stefan, 2018. "Maximizing the expected net present value of a project with phase-type distributed activity durations: An efficient globally optimal solution procedure," European Journal of Operational Research, Elsevier, vol. 267(1), pages 16-22.
    5. 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.
    6. Hermans, Ben & Leus, Roel & Looy, Bart Van, 2023. "Deciding on scheduling, secrecy, and patenting during the new product development process: The relevance of project planning models," Omega, Elsevier, vol. 116(C).
    7. 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.
    8. 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.
    9. Creemers, Stefan & De Reyck, Bert & Leus, Roel, 2015. "Project planning with alternative technologies in uncertain environments," European Journal of Operational Research, Elsevier, vol. 242(2), pages 465-476.
    10. 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.
    11. Eli Gutin & Daniel Kuhn & Wolfram Wiesemann, 2015. "Interdiction Games on Markovian PERT Networks," Management Science, INFORMS, vol. 61(5), pages 999-1017, May.
    12. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    13. Abdollah Arasteh, 2020. "Considering Project Management Activities for Engineering Design Groups," SN Operations Research Forum, Springer, vol. 1(4), pages 1-29, December.
    14. Creemers, Stefan, 2018. "Moments and distribution of the net present value of a serial project," European Journal of Operational Research, Elsevier, vol. 267(3), pages 835-848.
    15. 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.
    16. Rostami, Salim & Creemers, Stefan & Leus, Roel, 2024. "Maximizing the net present value of a project under uncertainty: Activity delays and dynamic policies," European Journal of Operational Research, Elsevier, vol. 317(1), pages 16-24.
    17. 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.
    18. Sönke Hartmann, 1998. "A competitive genetic algorithm for resource‐constrained project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(7), pages 733-750, October.
    19. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    20. Sprecher, Arno, 1999. "Network decomposition techniques for resource-constrained project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 505, 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:ejores:v:277:y:2019:i:1:p:238-247. 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.