Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
The shifting bottleneck procedure for job shop scheduling
Management Science
Job shop scheduling by simulated annealing
Operations Research
A fast taboo search algorithm for the job shop problem
Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
Management Science
A hybrid genetic algorithm for the job shop scheduling problems
Computers and Industrial Engineering
An Advanced Tabu Search Algorithm for the Job Shop Problem
Journal of Scheduling
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
A very fast TS/SA algorithm for the job shop scheduling problem
Computers and Operations Research
Solving job shop scheduling problems utilizing the properties of backbone and "big valley"
Computational Optimization and Applications
A GA/TS algorithm for the stage shop scheduling problem
Computers and Industrial Engineering
Flexible job shop scheduling using hybrid differential evolution algorithms
Computers and Industrial Engineering
Hi-index | 0.00 |
The job shop scheduling problem is a difficult combinatorial optimization problem. This paper presents a hybrid algorithm which combines global equilibrium search, path relinking and tabu search to solve the job shop scheduling problem. The proposed algorithm used biased random sampling to have a better covering of the solution space. In addition, a new version of N6 neighborhood is applied in a tabu search framework. In order to evaluate the algorithm, comprehensive tests are applied to it using various standard benchmark sets. Computational results confirm the effectiveness of the algorithm and its high speed. Besides, 19 new upper bounds among the unsolved problems are found.