International Journal of Soft Computing
ISSN: OnlineISSN: Print 1816-9503
Abstract
The general Job Shop Scheduling (JSS) problem is of combinatorial in nature wherein it is difficult to find the optimal solution conventionally. In recent years, much attention has been made to solve these type optimisation problems using heuristic techniques such as Genetic Algorithm, Ant Colony Optimisation, Tabu Search, Simulated Annealing. This study presents a Tabu Search (TS) approach to minimize makespan for the JSS problem. The method uses dispatching rules to obtain an initial solution and searches for new solutions based on new neighbourhood based first-last strategy with dynamic tabu length. Several benchmark problems are tested using this algorithm for the best makespan and the obtained results are compared with benchmark values. Finally the TS algorithm has been tested for scheduling problem in automobile parts manufacturing industry.
How to cite this article:
P. Senthil Velmurugan and V. Selladurai . A Tabu Search Algorithm for Job Shop Scheduling Problem with Industrial Scheduling Case Study.
DOI: https://doi.org/10.36478/ijscomp.2007.531.537
URL: https://www.makhillpublications.co/view-article/1816-9503/ijscomp.2007.531.537