Skip to main content
SpringerLink
Log in

Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling

  • Chapter
Metaheuristics for Scheduling in Industrial and Manufacturing Applications

Part of the book series: Studies in Computational Intelligence ((SCI,volume 128))

Summary

Variable Neighborhood Search (VNS) is a recently invented metaheuristic to use in solving combinatorial optimization problems in which a systematic change of neighborhood with a local search is carried out. However, as happens with other meta-heuristics, it sometimes takes long time to reach useful solutions whilst solving some sort of hard and large scale combinatorial problems such as job shop scheduling. One of the most considerable way out to overcome this shortcoming is to parallelize VNS implementations. In this chapter, firstly, a number of variable neighborhood search algorithms are examined for Job Shop Scheduling (JSS) problems and then four different parallelization policies are tackled as part of efficiency investigation for parallel VNS algorithms. The experimentation reveals the performance of various VNS algorithms and the efficiency of policies to follow in parallelization. In the end, a policy based on unidirectional-ring topology is found most efficient.

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

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Alba E, Tomassini M (2002) Parallelism and evolutionary algorithms, IEEE Transactions on Evolutionary Computation, 6(5):443–462

    Article  Google Scholar 

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

    MATH  Google Scholar 

  5. Aydin ME, Fogarty, TC (2004) A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems, Journal of Heuristics 10:269–292

    Article  Google Scholar 

  6. Aydin ME, Yigit V (2005) Parallel simulated annealing. In: Parallel Meta-Heuristics, E. Alba (Ed), pp. 267-288, Wiley.

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

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

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Crainic TG, Gendreau M, Hansen P, Mladenovic N, (2004) Cooperative Parallel Variable Neighborhood Search for the p-Median, Journal of Heuristics, 10: 293–314

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  Google Scholar 

  16. Dorndorf U, Pesch E (1995) Evolution Based Learning in a Job Shop Scheduling Environment, Computers and Operations Research 22:25–44

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  18. Fleszar K, Hindi KS (2002) New heuristics for one-dimensional bin-packing. Computers and Operations Research, 29:821–839

    Article  MATH  Google Scholar 

  19. Garcia-Lopez F, Melian-Batista B, Moreno-Perez JA, Moreno-Vega M (2002) The parallel variable neighbourhood search for the p-Median problem, Journal of Heuristics, 8(3):375–388

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  21. Groce FD, Tadei R, Volta G (1995) A Genetic Algorithm for the Job Shop Problem. Computers and Operations Research 22: 15–24

    Article  Google Scholar 

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

    Article  Google Scholar 

  23. Hansen P, Mladenovic N, Dragan U (2004) Variable neighborhood search for the maximum clique Discrete Applied Mathematics, 145(1):117–125

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  29. Nowicki E, Smutnicki C (2005) An advanced tabu search algorithm for the job shop problem. Journal of Scheduling 8:145–159

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  32. Sevkli M, Aydin M. E., (2007) Parallel variable neighbourhood search algorithms for job- shop scheduling problems, IMA Journal of Management Mathematics, 18:117-133

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computing and Information Systems, University of Bedfordshire, Luton, UK

    Mehmet E. Aydin

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

    Mehmet Sevkli

Authors
  1. Mehmet E. Aydin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mehmet Sevkli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Languages and Informatics Systems, Polytechnic University of Catalonia, Campus Nord, Ed. Omega C/Jordi Girona 1-3, 08034, Barcelona, Spain

    Fatos Xhafa

  2. Norwegian Center of Excellence Center of Excellence for Quantifiable Quality of Service, Norwegian University of Science and Technology, O.S. Bragstads plass 2E, NO-7491, Trondheim, Norway

    Ajith Abraham

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Aydin, M.E., Sevkli, M. (2008). Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling. In: Xhafa, F., Abraham, A. (eds) Metaheuristics for Scheduling in Industrial and Manufacturing Applications. Studies in Computational Intelligence, vol 128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78985-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78985-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation