IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-981-97-1949-5_51.html
   My bibliography  Save this book chapter

A Reinforcement Learning Framework for Maximizing the Net Present Value of Stochastic Multi-work Packages Project Scheduling Problem

In: Proceedings of the 28th International Symposium on Advancement of Construction Management and Real Estate

Author

Listed:
  • Yaning Zhang

    (The Hong Kong Polytechnic University
    Northwestern Polytechnical University)

  • Xiao Li

    (The University of Hong Kong)

  • Yue Teng

    (The Hong Kong Polytechnic University)

  • Qiping Shen

    (The Hong Kong Polytechnic University)

  • Sijun Bai

    (Northwestern Polytechnical University)

Abstract

Project scheduling to maximize net present value (NPV) poses a significant challenge due to the inherent complexities associated with large-scale projects comprising multiple work packages and uncertain task durations. Existing scheduling methods encounter difficulties in effectively maximizing NPV when confronted with multi-work package projects characterized by stochastic task duration distributions. In light of this problem, this paper proposes a three-level reinforcement learning (TRL) framework aimed at addressing these challenges. To determine resource allocation for each work package within the project, the TRL framework leverages human empirical decision-making at the resource assignment level. At the work package level, a Priority Experience Replay Dueling Double Deep Q-Network (PER-DDDQN) is trained. This PER-DDDQN incorporates a graph embedding method, enabling it to maximize the expected NPV for each work package. The graph embedding method facilitates the determination of the work package's scheduling state, while the PER-DDDQN governs the scheduling of task start times within the work package. Furthermore, at the project level, work packages are scheduled using the same principles employed at the work package level to maximize the expected NPV of the entire project. Numerical experiments conducted on adapted case projects provide evidence that the TRL framework surpasses existing heuristics in achieving higher NPV for most work packages. Moreover, the TRL framework yields a minimum improvement of 26.68% in the maximum expected NPV of the entire project compared to the heuristic method employed in this study. This research contributes significantly to the enhancement of cash flow management in large-scale projects characterized by multiple work packages. Additionally, it opens up possibilities for the integration of reinforcement learning technology within the field of construction project management.

Suggested Citation

  • Yaning Zhang & Xiao Li & Yue Teng & Qiping Shen & Sijun Bai, 2024. "A Reinforcement Learning Framework for Maximizing the Net Present Value of Stochastic Multi-work Packages Project Scheduling Problem," Lecture Notes in Operations Research, in: Dezhi Li & Patrick X. W. Zou & Jingfeng Yuan & Qian Wang & Yi Peng (ed.), Proceedings of the 28th International Symposium on Advancement of Construction Management and Real Estate, chapter 0, pages 733-756, Springer.
    • Handle: RePEc:spr:lnopch:978-981-97-1949-5_51
    DOI: 10.1007/978-981-97-1949-5_51
    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:lnopch:978-981-97-1949-5_51. 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.