Skip to main content
SpringerLink
Log in
Book cover

International Conference on Learning and Intelligent Optimization

LION 2007: Learning and Intelligent Optimization pp 234–242Cite as

Hybrid Heuristics for Multi-mode Resource-Constrained Project Scheduling

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5313))

Abstract

This paper describes some tabu search based heuristics with path relinking for the multi-mode resource-constrained project scheduling problem. Path relinking is used as a post optimization strategy, so that it explores paths that connect elite solutions found by the tabu search based heuristics. Computational results show that path relinking is able to improve the tabu search based heuristics, and that these hybrid heuristics are able to find good quality solutions in quite short computational times.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blazewicz, J., Lenstra, J., Kan, A.R.: Scheduling projects subject to resource constraints: classification and complexity. Discrete Applied Mathematics (5), 11–24 (1983)

    Google Scholar 

  2. Patterson, J., Slowinski, R., Talbot, F., Weglarz, J.: An algorithm for a general class of precedence and resource constrained scheduling problem. In: Slowinski, R., Weglarz, J. (eds.) Advances in Project Scheduling, pp. 3–28. Elsevier, Amsterdam (1989)

    Chapter  Google Scholar 

  3. Hartmann, S., Drexl, A.: Project scheduling with multiple modes: A comparison of exact algorithms. Networks (32), 283–297 (1998)

    Google Scholar 

  4. Zhu, G., Bard, J., Yu, G.: A branch-and-cut procedure for the multimode resourceconstrained project-scheduling problem. INFORMS Journal on Computing 18(3), 377–390 (2006)

    Article  MATH  Google Scholar 

  5. Slowinski, R., Soniewicki, B., Weglarz, J.: DSS for multiobjective project scheduling. Eur. J. Opl. Res. 18(79), 220–229 (1994)

    Article  MATH  Google Scholar 

  6. Boctor, F.: Resource-constrained project scheduling by simulated annealing. International Journal of Production Research 8(34), 2335–2351 (1996)

    Article  MATH  Google Scholar 

  7. Bouleimen, K., Lecocq, H.: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research (149), 268–281 (2003)

    Google Scholar 

  8. Jozefowska, J., Mika, M., Rozycki, R., Waligora, G., Weglarz, J.: Simulated annealing for multi-mode resource-constrained project scheduling. Annals of Operations Research (102), 137–155 (2001)

    Google Scholar 

  9. Alcaraz, J., Maroto, C., Ruiz, R.: Solving the multi-mode resource constrained project scheduling problem with genetic algorithms. Journal of the Operational Research Society (54) (54), 614–626 (2003)

    Google Scholar 

  10. Hartmann, S.: Project scheduling with multiple modes: a genetic algorithm. Ann. Opns. Res (102), 111–135 (2001)

    Google Scholar 

  11. Ozdamar, L.: A genetic algorithm approach to a general category project scheduling problem. IEEE Trans. Syst. Man Cybern (29), 44–59 (1999)

    Google Scholar 

  12. Nonobe, K., Ibaraki, T.: Formulation and tabu search algorithm for the resource constrained project scheduling problem. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 557–588. Kluwer Academic Publishers, Dordrecht (2002)

    Chapter  Google Scholar 

  13. Baar, T., Brucker, P., Knust, S.: Tabu search algorithms for resource-constrained project scheduling problems. In: Voss, S., Martello, S., Osman, I., Roucairol, C. (eds.) Metaheuristics: Advances and Trends in Local Search Paradigms for Optimisation, pp. 1–18. Kluwer Academic Publishers, Dordrecht (1997)

    Google Scholar 

  14. Cavalcante, C., Cavalcante, V., Ribeiro, C., de Souza, C.: Parallel cooperative approaches for the labor constrained scheduling problem. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 201–225. Kluwer Academic Publishers, Dordrecht (2002)

    Chapter  Google Scholar 

  15. Glover, F.: Heuristics for integer programming using surrogate constraints. Decision Sciences 8(1), 156–166 (1977)

    Article  Google Scholar 

  16. Glover, F.: Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 13, 533–549 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  17. Glover, F.: Tabu search - Part I. ORSA Journal on Computing 1, 190–206 (1989)

    Article  MATH  Google Scholar 

  18. Glover, F.: Tabu search - Part II. ORSA Journal on Computing 2, 4–32 (1990)

    Article  MATH  Google Scholar 

  19. Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1997)

    Book  MATH  Google Scholar 

  20. Glover, K.: Tabu search and adaptive memory programming - advances, applications and challenges. In: Barr, R., Helgason, R., Kennington, J. (eds.) Interfaces in Computer Science and Operations Research, pp. 1–75. Kluwer Academic Publishers, Dordrecht (1996)

    Google Scholar 

  21. Festa, P., Pardalos, P., Resende, M., Ribeiro, C.: Randomized heuristics for the max-cut problem. Optimization Methods and Software 7, 1033–1058 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  22. Martins, S., Ribeiro, C., Rosseti, I.: Applications and parallel implementations of metaheuristics in network design and routing. In: Manandhar, S., Austin, J., Desai, U., Oyanagi, Y., Talukder, A.K. (eds.) AACC 2004. LNCS, vol. 3285, pp. 205–213. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  23. Resende, M., Ribeiro, C.: GRASP with path-relinking: Recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp. 29–63. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  24. Ribeiro, C., Uchoa, E., Werneck, R.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing 14, 228–246 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  25. Silva, G., de Andrade, M., Ochi, L., Martins, S., Plastino, A.: New heuristics for the maximum diversity problem. J. Heuristics 13, 315–336 (2007)

    Article  Google Scholar 

  26. Ribeiro, C., Vianna, D.: A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking. Revista Tecnologia da Informação 3, 67–70 (2003)

    Google Scholar 

  27. Ho, S.C., Gendreau, M.: Path relinking for the vehicle routing problem. J. Heuristics 12, 55–72 (2006)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto Aerus de Seguridade Social, Rio de Janeiro, RJ, Brazil

    Celso Tchao

  2. Departamento de Ciência de Computação, Universidade Federal Fluminense, Niterói, RJ, Brazil

    Simone L. Martins

Authors
  1. Celso Tchao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simone L. Martins
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. Computer Science, University of Bologna, Bologna, Italy

    Vittorio Maniezzo

  2. Università degli Studi di Trento, Trento, Italy

    Roberto Battiti

  3. Discrete Math and Complex Systems Department, Sandia National Laboratories, Albuquerque, New Mexico, USA

    Jean-Paul Watson

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tchao, C., Martins, S.L. (2008). Hybrid Heuristics for Multi-mode Resource-Constrained Project Scheduling. In: Maniezzo, V., Battiti, R., Watson, JP. (eds) Learning and Intelligent Optimization. LION 2007. Lecture Notes in Computer Science, vol 5313. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92695-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92695-5_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92694-8

  • Online ISBN: 978-3-540-92695-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation