IDEAS home Printed from https://ideas.repec.org/p/rug/rugwps/04-237.html

A Hybrid Scatter Search / Electromagnetism Meta-Heuristic for Project Scheduling

Author

Listed:
  • D. DEBELS

  • B. DE REYCK
  • R. LEUS
  • M. VANHOUCKE

Abstract

In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively small instances. In this paper, we present a new meta-heuristic for this problem, able to provide near-optimal heuristic solutions. The procedure combines elements from scatter search, a generic population-based evolutionary search method, and a recently introduced heuristic method for the optimisation of unconstrained continuous functions based on an analogy with electromagnetism theory, hereafter referred to as the electromagnetism meta-heuristic. We present computational experiments on standard benchmark datasets, compare the results with current state-ofthe- art heuristics, and show that the procedure is capable of producing consistently good results for challenging instances of the resource-constrained project scheduling problem. We also demonstrate that the algorithm outperforms state-of-the-art existing heuristics.

Suggested Citation

  • D. Debels & B. De Reyck & R. Leus & M. Vanhoucke, 2004. "A Hybrid Scatter Search / Electromagnetism Meta-Heuristic for Project Scheduling," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 04/237, Ghent University, Faculty of Economics and Business Administration.
  • Handle: RePEc:rug:rugwps:04/237
    as

    Download full text from publisher

    File URL: http://wps-feb.ugent.be/Papers/wp_04_237.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, November.
    2. Mireille Palpant & Christian Artigues & Philippe Michelon, 2004. "LSSPER: Solving the Resource-Constrained Project Scheduling Problem with Large Neighbourhood Search," Annals of Operations Research, Springer, vol. 131(1), pages 237-257, October.
    3. Erik L. Demeulemeester & Willy S. Herroelen, 1997. "New Benchmark Results for the Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 43(11), pages 1485-1492, November.
    4. Marti, Rafael & Laguna, Manuel & Glover, Fred, 2006. "Principles of scatter search," European Journal of Operational Research, Elsevier, vol. 169(2), pages 359-372, March.
    5. Kolisch, Rainer, 1996. "Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation," European Journal of Operational Research, Elsevier, vol. 90(2), pages 320-333, April.
    6. 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.
    7. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    8. 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.
    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. 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.
    11. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    12. Arno Sprecher, 2000. "Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements," Management Science, INFORMS, vol. 46(5), pages 710-723, May.
    13. Erik Demeulemeester & Willy Herroelen, 1992. "A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 38(12), pages 1803-1818, December.
    14. J. Alcaraz & C. Maroto, 2001. "A Robust Genetic Algorithm for Resource Allocation in Project Scheduling," Annals of Operations Research, Springer, vol. 102(1), pages 83-109, February.
    15. Bouleimen, K. & Lecocq, H., 2003. "A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version," European Journal of Operational Research, Elsevier, vol. 149(2), pages 268-281, September.
    16. Brucker, Peter & Knust, Sigrid & Schoo, Arno & Thiele, Olaf, 1998. "A branch and bound algorithm for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 107(2), pages 272-288, June.
    17. Ozdamar, Linet & Ulusoy, Gunduz, 1996. "A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis," European Journal of Operational Research, Elsevier, vol. 89(2), pages 400-407, March.
    18. Kolisch, Rainer & Hartmann, Sönke, 1999. "Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 10966, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    19. Fleszar, Krzysztof & Hindi, Khalil S., 2004. "Solving the resource-constrained project scheduling problem by a variable neighbourhood search," European Journal of Operational Research, Elsevier, vol. 155(2), pages 402-413, June.
    20. Aristide Mingozzi & Vittorio Maniezzo & Salvatore Ricciardelli & Lucio Bianco, 1998. "An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation," Management Science, INFORMS, vol. 44(5), pages 714-729, May.
    21. Vicente Valls & Francisco Ballestín & Sacramento Quintanilla, 2004. "A Population-Based Approach to the Resource-Constrained Project Scheduling Problem," Annals of Operations Research, Springer, vol. 131(1), pages 305-324, October.
    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. 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.
    2. D. Debels & M. Vanhoucke, 2005. "A Decomposition-Based Heuristic For The Resource-Constrained Project Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 05/293, Ghent University, Faculty of Economics and Business Administration.
    3. 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.
    4. Tseng, Lin-Yu & Chen, Shih-Chieh, 2006. "A hybrid metaheuristic for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 175(2), pages 707-721, 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. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    7. 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.
    8. 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.
    9. Moumene, Khaled & Ferland, Jacques A., 2009. "Activity list representation for a generalization of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 199(1), pages 46-54, November.
    10. Vanhoucke, Mario & Coelho, José, 2024. "A matheuristic for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 319(3), pages 711-725.
    11. Guo, Weikang & Vanhoucke, Mario & Coelho, José, 2023. "A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 579-595.
    12. 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.
    13. Chen, Jiaqiong & Askin, Ronald G., 2009. "Project selection, scheduling and resource allocation with time dependent returns," European Journal of Operational Research, Elsevier, vol. 193(1), pages 23-34, February.
    14. Bouleimen, K. & Lecocq, H., 2003. "A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version," European Journal of Operational Research, Elsevier, vol. 149(2), pages 268-281, September.
    15. Debels, Dieter & Vanhoucke, Mario, 2005. "A Bi-Population Based Genetic Algorithm for the Resource-Constrained Project Scheduling Problem," Vlerick Leuven Gent Management School Working Paper Series 2005-8, Vlerick Leuven Gent Management School.
    16. Klein, Robert, 2000. "Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects," European Journal of Operational Research, Elsevier, vol. 127(3), pages 619-638, December.
    17. Abdollah Arasteh, 2020. "Considering Project Management Activities for Engineering Design Groups," SN Operations Research Forum, Springer, vol. 1(4), pages 1-29, December.
    18. 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.
    19. Bernardo F. Almeida & Isabel Correia & Francisco Saldanha-da-Gama, 2018. "A biased random-key genetic algorithm for the project scheduling problem with flexible resources," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(2), pages 283-308, July.
    20. 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.

    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:rug:rugwps:04/237. 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: Nathalie Verhaeghe (email available below). General contact details of provider: https://edirc.repec.org/data/ferugbe.html .

    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.