Advertisement

Parallel Local Search and Job Shop Scheduling

  • M. G. A. Verhoeven
  • E. H. L. Aarts
Chapter

Abstract

We discuss parallel local search approaches to the job shop scheduling problem, based on edge reversal neighborhoods. Speed-up is achieved by parallel exploration of neighborhoods and parallel computation of the P longest paths in a disjunctive graph. A complexity analysis shows that the resulting parallel local search algorithm has a speed-up of O(P/ log log P) on a PRAM machine with P processors, and a speed-up of O(P/ log P) on a distributed-memory MIMD machine Furthermore, we show that the problem to verify local optimality with respect to the 1-opt neighborhood for the job shop scheduling problem is in.NC.

Keywords

Local Search Time Complexity Parallel Algorithm Travel Salesman Problem Longe Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aarts, E., J. Korst, and P. Zwietering [ 1993 ], Deterministic and randomized local search, in: P. Smolensky, M. Mozer, and D. Rumelhart (eds.), Mathematical Perspectives of Neural Networks, Erlbaum Associates.Google Scholar
  2. Aarts, E. H. L., J. H. M. Korst, and P. J. Zwietering] [ 1993 ], Deterministic and randomized local search, in: P. Smolensky, M. Mozer, and D. Rumelhart (eds.), Mathematical Perspectives of Neural Networks, Erlbaum Associates.Google Scholar
  3. Borodin, A., and J.E. Hopcroft [ 1985 ], Routing, merging, and sorting on parallel models of computation, Journal of Computer and Systems Sciences 30, 130–145.MathSciNetMATHCrossRefGoogle Scholar
  4. Cook, S.A. [ 1981 ], Towards a complexity theory of synchronous parallel computation, Enseignement Mathématique. 27, 99–124.MATHGoogle Scholar
  5. French, S. [ 1982 ], Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Wiley and Sons, New York.MATHGoogle Scholar
  6. Garey, M.R., and D.S. Johnson [ 1979 ], Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman and Company, New York.Google Scholar
  7. Johnson, D.S., C.H. Papadimitriou, and M. Yannakakis [ 1988 ], How easy is local search?, Journal of Computer and System Sciences 37, 79–100.MathSciNetMATHCrossRefGoogle Scholar
  8. Laarhoven, P.J.M. van, E.H.L. Aarts, and J.K. Lenstra [ 1992 ], Job shop sche- duling by simulated annealing, ORSA Operations Research 40, 113–125.MATHCrossRefGoogle Scholar
  9. Lawler, E.L. [1976], Combinatorial Optimization: Networks and Matroids,Holt, Rinehart and Wilson, New York.Google Scholar
  10. Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys [ 1993 ], Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, and P. Zipkin (eds.), Handbooks in Operations Research and Management Science 4, North-Holland.Google Scholar
  11. Papadimitriou, C.H., and K. Steiglitz [1982], Combinatorial Optimization: algorithms and complexity,Prentice Hall.Google Scholar
  12. Reeves, C.R. (ed.) [1993], Modern Heuristic Techniques for Combinatorial Problems,Blackwell.Google Scholar
  13. Roy, B., and B. Sussmann [ 1964 ], Les problèmes d’ordonnancement constraints disjonctives, Note DS 9 bis, SEMA, Paris, France.Google Scholar
  14. Taillard, E. [ 1994 ], Parallel taboo search techniques for the job shop scheduling problem, to appear in ORSA Journal on Computing.Google Scholar
  15. Vaessens, R.J.M., E.H.L. Aarts, and J.K. Lenstra [ 1994 ], Job shop scheduling by local search, Memorandum COSOR 94–5, Eindhoven University of Technology, Netherlands.Google Scholar
  16. Verhoeven, M.G.A., E.H.L. Aarts, E. van de Sluts, and R.J.M. Vaessens [ 1992 ], Parallel local search and the travelling salesman problem (extended abstract), Parallel Problem Solving from Nature 2, 543–552.Google Scholar
  17. Verhoeven, M.G.A., and E.H.L. Aarts [ 1994 ], A parallel Lin-Kernighan algorithm for the traveling salesman problem, Parallel Computing: Trends and Applications, 559–563.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1995

Authors and Affiliations

  • M. G. A. Verhoeven
    • 1
  • E. H. L. Aarts
    • 2
  1. 1.Department of Mathematics and Computing ScienceEindhoven University of TechnologyEindhovenThe Netherlands
  2. 2.Philips Research LaboratoriesEindhovenThe Netherlands

Personalised recommendations