Algorithm based on taboo search and shifting bottleneck for job shop scheduling

Authors:
Wen-Qi Huang;Zhi Huang
Affiliations:
College of Computer Science, Huazhong University of Science and Technology, Wuhan 430074, P.R. China;College of Computer Science, Huazhong University of Science and Technology, Wuhan 430074, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2004

Citing 6
Cited 1

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
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Applying a hybrid job shop procedure to a Belgian manufacturing company producing industrial wheels and castors in rubber

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a computational effective heuristic method for solving the minimum makespan problem of job shop scheduling is presented. It is based on taboo search procedure and on the shifting bottleneck procedure used to jump out of the trap of the taboo search procedure. A key point of the algorithm is that in the taboo search procedure two taboo lists are used to forbid two kinds of reversals of arcs, which is a new and effective way in taboo search methods for job shop scheduling. Computational experiments on a set of benchmark problem instances show that, in several cases, the approach, in reasonable time, yields better solutions than the other heuristic procedures discussed in the literature.