IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v6y2025i1d10.1007_s43069-025-00415-2.html
   My bibliography  Save this article

h-NSDE—A Solution Algorithm for the Multi-objective Resource Leveling Problem

Author

Listed:
  • Marinos Aristotelous

    (University of Patras)

  • Andreas C. Nearchou

    (University of Patras)

Abstract

Consideration is given to the resource leveling problem (RLP) in resource-constrained project scheduling (RCPS). Although RLP has gained an increasing research interest, multiple optimization criteria are rarely considered simultaneously in the literature. In this paper, a multi-objective version of RLP is investigated aiming to simultaneously minimize the resource imbalance, the peak of the resource usage as well as the makespan. A metaheuristic algorithm is presented devoted to the search for Pareto-optimal RLP solutions. This algorithm constitutes an adaptation of h-NSDE (the hybrid non-dominated sorting differential evolution) which has recently shown excellent performance over a particular class of machine scheduling problems. Using existing benchmark data sets, we test the performance of h-NSDE in comparison to three of the most famous in the literature multi-objective population-based metaheuristics namely NSGA-II, SPEA2, and PAES. The results obtained are quite promising demonstrating a clear superiority of h-NSDE in terms of both the solution quality and diversity in regard to Pareto-front.

Suggested Citation

  • Marinos Aristotelous & Andreas C. Nearchou, 2025. "h-NSDE—A Solution Algorithm for the Multi-objective Resource Leveling Problem," SN Operations Research Forum, Springer, vol. 6(1), pages 1-22, March.
    • Handle: RePEc:spr:snopef:v:6:y:2025:i:1:d:10.1007_s43069-025-00415-2
    DOI: 10.1007/s43069-025-00415-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-025-00415-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s43069-025-00415-2?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.

    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:snopef:v:6:y:2025:i:1:d:10.1007_s43069-025-00415-2. 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.