Skip to main content
SpringerLink
Log in

Tabu Search and Solution Space Analyses. The Job Shop Case

  • Conference paper
  • First Online:
Computer Aided Systems Theory – EUROCAST 2017 (EUROCAST 2017)

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

Included in the following conference series:

Abstract

We present some own results of the theoretical and experimental investigations of the landscape of the solution space for the job-shop scheduling problem. Provided interpretation of the space throws new light on the process of solving hard combinatorial optimization problems as well as on Tabu Search phenomenon.

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

Access this chapter

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

Institutional subscriptions

References

  1. Błażewicz, J., Domschke, W., Pesh, E.: The job shop scheduling problem. conventional and new solution techniques. Eur. J. Oper. Res. 93, 1–33 (1996)

    Article  MATH  Google Scholar 

  2. Brucker, P., Jurish, B., Sieviers, B.: A fast branch and bound algorithm for the job shop problem. Discret. Appl. Math. 49, 107–127 (1994)

    Article  Google Scholar 

  3. Fisher, H., Thompson, G.L.: Probabilistic learning combinations of local job-shop scheduling rules. In: Muth, J.F., Thompson, G.L. (eds.) Industrial Scheduling, pp. 225–251. Prentice Hall, Englewood Cliffs (1963)

    Google Scholar 

  4. Gao, L., Li, X., Wen, X., Lu, C., Wen, F.: A hybrid algorithm based on a new neighborhood structure evaluation method for job shop scheduling problem. Comput. Ind. Eng. 88, 417–429 (2015)

    Article  Google Scholar 

  5. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)

    Book  MATH  Google Scholar 

  6. Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: past, present and future. Eur. J. Oper. Res. 113, 390–434 (1999)

    Article  MATH  Google Scholar 

  7. Knuth, D.E.: The Art of Computer Programming. Addison Wesley Longman, Reading (1977)

    MATH  Google Scholar 

  8. Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the job-shop problem. Manag. Sci. 42(6), 797–813 (1996)

    Article  MATH  Google Scholar 

  9. Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278–285 (1993)

    Article  MATH  Google Scholar 

  10. Watson, J.P., Beck, J.C., Howe, A.E., Whitley, L.D.: Problem difficulty for tabu search in job-shop scheduling. Artif. Intell. 143, 189–217 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Watson, J.P.: An introduction to fitness landscape analysis and cost models for local search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 146, pp. 599–623. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-1665-5_20

    Chapter  Google Scholar 

  12. Wong, L.P., Puan, C.Y., Low, M.Y.H., Chong, C.S.: Bee colony optimization algorithm with big valley landscape exploitation for the job shop problem. In: Proceedings of the 2008 Winter Simulation Conference, pp. 2050–2058 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Electronics, Wrocław University of Science and Technology, Wrocław, Poland

    Czesław Smutnicki & Wojciech Bożejko

Authors
  1. Czesław Smutnicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wojciech Bożejko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wojciech Bożejko .

Editor information

Editors and Affiliations

  1. University of Las Palmas de Gran Canaria, Las Palmas de Gran Canaria, Spain

    Roberto Moreno-Díaz

  2. Johannes Kepler University Linz, Linz, Austria

    Franz Pichler

  3. University of Las Palmas de Gran Canaria, Las Palmas de Gran Canaria, Spain

    Alexis Quesada-Arencibia

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Smutnicki, C., Bożejko, W. (2018). Tabu Search and Solution Space Analyses. The Job Shop Case. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2017. EUROCAST 2017. Lecture Notes in Computer Science(), vol 10671. Springer, Cham. https://doi.org/10.1007/978-3-319-74718-7_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-74718-7_46

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-74717-0

  • Online ISBN: 978-3-319-74718-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation