Skip to main content
SpringerLink
Log in

A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems

  • Conference paper
Evolutionary Computation in Combinatorial Optimization (EvoCOP 2006)

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

Abstract

Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for solving combinatorial optimization problems in which a systematic change of neighbourhood within a local search is carried out. In this paper, a variable neighbourhood search algorithm is proposed for Job Shop Scheduling (JSS) problem with makespan criterion. The results gained by VNS algorithm are presented and compared with the best known results in literature. It is concluded that the VNS implementation is better than many recently published works with respect to the quality of the solution.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, J., Balas, E., Zawack, D.: The Shifting Bottleneck Procedure for Job Shop Scheduling. Management Science 34, 391–401 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  2. Aiex, R.M., Binato, S., Resende, M.G.C.: Parallel GRASP with Path-Relinking for Job Shop Scheduling. Parallel Computing 29, 393–430 (2003)

    Article  MathSciNet  Google Scholar 

  3. Applegate, D., Cook, W.: A Computational Study of Job-Shop Scheduling. ORSA Journal on Computing 3(2), 149–156 (1991)

    Article  MATH  Google Scholar 

  4. Aydin, M.E., Fogarty, T.C.: A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems. Journal of Heuristics 10, 269–292 (2004)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  6. Beasley, J.E.: Obtaining Test Problems via Internet. Journal of Global Optimisation 8, 429-433, http://people.brunel.ac.uk/~mastjjb/jeb/info.html

  7. Bierwith, C.: A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms. OR Spektrum 17, 87–92 (1995)

    Article  Google Scholar 

  8. Blum, C., Sampels, M.: An Ant Colony Optimization Algorithm for Shop Scheduling Problems. Journal of Mathematical Modelling and Algorithms 3, 285–308 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bruce, K.B., Cardelli, L., Pierce, B.C.: Comparing Object Encodings. In: Ito, T., Abadi, M. (eds.) TACS 1997. LNCS, vol. 1281, pp. 415–438. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  10. Carlier, J., Pison, E.: An Algorithm for Solving the Job-Shop Problem. Management Science 35, 164–176 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  11. Cheng, R., Gen, M., Tsujimura, Y.: A Tutorial Survey of Job Shop Scheduling Problems Using genetic Algorithms-I. Representation. Journal of Computers and Industrial Engineering 30(4), 983–997 (1996)

    Article  Google Scholar 

  12. Colorni, A., Dorigo, M., Maniezzo, V., Trubian, M.: Ant System for Job-Shop Scheduling. Belgian Journal of Operations Research, Statistics and Computer Science (JORBEL) 34(1), 39–53 (1994)

    MATH  Google Scholar 

  13. Dell’Amico, M., Trubian, M.: Applying Tabu-Search to the Job-Shop Scheduling Problem. Annals of Operations Research 4, 231–252 (1993)

    Article  MATH  Google Scholar 

  14. Dorndorf, U., Pesch, E.: Evolution Based Learning in a Job Shop Scheduling Environment. Computers & Operations Research 22 (1995); 0:30 International Journal of Production Research. A hybrid PSO for the JSSP (June 26, 2005)

    Google Scholar 

  15. Dorndorf, U., Pesch, E., Phan-Huy, T.: Constraint Propagation and Problem Decomposition: A Preprocessing Procedure for the Job Shop Problem. Annals of Operations Research 115, 125–145 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  16. Garey, M., Johnson, D., Sethy, R.: The Complexity of Flow Shop and Job Shop Scheduling. Mathematics of Operations Research 1, 117–129 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  17. Groce, F.D., Tadei, R., Volta, G.: A Genetic Algorithm for the Job Shop Problem. Computers & Operations Research 22, 15–24 (1995)

    Article  MATH  Google Scholar 

  18. Goncalves, J.F., Mendes, J.M., Resende, M.: A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operations Research 167(1), 77–95 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  19. Huang, W., Yin, A.: An Improved Shifting Bottleneck Procedure for the Job Shop Scheduling Problem. Computers & Operations Research 31, 2093–2110 (2004)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  21. Kolonko, M.: Some New Results on Simulated Annealing Applied to the Job Shop Scheduling Problem. European Journal of Operational Research 113, 123–136 (1999)

    Article  MATH  Google Scholar 

  22. Mladenovic, N., Hansen, P.: Variable Neighborhood Search. Computers and Operations Research 24, 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  23. Nowicki, E., Smutnicki, C.: A Fast Taboo Search Algorithm for the Job Shop Problem. Management Science 42, 797–813 (1996)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  25. Ribeiroa, C.C., Souza, M.C.: Variable neighborhood search for the degree-constrained minimum spanning tree problem. Discrete Applied Mathematics 118, 43–54 (2002)

    Article  MathSciNet  Google Scholar 

  26. Satake, T., Morikawa, K., Takahashi, K., Nakamura, N.: Neural Network Approach for Minimizing the Makespan of the General Job- Shop. International Journal of Production Economics 33, 67–74 (1994)

    Article  Google Scholar 

  27. Satake, T., Morikawa, K., Takahashi, K., Nakamura, N.: Simulated Annealing Approach for Minimizing the Makespan of the General Job- Shop. International Journal of Production Economics 60, 515–522 (1999)

    Article  Google Scholar 

  28. Urosevic, D., Brimberg, J., Mladenovic, N.: Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Computers & Operations Research 31, 1205–1213 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Industrial Engineering, Fatih University, Buyukcekmece, Istanbul, Turkey

    Mehmet Sevkli

  2. Department of Computing and Information Systems, University of Luton, Luton, UK

    M. Emin Aydin

Authors
  1. Mehmet Sevkli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Emin Aydin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. SAP AG, Neurottstr. 16, 69190, Walldorf, Germany

    Jens Gottlieb

  2. Institute of Computer Graphics and Algorithms, Vienna University of Technology, Favoritenstraße 9–11/1861, 1040, Vienna, Austria

    Günther R. Raidl

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sevkli, M., Aydin, M.E. (2006). A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2006. Lecture Notes in Computer Science, vol 3906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11730095_22

Download citation

  • DOI: https://doi.org/10.1007/11730095_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33178-0

  • Online ISBN: 978-3-540-33179-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation