IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v71y2020i8p1243-1258.html
   My bibliography  Save this article

Solving the resource-constrained multi-project scheduling problem with an improved critical chain method

Author

Listed:
  • Min Tian
  • Ren Jing Liu
  • Guang Jun Zhang

Abstract

In view of the fact that the critical chain method (CCM) is mainly used in single project scheduling, this article improves the method and applies it to multi-project scheduling. Taking into consideration the flow of the drum resource within and among sub-projects, this study proposes methods that can be used to identify the critical chain and buffer settings, based on the concepts of the task chain, sub-project drum resource flow, and multi-project drum resource flow. The improvement of the CCM includes two aspects. First, by analysing the impact of the drum buffer and capacity constrained buffer on the project buffer and feeding buffer, the calculation methods of these buffers are optimised. Second, a risk contribution index is designed for the modification of these buffers, in order to further improve their anti-interference ability. Then, combined with the improved CCM and the different hierarchical scheduling objectives, a critical chain resource-constrained multi-project scheduling model with a hierarchical strategy is proposed as a way of solving multi-project scheduling plans. Eight theoretical test cases with different scales, and a practical example under different risk levels of uncertainty are used to test this model. The results show that the stability of the scheduling plans clearly improved, and the project duration and tardiness costs were significantly reduced, thus proving the effectiveness of the model.

Suggested Citation

  • Min Tian & Ren Jing Liu & Guang Jun Zhang, 2020. "Solving the resource-constrained multi-project scheduling problem with an improved critical chain method," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 71(8), pages 1243-1258, August.
  • Handle: RePEc:taf:tjorxx:v:71:y:2020:i:8:p:1243-1258
    DOI: 10.1080/01605682.2019.1609883
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2019.1609883
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2019.1609883?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yanfen Zhang & Jinyao Ma & Haibin Zhang & Bin Yue, 2023. "Platform Resource Scheduling Method Based on Branch-and-Bound and Genetic Algorithm," Annals of Data Science, Springer, vol. 10(5), pages 1421-1445, October.
    2. Gómez Sánchez, Mariam & Lalla-Ruiz, Eduardo & Fernández Gil, Alejandro & Castro, Carlos & Voß, Stefan, 2023. "Resource-constrained multi-project scheduling problem: A survey," European Journal of Operational Research, Elsevier, vol. 309(3), pages 958-976.

    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:taf:tjorxx:v:71:y:2020:i:8:p:1243-1258. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.