IDEAS home Printed from https://ideas.repec.org/p/rug/rugwps/09-555.html
   My bibliography  Save this paper

An Artificial Immune System for the Multi-Mode Resource-Constrained Project Scheduling Problem

Author

Listed:
  • V. VAN PETEGHEM
  • M. VANHOUCKE

Abstract

In this paper, an Artificial Immune System (AIS) for the multi-mode resource-constrained project scheduling problem (MRCPSP), in which multiple execution modes are available for each of the activities of the project, is presented. The AIS algorithm makes use of mechanisms which are inspired on the vertebrate immune system performed on an initial population set. This population set is generated with a controlled search method, based on experimental results which revealed a link between predefined profit values of a mode assignment and its makespan. The impact of the algorithmic parameters and the initial population generation method is observed and detailed comparative computational results for the MRCPSP are presented.

Suggested Citation

  • V. Van Peteghem & M. Vanhoucke, 2009. "An Artificial Immune System for the Multi-Mode Resource-Constrained Project Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 09/555, Ghent University, Faculty of Economics and Business Administration.
  • Handle: RePEc:rug:rugwps:09/555
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Slowinski, Roman & Soniewicki, Boleslaw & Weglarz, Jan, 1994. "DSS for multiobjective project scheduling," European Journal of Operational Research, Elsevier, vol. 79(2), pages 220-229, December.
    2. Rainer Kolisch & Arno Sprecher & Andreas Drexl, 1995. "Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems," Management Science, INFORMS, vol. 41(10), pages 1693-1703, October.
    3. 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.
    4. 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.
    5. Abdelkader Sbihi, 2007. "A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem," Journal of Combinatorial Optimization, Springer, vol. 13(4), pages 337-351, May.
    6. Sönke Hartmann, 2001. "Project Scheduling with Multiple Modes: A Genetic Algorithm," Annals of Operations Research, Springer, vol. 102(1), pages 111-135, February.
    7. Boctor, Fayez F., 1996. "A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes," European Journal of Operational Research, Elsevier, vol. 90(2), pages 349-361, April.
    8. F. Brian Talbot, 1982. "Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case," Management Science, INFORMS, vol. 28(10), pages 1197-1210, October.
    9. Joanna Józefowska & Marek Mika & Rafał Różycki & Grzegorz Waligóra & Jan Węglarz, 2001. "Simulated Annealing for Multi-Mode Resource-Constrained Project Scheduling," Annals of Operations Research, Springer, vol. 102(1), pages 137-155, February.
    10. Vanhoucke, Mario & Coelho, Jose & Debels, Dieter & Maenhout, Broos & Tavares, Luis V., 2008. "An evaluation of the adequacy of project network generators with systematically sampled networks," European Journal of Operational Research, Elsevier, vol. 187(2), pages 511-524, June.
    11. Kolisch, Rainer & Sprecher, Arno, 1996. "PSPLIB - a project scheduling problem library," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 396, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. 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.
    13. Ozdamar, Linet & Ulusoy, Gunduz, 1994. "A local constraint based analysis approach to project scheduling under general resource constraints," European Journal of Operational Research, Elsevier, vol. 79(2), pages 287-298, December.
    14. Mori, Masao & Tseng, Ching Chih, 1997. "A genetic algorithm for multi-mode resource constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 134-141, July.
    15. M Hifi & M Michrafy & A Sbihi, 2004. "Heuristic algorithms for the multiple-choice multidimensional knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1323-1332, December.
    16. J Alcaraz & C Maroto & R Ruiz, 2003. "Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(6), pages 614-626, June.
    17. Sprecher, Arno & Drexl, Andreas, 1998. "Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm," European Journal of Operational Research, Elsevier, vol. 107(2), pages 431-450, June.
    18. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. Behrad Barghi & Shahram Shadrokh Sikari, 2022. "Meta-heuristic Solution with Considering Setup Time for Multi-Skilled Project Scheduling Problem," SN Operations Research Forum, Springer, vol. 3(1), pages 1-23, March.
    3. 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.
    4. Luis F. Machado-Domínguez & Carlos D. Paternina-Arboleda & Jorge I. Vélez & Agustin Barrios-Sarmiento, 2021. "A memetic algorithm to address the multi-node resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 24(4), pages 413-429, August.

    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. 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.
    2. 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.
    3. Van Peteghem, Vincent & Vanhoucke, Mario, 2014. "An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances," European Journal of Operational Research, Elsevier, vol. 235(1), pages 62-72.
    4. V. Van Peteghem & M. Vanhoucke, 2009. "Using Resource Scarceness Characteristics to Solve the Multi-Mode Resource-Constrained Project Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 09/595, Ghent University, Faculty of Economics and Business Administration.
    5. 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.
    6. Elloumi, Sonda & Fortemps, Philippe, 2010. "A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 31-41, August.
    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. 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.
    9. Lova, Antonio & Tormos, Pilar & Cervantes, Mariamar & Barber, Federico, 2009. "An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes," International Journal of Production Economics, Elsevier, vol. 117(2), pages 302-316, February.
    10. J Alcaraz & C Maroto & R Ruiz, 2003. "Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(6), pages 614-626, June.
    11. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    12. Nima Zoraghi & Aria Shahsavar & Babak Abbasi & Vincent Peteghem, 2017. "Multi-mode resource-constrained project scheduling problem with material ordering under bonus–penalty policies," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 49-79, April.
    13. Alfredo S. Ramos & Pablo A. Miranda-Gonzalez & Samuel Nucamendi-Guillén & Elias Olivares-Benitez, 2023. "A Formulation for the Stochastic Multi-Mode Resource-Constrained Project Scheduling Problem Solved with a Multi-Start Iterated Local Search Metaheuristic," Mathematics, MDPI, vol. 11(2), pages 1-25, January.
    14. T Wauters & K Verbeeck & G Vanden Berghe & P De Causmaecker, 2011. "Learning agents for the multi-mode project scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 281-290, February.
    15. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
    16. Dayal Madhukar & Verma, Sanjay, 2015. "Multi-processor Exact Procedures for Regular Measures of the Multi-mode RCPSP," IIMA Working Papers WP2015-03-25, Indian Institute of Management Ahmedabad, Research and Publication Department.
    17. Buddhakulsomsiri, Jirachai & Kim, David S., 2006. "Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting," European Journal of Operational Research, Elsevier, vol. 175(1), pages 279-295, November.
    18. Hartmann, Sönke, 2011. "Project scheduling with resource capacities and requests varying with time," Working Paper Series 01/2011, Hamburg School of Business Administration (HSBA).
    19. 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.
    20. Luis F. Machado-Domínguez & Carlos D. Paternina-Arboleda & Jorge I. Vélez & Agustin Barrios-Sarmiento, 2021. "A memetic algorithm to address the multi-node resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 24(4), pages 413-429, August.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:09/555. 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.