IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i16p5631-5653.html
   My bibliography  Save this article

A surrogate-assisted dual-tree genetic programming framework for dynamic resource constrained multi-project scheduling problem

Author

Listed:
  • HaoJie Chen
  • XinYu Li
  • Liang Gao

Abstract

Genetic programming has achieved great success in project scheduling by generating Priority Rules (PRs) through evolution. However, the frequent disturbance factors in practice not only lead to the appropriate PR changes in different states, but also increase the calculation consumption in evaluation. In this paper, a novel Hyper-heuristic-based Surrogate-Assisted Dual-Tree Genetic Programming (HSDGP) framework is proposed for the Dynamic Resource Constrained Multi-Project Scheduling Problem with new project Insertions and resource Disruptions (DRCMPSP-ID). Uniquely, the proposed method automatically evolves two PRs for scheduling DRCMPSP-ID under normal and disruptive states respectively, and an expansion search mechanism based on neighbourhood is designed to improve PR generation ability by generating a large number of offspring and implement the search of dual-tree encoding. Furthermore, in order to estimate the fitness of new individuals, an activity-sequence based surrogate is proposed to deal with the input of activity sequence during schedule generation and reduce the evaluation calculation consumption. Based on the instances constructed by the existing benchmark, the experimental result shows the superiority of HSDGP and the impact of key parameters on its performance.

Suggested Citation

  • HaoJie Chen & XinYu Li & Liang Gao, 2024. "A surrogate-assisted dual-tree genetic programming framework for dynamic resource constrained multi-project scheduling problem," International Journal of Production Research, Taylor & Francis Journals, vol. 62(16), pages 5631-5653, August.
  • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:16:p:5631-5653
    DOI: 10.1080/00207543.2023.2294109
    as

    Download full text from publisher

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

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

    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:tprsxx:v:62:y:2024:i:16:p:5631-5653. 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/TPRS20 .

    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.