Parallel Local Search and Job Shop Scheduling
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.
KeywordsLocal Search Time Complexity Parallel Algorithm Travel Salesman Problem Longe Path
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- Lawler, E.L. , Combinatorial Optimization: Networks and Matroids,Holt, Rinehart and Wilson, New York.Google Scholar
- 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
- Papadimitriou, C.H., and K. Steiglitz , Combinatorial Optimization: algorithms and complexity,Prentice Hall.Google Scholar
- Reeves, C.R. (ed.) , Modern Heuristic Techniques for Combinatorial Problems,Blackwell.Google Scholar
- Roy, B., and B. Sussmann [ 1964 ], Les problèmes d’ordonnancement constraints disjonctives, Note DS 9 bis, SEMA, Paris, France.Google Scholar
- Taillard, E. [ 1994 ], Parallel taboo search techniques for the job shop scheduling problem, to appear in ORSA Journal on Computing.Google Scholar
- 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
- 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
- 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