IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-89920-6_74.html
   My bibliography  Save this book chapter

A CTMDP-Based Exact Method for RCPSP with Uncertain Activity Durations and Rework

In: Operations Research Proceedings 2017

Author

Listed:
  • Xiaoming Wang

    (Guangdong University of Technology
    KU Leuven)

  • Roel Leus

    (KU Leuven)

  • Stefan Creemers

    (IESEG School of Management)

  • Qingxin Chen

    (Guangdong University of Technology)

  • Ning Mao

    (Guangdong University of Technology)

Abstract

Many practical projects incorporate random rework, which leads to a stochastic project network structure. Until now, however, there have been only few works in the literature that have looked into this particular aspect of project planning and scheduling. In this paper, we consider a resource-constrained project scheduling problem (RCPSP) with exponentially distributed activity durations and two types of random rework. A mathematical model is proposed based on a continuous-time Markov decision process (CTMDP) with the objective to minimize the expected project makespan, which is further converted into an equivalent DTMDP with removing the self-transitions. In order to cope with the curse of dimensionality that comes into play upon solving large-scale instances, we examine a decomposition and parallel method that limits the memory usage. In addition, we also analyze the effect of random rework on the expected project makespan and the optimal rework strategy. Finally, a computational experiment is set up to validate the effectiveness of the proposed model and procedures.

Suggested Citation

  • Xiaoming Wang & Roel Leus & Stefan Creemers & Qingxin Chen & Ning Mao, 2018. "A CTMDP-Based Exact Method for RCPSP with Uncertain Activity Durations and Rework," Operations Research Proceedings, in: Natalia Kliewer & Jan Fabian Ehmke & Ralf Borndörfer (ed.), Operations Research Proceedings 2017, pages 559-565, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-89920-6_74
    DOI: 10.1007/978-3-319-89920-6_74
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:oprchp:978-3-319-89920-6_74. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.