SALSA: A Language for Search Algorithms
Constraints
Problem difficulty for tabu search in job-shop scheduling
Artificial Intelligence
Advances in evolutionary computing
An experimental analysis of local minima to improve neighbourhood search
Computers and Operations Research
Combining local and global search in a constraint programming environment
The Knowledge Engineering Review
An Advanced Tabu Search Algorithm for the Job Shop Problem
Journal of Scheduling
Control Abstractions for Local Search
Constraints
Algorithm based on taboo search and shifting bottleneck for job shop scheduling
Journal of Computer Science and Technology
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
Computers and Operations Research
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Using simulation based approach to improve on the mean cycle time performance of dispatching rules
WSC '05 Proceedings of the 37th conference on Winter simulation
A bee colony optimization algorithm to job shop scheduling
Proceedings of the 38th conference on Winter simulation
A hybrid particle swarm optimization for job shop scheduling problem
Computers and Industrial Engineering
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
Computers and Operations Research
Robotics and Computer-Integrated Manufacturing
A very fast TS/SA algorithm for the job shop scheduling problem
Computers and Operations Research
Ant colony optimization combined with taboo search for the job shop scheduling problem
Computers and Operations Research
A multi-criteria approach for scheduling semiconductor wafer fabrication facilities
Journal of Scheduling
An implementation view on job shop scheduling based on CPM
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Job shop scheduling with setup times, deadlines and precedence constraints
Journal of Scheduling
Scheduling applied to air traffic control
ACMOS'08 Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation
A static algorithm to solve the air traffic sequencing problem
WSEAS TRANSACTIONS on SYSTEMS
Optimised Search Heuristic Combining Valid Inequalities and Tabu Search
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Genetic Algorithm Combined with Tabu Search for the Job Shop Scheduling Problem with Setup Times
IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
Computers and Operations Research
Computers and Operations Research
A GRASP and branch-and-bound metaheuristic for the job-shop scheduling
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
A hybrid constraint programming/local search approach to the job-shop scheduling problem
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Solving job shop scheduling problems utilizing the properties of backbone and "big valley"
Computational Optimization and Applications
A neuro-tabu search algorithm for the job shop problem
ICAISC'10 Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II
An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems
Computers and Industrial Engineering
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
Computers and Operations Research
A Tabu search algorithm to minimize lateness in scheduling problems with setup times
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
Combining Constraint Programming and Local Search for Job-Shop Scheduling
INFORMS Journal on Computing
A GA/TS algorithm for the stage shop scheduling problem
Computers and Industrial Engineering
Combining PSO and local search to solve scheduling problems
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Computers and Industrial Engineering
Nondeterministic control for hybrid search
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A competent memetic algorithm for complex scheduling
Natural Computing: an international journal
A GES/TS algorithm for the job shop scheduling
Computers and Industrial Engineering
A variable neighbourhood search algorithm for job shop scheduling problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Stochastic search for global neighbors selection in collaborative filtering
Proceedings of the 27th Annual ACM Symposium on Applied Computing
From neighbors to global neighbors in collaborative filtering: an evolutionary optimization approach
Proceedings of the 14th annual conference on Genetic and evolutionary computation
An iterated-tabu-search heuristic for a variant of the partial set covering problem
Journal of Heuristics
| Hi-index | 0.01 |
Many recently developed local search procedures for job shop scheduling use interchange of operations, embedded in a simulated annealing or tabu search framework. We develop a new variable depth search procedure, GLS (Guided Local Search), based on an interchange scheme and using the new concept of neighborhood trees. Structural properties of the neighborhood are used to guide the search in promising directions. While this procedure competes successfully with others even as a stand-alone, a hybrid procedure that embeds GLS into a Shifting Bottleneck framework and takes advantage of the differences between the two neighborhood structures proves to be particularly efficient. We report extensive computational testing on all the problems available from the literature.