PENERAPAN ALGORITMA TABU SEARCH DALAM PENJADWALAN JOB SHOP

Application of Tabu Search Algorithm in Job Shop Scheduling. Tabu Search is one of local search methods whichis used to solve the combinatorial optimization problem. This method aimed is to make the searching process of the bestsolution in a complex combinatorial optimization problem(np hard), ex : job shop scheduling problem, became moreeffective, in a less computational time but with no guarantee to optimum solution.In this paper, tabu search is used tosolve the job shop scheduling problem consists of 3 (three) cases, which is ordering package of September, October andNovember with objective of minimizing makespan (Cmax). For each ordering package, there is a combination for initialsolution and tabu list length. These result then compared with 4 (four) other methods using basic dispatching rules suchas Shortest Processing Time (SPT), Earliest Due Date (EDD), Most Work Remaining (MWKR) dan First Come FirstServed (FCFS). Scheduling used Tabu Search Algorithm is sensitive for variables changes and gives makespan shorterthan scheduling used by other four methods.Keywords : scheduling, tabu search, job shop, makespa