Skip to main content
SpringerLink
Log in

Some New Ideas in TS for Job Shop Scheduling

  • Chapter
Metaheuristic Optimization via Memory and Evolution

Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 30))

Abstract

This paper deals with a classic job-shop scheduling problem with the makespan criterion. Some properties of the fast algorithm TSAB of Nowicki and Smutnicki, as well as properties of the solution space, have been discussed and examined. Next, by introducing the original method of diversification, TSAB has been embedded in more advanced algorithmic framework i-TSAB, which has far analogy to path relinking technique. Newly proposed algorithm is faster and has better accuracy than TSAB, runs within time of minutes on a PC and already in preliminary tests provides 23 new upper bounds among 35 unsolved yet common Taillard's benchmarks.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Balas, E. (1969) "Machine Sequencing via Disjunctive Graphs. An Implicit Enumeration Algorithm," Operations Research, 17:941–957.

    MATH  MathSciNet  Google Scholar 

  • Balas, E. and A. Vazacopoulos (1998) "Guided Local Search with Shifting Bottleneck for Job-Shop Scheduling". Management Science, 44:262–275.

    MATH  Google Scholar 

  • Balas, E. and A. Vazacopoulos (1994) Guided Local Search with Shifting Bottleneck for Job-Shop Scheduling. Technical Report MSRR-609, GSIA, Cornegie Mellon University, Pittsburg.

    Google Scholar 

  • BÅ‚a \(\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{z} \)ewicz, J., W. Domschke and E. Pesh (1996) "The Job Shop Scheduling Problem. Conventional and new Solution Techniques," European Journal of Operational Research, 93:1–33.

    Article  MATH  Google Scholar 

  • Boese, K., A. Kahng and S. Muddu (1994) "A new Adaptive Multi-Start Technique for Combinatorial Global Optimizations," Operations Research Letters, 16:101–113.

    Article  MathSciNet  MATH  Google Scholar 

  • Brucker, P. (1996) Scheduling Algorithms. Springer-Verlag, Berlin.

    Google Scholar 

  • Cheng, R., M. Gen and Y. Tsujimura (1996) "A Tutorial Survey of Job-Shop Scheduling Problems using Genetic Algorithms, Part II: hybrid genetic search strategies," Computers & Industrial Engineering, 36:343–364.

    Article  Google Scholar 

  • DellAmico, M. and M. Trubian (1993) "Applying Tabu Search to the Job-Shop Scheduling Problem," Annals of Operations Research, 4:231–252.

    Article  Google Scholar 

  • Ten Eikelder, H.M.M., B.J.M. Aarts, M.G.A. Verhoeven and E.H.L. Aarts (1999) Sequential and Parallel Local Search Algorithms for Job-Shop Scheduling. In S. Voß, S. Martello, I.H. Osman, and C. Roucairol, Editors, Meta-Heuristic: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Massachusetts, USA.

    Google Scholar 

  • Glover, F. and M. Laguna (1997) Tabu search. Kluwer Academic Publishers. Massachusetts, USA.

    MATH  Google Scholar 

  • Glover, F. (1989) "Tabu search. Part I," ORSA Journal of Computing, 1:190–206.

    MATH  MathSciNet  Google Scholar 

  • Glover, F. (1990) "Tabu search. Part II," ORSA Journal of Computing, 2:4–32.

    MATH  Google Scholar 

  • Grabowski, J., E. Nowicki and C. Smutnicki (1988) Block Algorithm for Scheduling of Operations in Job-Shop System, (in Polish). Przeglad Statystyczny, 35:67–80.

    MATH  Google Scholar 

  • Jain, A.S., B. Rangaswamy and S. Meeran (2000) "New and "stronger" Job-Shop Neighbourhoods: A Focus on the Method of Nowicki and Smutnicki," Journal of Heuristics, 6(4):457–480.

    Article  MATH  Google Scholar 

  • Jain, A.S. and S. Meeran (1999) "Deterministic Job-Shop Scheduling: Past, Present and Future," European Journal of Operational Research, 113:390–434.

    Article  MATH  Google Scholar 

  • Knuth, D.E. (1997) The Art of Computer Programming. Addison Wesley Longman.

    Google Scholar 

  • Laarhoven, P.V., E. Aarts and J.K. Lenstra (1992) "Job-Shop Scheduling by Simulated Annealing," Operations Research, 40:113–125.

    Article  MathSciNet  MATH  Google Scholar 

  • Manly, B.F.J. (1991) Randomization and Monte Carlo Methods in biology. Chapman and Hall, London.

    MATH  Google Scholar 

  • Nowicki, E. and C. Smutnicki (1996) "A Fast Tabu Search Algorithm for the Job-Shop Problem," Management Science, 42(6):797–813.

    MATH  Google Scholar 

  • Nowicki, E. and C. Smutnicki (2001) New Tools to Solve the Job-Shop Problem. Technical Report 51/2001 (extended version in Technical Report 60/2002). Institute of Engineering Cybernetics, Wroclaw University of Technology, Wroclaw, Poland, http://www.zsd.ict.pwr.wroc.pl

    Google Scholar 

  • OR Library. http://mscmga.ms.ic.ac.uk/info.html.

    Google Scholar 

  • Pezzella, F. and E. Merelli (2000) "A Tabu Search Method Guided by Shifting Bottleneck for the Job-Shop Scheduling Problem," European Journal of Operational Research, 120:297–310.

    Article  MathSciNet  MATH  Google Scholar 

  • Reeves, C. (1998) Landscapes, Operators and Heuristic Search. Technical Report, School of MIS, Coventry University.

    Google Scholar 

  • Home page of E. Taillard. http://www.eivd.ch/ina/collaborateurs/etd/ default.htm

    Google Scholar 

  • Taillard, E. (1993) "Benchmarks for Basic Scheduling Problems," European Journal of Operational Research, 64:278–285.

    Article  MATH  Google Scholar 

  • Vaessens, R., E. Aarts and J.K. Lenstra (1996) "Job Shop Scheduling by Local Search," INFORMS Journal of Computing, 8:303–317.

    Article  Google Scholar 

  • Woodruff, D.L. and E. Zemel (1993) "Hashing Vectors for Tabu Search," Annals of Operations Research, 41:123–137.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Engineering Cybernetics, Wroclaw University of Technology, Janiszewskiego 11-17, 50-372, Wroclaw, Poland

    Eugeniusz Nowicki & Czeslaw Smutnicki

Authors
  1. Eugeniusz Nowicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Czeslaw Smutnicki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Oklahoma State University, USA

    Ramesh Sharda

  2. Universität Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Kluwer Academic Publishers

About this chapter

Cite this chapter

Nowicki, E., Smutnicki, C. (2005). Some New Ideas in TS for Job Shop Scheduling. In: Sharda, R., Voß, S., Rego, C., Alidaee, B. (eds) Metaheuristic Optimization via Memory and Evolution. Operations Research/Computer Science Interfaces Series, vol 30. Springer, Boston, MA. https://doi.org/10.1007/0-387-23667-8_7

Download citation

Publish with us

Policies and ethics

Search

Navigation