Machine Utilization Technique for Job Shop Scheduling using Tabu Search Algorithm
Pages : 200-205, DOI: https://doi.org/10.14741/ijaie/v.6.3.1
Download PDF
Abstract
Efficiency in job shop scheduling plays an important role where a large number of jobs and machines are needed to be scheduled. As the number of jobs and machines increase, the job shop scheduling problems approach nondeterministic polynomial (NP) hard difficulty. It is one of the hardest combinatorial optimization problems for which it is extremely difficult to find optimal solutions. In the last two decades, many heuristic methods have been devised that produce solutions which are near optimal. Here, we present one such heuristic technique called Tabu search algorithm that can be applied to solve Job shop scheduling (JSS) problems. The purpose of this study is to generate different schedules with corresponding completion time using the Tabu search algorithm. The code for tabu search algorithm was done in python language. With the help of Gantt chart, it has found the percentage of machine utilization and idleness for all machines. At last, future directions have been provided for further improvement.
Keywords: Job Shop Scheduling, Machine Utilization, Neighborhood, Tabu Search, Tabu List, Total Completion Time.