Job Shop Scheduling by Local Search

We survey solution methods for the job shop scheduling problem with an emphasis on local search. Both deterministic and randomized local search methods as well as the proposed neighborhoods are discussed. We compare the computational performance of the various methods in terms of their effectiveness and efficiency on a standard set of problem instances

A Local Search Template

A template is presented that captures a vast majority of the local search algorithms proposed in the literature, including iterative improvement, simulated annealing, threshold accepting, tabu search, and genetic algorithms. The template leads to a classification of existing local search algorithms and suggests directions for designing new types of local search approaches

A Local Search Template (Extended Abstract)

A template is presented that captures the majority of local search algorithms proposed in the literature, such as iterative improvement, simulated annealing, threshold accepting, tabu search, and genetic algorithms. The template leads to a classification of existing local search algorithms and suggests directions for designing new types of local search approaches