A Neuro-tabu Search Algorithm for the Job Shop Problem | SpringerLink
Skip to main content
Springer Nature Link
Log in

A Neuro-tabu Search Algorithm for the Job Shop Problem

  • Conference paper
Artifical Intelligence and Soft Computing (ICAISC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6114))

Included in the following conference series:

  • 2001 Accesses

Abstract

This paper deals with tabu search with neural network instead of classic tabu list applied for solving the classic job shop scheduling problem with makespan criterion. Computational experiments are given and compared with the results yielded by the best algorithms discussed in the literature. These results show that the proposed algorithm solves the job shop instances with high accuracy in a very short time. Presented ideas can be applied for many scheduling problems.

The work was supported by MNiSW Poland, within the grant No. N N514 232237.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Balas, E., Vazacopoulosi, A.: Guided local search with shifting bottleneck for job shop scheduling. Management Science 44(2), 262–275 (1998)

    Article  MATH  Google Scholar 

  2. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)

    MATH  Google Scholar 

  3. Grabowski, J., Nowicki, E., Smutnicki, C.: Block algorithm for scheduling of operations in job shop system. Przeglad Statystyczny 35, 67–80 (1988) (in Polish)

    MATH  Google Scholar 

  4. Hasegawa, M., Ikeguchi, T., Aihara, K.: Exponential and chaotic neuro-dynamical tabu searches for quadratic assignment problems. Control and Cybernetics 29, 773–788 (2000)

    MATH  MathSciNet  Google Scholar 

  5. Morton, T., Pentico, D.: Heuristic scheduling systems. Wiley, New York (1993)

    Google Scholar 

  6. Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Management Science 42, 797–813 (1996)

    Article  MATH  Google Scholar 

  7. Solimanpur, M., Vrat, P., Shankar, R.: A neuro-tabu search heuristic for the flow shop scheduling problem. Computers and Operations Research 31, 2151–2164 (2004)

    Article  MATH  Google Scholar 

  8. Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)

    Article  MATH  Google Scholar 

  9. Vaessens, R., Aarts, E., Lenstra, J.K.: Job shop scheduling by local search. INFORMS Journal of Computing 8, 303–317 (1996)

    Article  Google Scholar 

  10. http://www.sisoftware.net

  11. http://www.roylongbottom.org.uk/mips.htm#anchorAltos

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Janiszewskiego 11-17, 50-372, Wrocław, Poland

    Wojciech Bożejko & Mariusz Uchroński

Authors
  1. Wojciech Bożejko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mariusz Uchroński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Artificial Intelligence, Academy of Humanities and Economics, Poland

    Leszek Rutkowski

  2. Academy of Humanities and Economics in Łódź, ul. Rewolucji 1905 nr 64, Łódź, Poland

    Rafał Scherer

  3. Institute of Automatics, AGH University of Science and Technology, Al. Mickiewicza 30, PL-30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  4. Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, Berkeley Initiative in Soft Computing (BISC), 94720-1776, CA

    Lotfi A. Zadeh

  5. Computational Intelligence Laboratory Department of Electrical and Computer Engineering, University of Louisville, 40292, Louisville, KY

    Jacek M. Zurada

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bożejko, W., Uchroński, M. (2010). A Neuro-tabu Search Algorithm for the Job Shop Problem. In: Rutkowski, L., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Artifical Intelligence and Soft Computing. ICAISC 2010. Lecture Notes in Computer Science(), vol 6114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13232-2_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13232-2_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13231-5

  • Online ISBN: 978-3-642-13232-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics