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
An algorithm for solving the job-shop problem
Management Science
Job shop scheduling by simulated annealing
Operations Research
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
A branch and bound algorithm for the job-shop scheduling problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
A genetic algorithm for the job shop problem
Computers and Operations Research - Special issue on genetic algorithms
A fast taboo search algorithm for the job shop problem
Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
Management Science
Tabu Search
An experimental analysis of local minima to improve neighbourhood search
Computers and Operations Research
A very fast TS/SA algorithm for the job shop scheduling problem
Computers and Operations Research
Variable Neighborhood Genetic Algorithm for the Flexible Job Shop Scheduling Problems
ICIRA '08 Proceedings of the First International Conference on Intelligent Robotics and Applications: Part II
Guided Ejection Search for the Job Shop Scheduling Problem
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
A robust parameter design for multi-response problems
Journal of Computational and Applied Mathematics
Optimization for the cyclic scheduling of polyamide staple fiber plants
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Minimising the delta test for variable selection in regression problems
International Journal of High Performance Systems Architecture
An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems
Computers and Industrial Engineering
An efficient memetic algorithm for solving the job shop scheduling problem
Computers and Industrial Engineering
A GA/TS algorithm for the stage shop scheduling problem
Computers and Industrial Engineering
Computers and Industrial Engineering
Computers and Industrial Engineering
A GES/TS algorithm for the job shop scheduling
Computers and Industrial Engineering
A genetic algorithm for the job shop on an ASRS warehouse
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
An optimal method for the preemptive job shop scheduling problem
Computers and Operations Research
Computers and Operations Research
Cell assignment in hybrid CMOS/nanodevices architecture using Tabu Search
Applied Intelligence
Hi-index | 0.01 |
Tabu search (TS) algorithms are among the most effective approaches for solving the job shop scheduling problem (JSP) which is one of the most difficult NP-complete problems. However, neighborhood structures and move evaluation strategies play the central role in the effectiveness and efficiency of the tabu search for the JSP. In this paper, a new enhanced neighborhood structure is proposed and applied to solving the job shop scheduling problem by TS approach. Using this new neighborhood structure combined with the appropriate move evaluation strategy and parameters, we tested the TS approach on a set of standard benchmark instances and found a large number of better upper bounds among the unsolved instances. The computational results show that for the rectangular problem our approach dominates all others in terms of both solution quality and performance.