Skip to main content
SpringerLink
Log in

The k-opt algorithm analysis. The flexible job shop case

  • Conference paper
  • First Online:
Trends in Advanced Intelligent Control, Optimization and Automation (KKA 2017)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 577))

Included in the following conference series:

  • 3049 Accesses

Abstract

In the work there is considered an NP-hard flexible job shop problem. Its solution lies in allocation of operations to machines and determination of the sequence of their execution. There is also a method of construction of approximate algorithms presented, based on the idea of descent search, determining the allocation of operations. What is more, there were computational experiments conducted to investigate the correlation between the size of the neighborhood and the quality of solutions determined by the algorithm.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • 1. Barnes J., Chambers J., Flexible job shop scheduling by tabu search, Graduate program in operations research and industrial engieering. The University of Texas at Austin, 1996.

    Google Scholar 

  • 2. Bożejko W., Uchroński M., Wodecki M., Parallel hybrid metaheuristics for the flexible job shop problem, Computers & Industrial Engineering 59 (2010) 323–333.

    Google Scholar 

  • 3. Bożejko W., Uchroński M.,Wodecki M., The new golf neighborhood for the flexible job shop problem, Proceedings of the ICCS 2010, Procedia Computer Science 1 (2010), Elsevier, 289–296.

    Google Scholar 

  • 4. Bożejko W., Uchroński M., Wodecki M., Parallel neuro-tabu search algorithm for the job shop scheduling problem, Proceedings of ICAISC 2013, Lecture Notes in Artificial Intelligence No. 7895, Springer (2013), 489–499.

    Google Scholar 

  • 5. Brandimarte P., Routing and scheduling in flexible job shop by tabu search, Annals of Operations Research, 41, 1993, 157–183.

    Google Scholar 

  • 6. Gao J., Sun L., Gen M., A hybrid genetic and varioble neighborhood descent algorithm for flexible job shop scheduling problem, Computers and Operations Research, 35, 2008, 2892–2907.

    Google Scholar 

  • 7. Hmida A., Haouari M., Huguet M., Lopez P., Discrepancy search for the flexible job shop scheduling problem, Computers and Operations Research, 37, 2010, 2192–2201.

    Google Scholar 

  • 8. Mastrolilli M., Gambardella L., Effective neighborhood functions for the flexible job shop problem, Journal of scheduling, 3(1), 2000, 3–20.

    Google Scholar 

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

    Google Scholar 

  • 10. Saidi-MehrabadM., Fattahi P., Flexible job shop scheduling with tabu search algorithm, Int. J. Adv. Manuf. Technol., 32, 2007, 563–570.

    Google Scholar 

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

  2. Institute of Computer Science, University of Wrocław, Joliot-Curie 15, 50-383, Wrocław, Poland

    Mieczysław Wodecki

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

  3. Mieczysław Wodecki
    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. Department of Automatics and Biomedical Engineering, AGH University of Science and Technology , Kraków, Poland

    Wojciech Mitkowski

  2. Systems Research Institute, Polish Academy of Sciences, Warszawa, Poland

    Janusz Kacprzyk

  3. Department of Automatics and Biomedical Engineering , AGH University of Science and Technology , Kraków, Poland

    Krzysztof Oprzędkiewicz

  4. Department of Automatics and Biomedical Engineering , AGH University of Science and Technology , Kraków, Poland

    Paweł Skruch

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Bożejko, W., Uchroński, M., Wodecki, M. (2017). The k-opt algorithm analysis. The flexible job shop case. In: Mitkowski, W., Kacprzyk, J., Oprzędkiewicz, K., Skruch, P. (eds) Trends in Advanced Intelligent Control, Optimization and Automation. KKA 2017. Advances in Intelligent Systems and Computing, vol 577. Springer, Cham. https://doi.org/10.1007/978-3-319-60699-6_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60699-6_36

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation