In this paper the tabu search technique is considered for solving job shop scheduling problems. The performance measure considered is makespan time. The adjacent pairwise interchange method is used to generate neighbourhoods. The results of tabu search are compared with simulated annealing and genetic algorithms. It is concluded that the performance of tabu search is comparable to that of genetic algorithm and simulated annealing. The future research directions are also discussed.