A tabu search method guided by shifting bottleneck for the job shop scheduling problem

A tabu search method guided by shifting bottleneck for the job shop scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor2001205
Country: Netherlands
Volume: 120
Issue: 2
Start Page Number: 297
End Page Number: 310
Publication Date: Jan 2000
Journal: European Journal of Operational Research
Authors: ,
Keywords: heuristics
Abstract:

A computationally effective heuristic method for solving the minimum makespan problem of job shop scheduling is presented. The proposed local search method is based on a tabu search technique and on the shifting bottleneck procedure used to generate the initial solution and to refine the next-current solutions. Computational experiments on a standard set of problem instances show that, in several cases, our approach, in a reasonable amount of computer time, yields better results than the other heuristic procedures discussed in the literature.

Reviews

Required fields are marked *. Your email address will not be published.