Skip to main content
SpringerLink
Log in
Book cover

International Conference on Learning and Intelligent Optimization

LION 2015: Learning and Intelligent Optimization pp 119–124Cite as

Minimizing Total Tardiness on Identical Parallel Machines Using VNS with Learning Memory

  • Conference paper
  • First Online:

  • 1018 Accesses

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

Abstract

Minimizing total tardiness on identical parallel machines is an \(\mathcal {NP}\)-hard parallel machine scheduling problem that has received much attention in literature due to its direct application to real-world applications. For solving this problem, we present a variable neighbourhood search that incorporates a learning mechanism for guiding the search. Computational results comparing with the best approaches for this problem reveals that our algorithm is a suitable alternative to efficiently solve this problem.

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 EPUB and 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

References

  1. Biskup, D., Herrmann, J., Gupta, J.N.D.: Scheduling identical parallel machines to minimize total tardiness. Int. J. Prod. Econ. 115(1), 134–142 (2008)

    Article  Google Scholar 

  2. Deng, G., Zhang, K., Gu, X.: A hybrid discrete differential evolution algorithm to minimise total tardiness on identical parallel machines. Int. J. Comput. Integr. Manuf. 26(6), 504–512 (2013)

    Article  Google Scholar 

  3. Hansen, P., Mladenovic, N., Moreno Pérez, J.A.: Variable neighbourhood search. Ann. Oper. Res. 175, 367–407 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  4. Niu, Q., Zhou, T., Wang, L.: A hybrid particle swarm optimization for parallel machine total tardiness scheduling. Int. J. Adv. Manuf. Technol. 49(5–8), 723–739 (2010)

    Article  Google Scholar 

  5. Stützle, T.: Local search algorithms for combinatorial problems. Darmstadt University of Technology. Ph.D. thesis (1998)

    Google Scholar 

  6. Tanaka, S., Araki, M.: A branch-and-bound algorithm with lagrangian relaxation to minimize total tardiness on identical parallel machines. Int. J. Prod. Econ. 113(1), 446–458 (2008)

    Article  Google Scholar 

Download references

Acknowledgements

This work has been partially funded by the European Regional Development Fund, the Spanish Ministry of Economy and Competitiveness (project TIN2012-32608). Eduardo Lalla-Ruiz thanks the Canary Government for the financial support he receives through his doctoral grant.

Author information

Authors and Affiliations

  1. Department of Computer and Systems Engineering, University of La Laguna, San Cristóbal de La Laguna, Spain

    Eduardo Lalla-Ruiz

  2. Institute of Information Systems, University of Hamburg, Hamburg, Germany

    Stefan Voß

Authors
  1. Eduardo Lalla-Ruiz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Voß
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eduardo Lalla-Ruiz .

Editor information

Editors and Affiliations

  1. Lille University, Villeneuve d'Ascq, France

    Clarisse Dhaenens

  2. Lille University, Villeneuve d'Ascq, France

    Laetitia Jourdan

  3. Lille University, Villeneuve d'Ascq, France

    Marie-Eléonore Marmion

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Lalla-Ruiz, E., Voß, S. (2015). Minimizing Total Tardiness on Identical Parallel Machines Using VNS with Learning Memory. In: Dhaenens, C., Jourdan, L., Marmion, ME. (eds) Learning and Intelligent Optimization. LION 2015. Lecture Notes in Computer Science(), vol 8994. Springer, Cham. https://doi.org/10.1007/978-3-319-19084-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19084-6_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19083-9

  • Online ISBN: 978-3-319-19084-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation