MINIMIZING THE TOTAL JOB DELAY USING TABU SEARCH ALGORITHM IN STAMPING PROCESS

Abstract

As one of the biggest vehicle manufacturing in Indonesia, PT. XYZ has several production processes which divided into several production area. Stamping Area is the area that produces sub-component of vehicle. The problem found in the stamping area where the number of tardy of total job is very high. Therefore, the purpose of this research is to minimize delay in stamping area. Tabu Search Algorithm will be used to minimize the lateness of Job Shop Scheduling. The purpose is to avoid entrainment in cycle by forbidding or penalizing moves, which take the solution in the next iteration. Tabu Search is part of metaheuristic algorithm that can be used for solving combinational optimization problems. This research is scheduling 21 products which are divided into 208 jobs, and processed in 16 machines. The result of this algorithm is can minimize the total job delay from 96 job delay become 23 job delays.