IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v5y2024i1d10.1007_s43069-023-00283-8.html
   My bibliography  Save this article

An Empirical Analysis of a Set of Hybrid Heuristics for the Solution of the Resource Leveling Problem

Author

Listed:
  • Marinos Aristotelous

    (University of Patras)

  • Andreas C. Nearchou

    (University of Patras)

Abstract

Consideration is given to the heuristic solution of the resource leveling problem (RLP) in project scheduling with limited resources. The objective is to minimize the changes in the level of resource usage from period to period over the planning horizon of the project while keeping the project duration fixed. First, we present two novel greedy schedule algorithms for the RLP solution. The performance of the proposed algorithms is investigated as low-level hybrids in the context of three famous population-based heuristics, namely differential evolution (DE), genetic algorithm (GA), and particle swarm optimization (PSO). Then, we additionally present two new high-level hybridization schemes (HS), referred to herein as parallel and serial HS, respectively, which combine DE, GA, and PSO in a single hybrid solution algorithm. Detailed experimentation over known complex datasets measures the efficiency of the new hybrids. Statistical analysis employed rank the hybrids according to their solution efficiency. Moreover, comparisons between the developed best hybrid and commercial project management software show a substantial higher performance for the former over real-world construction projects.

Suggested Citation

  • Marinos Aristotelous & Andreas C. Nearchou, 2024. "An Empirical Analysis of a Set of Hybrid Heuristics for the Solution of the Resource Leveling Problem," SN Operations Research Forum, Springer, vol. 5(1), pages 1-29, March.
  • Handle: RePEc:spr:snopef:v:5:y:2024:i:1:d:10.1007_s43069-023-00283-8
    DOI: 10.1007/s43069-023-00283-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-023-00283-8
    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-023-00283-8?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.

    References listed on IDEAS

    as
    1. A. Alan B. Pritsker & Lawrence J. Waiters & Philip M. Wolfe, 1969. "Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach," Management Science, INFORMS, vol. 16(1), pages 93-108, September.
    2. Hartmann, Sonke & Kolisch, Rainer, 2000. "Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 127(2), pages 394-407, December.
    3. M Ranjbar, 2013. "A path-relinking metaheuristic for the resource levelling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(7), pages 1071-1078, July.
    4. Neumann, K. & Zimmermann, J., 1999. "Resource levelling for projects with schedule-dependent time windows," European Journal of Operational Research, Elsevier, vol. 117(3), pages 591-605, September.
    5. Hongbo Li & Li Xiong & Yinbin Liu & Haitao Li, 2018. "An effective genetic algorithm for the resource levelling problem with generalised precedence relations," International Journal of Production Research, Taylor & Francis Journals, vol. 56(5), pages 2054-2075, March.
    6. Wael Korani & Malek Mouhoub, 2021. "Review on Nature-Inspired Algorithms," SN Operations Research Forum, Springer, vol. 2(3), pages 1-26, September.
    7. Atan, Tankut & Eren, Elif, 2018. "Optimal project duration for resource leveling," European Journal of Operational Research, Elsevier, vol. 266(2), pages 508-520.
    8. Hongbo Li & Erik Demeulemeester, 2016. "A genetic algorithm for the robust resource leveling problem," Journal of Scheduling, Springer, vol. 19(1), pages 43-60, February.
    9. Hartmann, Sönke & Kolisch, R., 2000. "Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 11180, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    10. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    11. Konstantinos Anagnostopoulos & Georgios Koulinas, 2010. "A simulated annealing hyperheuristic for construction resource levelling," Construction Management and Economics, Taylor & Francis Journals, vol. 28(2), pages 163-175.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. Hartmann, Sönke & Briskorn, Dirk, 2022. "An updated survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 1-14.
    3. Maryam Sadeghloo & Saeed Emami & Ali Divsalar, 2024. "A Benders decomposition algorithm for the multi-mode resource-constrained multi-project scheduling problem with uncertainty," Annals of Operations Research, Springer, vol. 339(3), pages 1637-1677, August.
    4. Cédric Verbeeck & Vincent Peteghem & Mario Vanhoucke & Pieter Vansteenwegen & El-Houssaine Aghezzaf, 2017. "A metaheuristic solution approach for the time-constrained project scheduling problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 353-371, March.
    5. Vega-Velázquez, Miguel Ángel & García-Nájera, Abel & Cervantes, Humberto, 2018. "A survey on the Software Project Scheduling Problem," International Journal of Production Economics, Elsevier, vol. 202(C), pages 145-161.
    6. Hongbo Li & Linwen Zheng & Hanyu Zhu, 2023. "Resource leveling in projects with flexible structures," Annals of Operations Research, Springer, vol. 321(1), pages 311-342, February.
    7. Pascale Bendotti & Luca Brunod Indrigo & Philippe Chrétienne & Bruno Escoffier, 2024. "Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems," Journal of Scheduling, Springer, vol. 27(6), pages 587-606, December.
    8. Grzegorz Waligóra, 2016. "Comparative Analysis of Some Metaheuristics for Discrete-Continuous Project Scheduling with Activities of Identical Processing Rates," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-32, June.
    9. Rahman Torba & Stéphane Dauzère-Pérès & Claude Yugma & Cédric Gallais & Juliette Pouzet, 2024. "Solving a real-life multi-skill resource-constrained multi-project scheduling problem," Annals of Operations Research, Springer, vol. 338(1), pages 69-114, July.
    10. Luise-Sophie Hoffmann & Carolin Kellenbrink & Stefan Helber, 2020. "Simultaneous structuring and scheduling of multiple projects with flexible project structures," Journal of Business Economics, Springer, vol. 90(5), pages 679-711, June.
    11. Song, Jie & Song, Jinbo & Vanhoucke, Mario, 2025. "Automatic selection of the best performing control point approach for project control with resource constraints," European Journal of Operational Research, Elsevier, vol. 322(1), pages 15-38.
    12. Servranckx, Tom & Vanhoucke, Mario, 2019. "A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs," European Journal of Operational Research, Elsevier, vol. 273(3), pages 841-860.
    13. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    14. Kolisch, Rainer & Hartmann, Sonke, 2006. "Experimental investigation of heuristics for resource-constrained project scheduling: An update," European Journal of Operational Research, Elsevier, vol. 174(1), pages 23-37, October.
    15. Lena Sophie Wohlert & Jürgen Zimmermann, 2024. "Resource overload problems with tardiness penalty: structural properties and solution approaches," Annals of Operations Research, Springer, vol. 338(1), pages 151-172, July.
    16. Ramírez Palencia, Alberto E. & Mejía Delgadillo, Gonzalo E., 2012. "A computer application for a bus body assembly line using Genetic Algorithms," International Journal of Production Economics, Elsevier, vol. 140(1), pages 431-438.
    17. André Schnabel & Carolin Kellenbrink & Stefan Helber, 2018. "Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints," Business Research, Springer;German Academic Association for Business Research, vol. 11(2), pages 329-356, September.
    18. Song, Jie & Martens, Annelies & Vanhoucke, Mario, 2021. "Using Schedule Risk Analysis with resource constraints for project control," European Journal of Operational Research, Elsevier, vol. 288(3), pages 736-752.
    19. Browning, Tyson R. & Yassine, Ali A., 2010. "Resource-constrained multi-project scheduling: Priority rule performance revisited," International Journal of Production Economics, Elsevier, vol. 126(2), pages 212-228, August.
    20. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.

    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:5:y:2024:i:1:d:10.1007_s43069-023-00283-8. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.