IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v332y2026i2p391-409.html

An evolutionary reinforcement learning framework for joint work package sizing and scheduling with uncertainties

Author

Listed:
  • Zhang, Nianmin
  • Li, Xiao
  • Xu, Zhiwei

Abstract

Work package sizing and scheduling are two core components in project management, often modeled as optimization problems to improve productivity, resource utilization, and risk control. In practice, however, projects face uncertainties such as machine breakdowns and labor absences, making static package structures and fixed schedules inefficient or even infeasible. This highlights the need for adaptive approaches that can dynamically adjust both work package structures and schedules to ensure timely completion and manage resource fluctuations. In this study, we formulate the joint work package sizing and scheduling problem as a Markov Decision Process, explicitly capturing concurrent uncertainties stemming from resource disruptions as well as variability in work content and task durations. To solve it, we propose a novel evolutionary reinforcement learning framework comprising three synergistic modules: (1) a graph-based reinforcement learning algorithm to learn adaptive and generalizable policies, (2) the Cross-Entropy Method to efficiently explore the policy space, and (3) an asynchronous-synchronous mechanism to balance exploration and exploitation. Extensive experiments demonstrate that our method outperforms existing baselines across diverse JWSSP instances, offering a promising solution for real-world, uncertainty-aware project scheduling.

Suggested Citation

  • Zhang, Nianmin & Li, Xiao & Xu, Zhiwei, 2026. "An evolutionary reinforcement learning framework for joint work package sizing and scheduling with uncertainties," European Journal of Operational Research, Elsevier, vol. 332(2), pages 391-409.
  • Handle: RePEc:eee:ejores:v:332:y:2026:i:2:p:391-409
    DOI: 10.1016/j.ejor.2026.01.023
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221726000457
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2026.01.023?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:ejores:v:332:y:2026:i:2:p:391-409. 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: 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.