IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v316y2024i3p815-827.html
   My bibliography  Save this article

A genetic algorithm for the Resource-Constrained Project Scheduling Problem with Alternative Subgraphs using a boolean satisfiability solver

Author

Listed:
  • Servranckx, Tom
  • Coelho, José
  • Vanhoucke, Mario

Abstract

This study evaluates a new solution approach for the Resource-Constrained Project Scheduling with Alternative Subgraphs (RCPSP-AS) in case that complex relations (i.e. nested and linked alternatives) are considered. In the RCPSP-AS, the project activity structure is extended with alternative activity sequences. This implies that only a subset of all activities should be scheduled, which corresponds with a set of activities in the project network that model an alternative execution mode for a work package. Since only the selected activities should be scheduled, the RCPSP-AS comes down to a traditional RCPSP problem when the selection subproblem is solved. It is known that the RCPSP and, hence, its extension to the RCPSP-AS is NP-hard. Since similar scheduling and selection subproblems have already been successfully solved by satisfiability (SAT) solvers in the existing literature, we aim to test the performance of a GA-SAT approach that is derived from the literature and adjusted to be able to deal with the problem-specific constraints of the RCPSP-AS. Computational results on small- and large-scale instances (both artificial and empirical) show that the algorithm can compete with existing metaheuristic algorithms from the literature. Also, the performance is compared with an exact mathematical solver and learning behaviour is observed and analysed. This research again validates the broad applicability of SAT solvers as well as the need to search for better and more suited algorithms for the RCPSP-AS and its extensions.

Suggested Citation

  • Servranckx, Tom & Coelho, José & Vanhoucke, Mario, 2024. "A genetic algorithm for the Resource-Constrained Project Scheduling Problem with Alternative Subgraphs using a boolean satisfiability solver," European Journal of Operational Research, Elsevier, vol. 316(3), pages 815-827.
    • Handle: RePEc:eee:ejores:v:316:y:2024:i:3:p:815-827
    DOI: 10.1016/j.ejor.2024.02.041
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724001747
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.02.041?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. Valls, Vicente & Quintanilla, Sacramento & Ballestin, Francisco, 2003. "Resource-constrained project scheduling: A critical activity reordering heuristic," European Journal of Operational Research, Elsevier, vol. 149(2), pages 282-301, September.
    2. Servranckx, Tom & Vanhoucke, Mario, 2019. "Strategies for project scheduling with alternative subgraphs under uncertainty: similar and dissimilar sets of schedules," European Journal of Operational Research, Elsevier, vol. 279(1), pages 38-53.
    3. Carolin Kellenbrink & Stefan Helber, 2016. "Quality- and profit-oriented scheduling of resource-constrained projects with flexible project structure via a genetic algorithm," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 10(5), pages 574-595.
    4. Andrei Horbach, 2010. "A Boolean satisfiability approach to the resource-constrained project scheduling problem," Annals of Operations Research, Springer, vol. 181(1), pages 89-107, December.
    5. Valls, Vicente & Ballestin, Francisco & Quintanilla, Sacramento, 2008. "A hybrid genetic algorithm for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 185(2), pages 495-508, March.
    6. Valls, Vicente & Ballestin, Francisco & Quintanilla, Sacramento, 2005. "Justification and RCPSP: A technique that pays," European Journal of Operational Research, Elsevier, vol. 165(2), pages 375-386, September.
    7. Coelho, José & Vanhoucke, Mario, 2011. "Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers," European Journal of Operational Research, Elsevier, vol. 213(1), pages 73-82, August.
    8. Zsolt T. Kosztyán & István Szalkai, 2020. "Multimode resource-constrained project scheduling in flexible projects," Journal of Global Optimization, Springer, vol. 76(1), pages 211-241, January.
    9. Debels, Dieter & De Reyck, Bert & Leus, Roel & Vanhoucke, Mario, 2006. "A hybrid scatter search/electromagnetism meta-heuristic for project scheduling," European Journal of Operational Research, Elsevier, vol. 169(2), pages 638-653, March.
    10. Vanhoucke, Mario & Coelho, José, 2016. "An approach using SAT solvers for the RCPSP with logical constraints," European Journal of Operational Research, Elsevier, vol. 249(2), pages 577-591.
    11. Kosztyán, Zsolt T. & Szalkai, István, 2018. "Hybrid time-quality-cost trade-off problems," Operations Research Perspectives, Elsevier, vol. 5(C), pages 306-318.
    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. Li, K. Y. & Willis, R. J., 1992. "An iterative scheduling technique for resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 56(3), pages 370-379, February.
    14. Alexander Schnell & Richard F. Hartl, 2016. "On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 283-303, March.
    15. 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.
    16. Schnell, Alexander & Hartl, Richard F., 2017. "On the generalization of constraint programming and boolean satisfiability solving techniques to schedule a resource-constrained project consisting of multi-mode jobs," Operations Research Perspectives, Elsevier, vol. 4(C), pages 1-11.
    17. Dieter Debels & Mario Vanhoucke, 2007. "A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem," Operations Research, INFORMS, vol. 55(3), pages 457-469, June.
    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. Xabier A. Martin & Rosa Herrero & Angel A. Juan & Javier Panadero, 2024. "An Agile Adaptive Biased-Randomized Discrete-Event Heuristic for the Resource-Constrained Project Scheduling Problem," Mathematics, MDPI, vol. 12(12), pages 1-21, June.
    2. Coelho, José & Vanhoucke, Mario, 2011. "Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers," European Journal of Operational Research, Elsevier, vol. 213(1), pages 73-82, August.
    3. Zamani, Reza, 2013. "A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 229(2), pages 552-559.
    4. 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.
    5. 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.
    6. Ranjbar, Mohammad & De Reyck, Bert & Kianfar, Fereydoon, 2009. "A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling," European Journal of Operational Research, Elsevier, vol. 193(1), pages 35-48, February.
    7. Peteghem, Vincent Van & Vanhoucke, Mario, 2010. "A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 201(2), pages 409-418, March.
    8. Valls, Vicente & Ballestin, Francisco & Quintanilla, Sacramento, 2008. "A hybrid genetic algorithm for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 185(2), pages 495-508, March.
    9. Vanhoucke, Mario & Coelho, José, 2016. "An approach using SAT solvers for the RCPSP with logical constraints," European Journal of Operational Research, Elsevier, vol. 249(2), pages 577-591.
    10. Kosztyán, Zsolt T. & Jakab, Róbert & Novák, Gergely & Hegedűs, Csaba, 2020. "Survive IT! Survival analysis of IT project planning approaches," Operations Research Perspectives, Elsevier, vol. 7(C).
    11. Zhenyuan Liu & Lei Xiao & Jing Tian, 2016. "An activity-list-based nested partitions algorithm for resource-constrained project scheduling," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4744-4758, August.
    12. V. Van Peteghem & M. Vanhoucke, 2008. "A Genetic Algorithm for the Multi-Mode Resource-Constrained Project Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 08/494, Ghent University, Faculty of Economics and Business Administration.
    13. Pejman Peykani & Jafar Gheidar-Kheljani & Sheida Shahabadi & Seyyed Hassan Ghodsypour & Mojtaba Nouri, 2023. "A two-phase resource-constrained project scheduling approach for design and development of complex product systems," Operational Research, Springer, vol. 23(1), pages 1-25, March.
    14. 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.
    15. 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.
    16. M. Vanhoucke, 2007. "A genetic algorithm to investigate the trade-off between project lead time and net present value," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 07/456, Ghent University, Faculty of Economics and Business Administration.
    17. Dieter Debels & Mario Vanhoucke, 2007. "A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem," Operations Research, INFORMS, vol. 55(3), pages 457-469, June.
    18. Alireza Etminaniesfahani & Hanyu Gu & Leila Moslemi Naeni & Amir Salehipour, 2024. "An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem," Annals of Operations Research, Springer, vol. 338(1), pages 41-68, July.
    19. Leyman, Pieter & Vanhoucke, Mario, 2017. "Capital- and resource-constrained project scheduling with net present value optimization," European Journal of Operational Research, Elsevier, vol. 256(3), pages 757-776.
    20. Debels, D. & Vanhoucke, M., 2006. "Meta-Heuristic resource constrained project scheduling: solution space restrictions and neighbourhood extensions," Vlerick Leuven Gent Management School Working Paper Series 2006-18, Vlerick Leuven Gent Management School.

    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:316:y:2024:i:3:p:815-827. 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: 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.