Penjadwalan Produksi Job Shop dengan Menggunakan Algoritma Tabu Search pada PT. KLM

Author(s):  
Aris Selamat Sinaga ◽  
Rosnani Ginting

PT. KLM adalah perusahaan yang bergerak dalam manufaktur spare part. Dalam penelitian ini hanya dilakukan pada produksi spare part worm screw, cone guide, protection nut, extension shaft, pin and nut coupling, plat dismentling, cone, strainer dengan menggunakan mesin screwpress, Pola aliran proses jobshop digunakan dan diproduksi bersifat make to order. Tiap item melalui fasilitas mesin yng sama namun memiliki aliran proses yang berbeda, urutan dan waktu proses yang berbeda. sehingga dapat mengakibatkan terjadinya waktu menganggur pada sebuah mesin dan menyebabkan adanya tumpukan pekerjaan pada mesin yang lain. Penjadwalan produksi yang digunakan perusahaan saat ini masih menyebabkan keterlambatan penyelesaian pesanan, juga terdapat banyak pekerjaan yang belum dikerjakan yang disebabkan angka makespan yang terlalu besar. Penelitian ini bertujuan untuk meniminalkan makespan dengan menggunakan Algoritma Tabu Search. Hasil penelitian ini yaitu penjadwalan produksi mengalami reduksi waktu setelah digunakan algoritma Tabu Search dimana pada kondisi awal selama 815.6 menit atau 13,59 jam menjadi 758,2 menit atau 12,63 jam. Relative Error yang ditemukan menunjukkan adanya reduksi makespan yang diperoleh antara Algoritma Tabu Search dengan metode perusahaan adalah 6,87%. sedangkan besarnya Indeks Efisiensi yaitu 1,075.   PT. KLM is a company engaged in manufacturing spare parts. In this research, only the production of spare part worm screw, guide cone, protection nut, extension shaft, pin and nut coupling, dismentling plate, cone, strainer using screwpress machine, the pattern of the jobshop process used and produced are made to order. Each item through the same machine facility but has a different process flow, different order and processing time. so that it can result in idle time on a machine and cause a pile of work on another machine. The production scheduling used by the company currently still causes delays in completing orders, there are also a lot of work that has not been done due to the figure of makespan that is too big. This study aims to minimize makespan by using the Tabu Search Algorithm. The results of this study are that production scheduling experiences a time reduction after the Tabu Search algorithm is used where the initial conditions for 815.6 minutes or 13.59 hours to 758.2 minutes or 12.63 hours. The Relative Error found shows that makespan reduction is obtained between Tabu Search Algorithm and company method is 6.87%. while the magnitude of the Efficiency Index is 1.075.

2011 ◽  
Vol 110-116 ◽  
pp. 3899-3905
Author(s):  
Parviz Fattahi ◽  
Mojdeh Shirazi Manesh ◽  
Abdolreza Roshani

Scheduling for job shop is very important in both fields of production management and combinatorial optimization. Since the problem is well known as NP-Hard class, many metaheuristic approaches are developed to solve the medium and large scale problems. One of the main elements of these metaheuristics is the solution seed structure. Solution seed represent the coding structure of real solution. In this paper, a new solution seed for job shop scheduling is presented. This solution seed is compared with a famous solution seed presented for the job shop scheduling. Since the problem is well known as NP-Hard class, a Tabu search algorithm is developed to solve large scale problems. The proposed solution seed are examined using an example and tabu search algorithm.


2005 ◽  
Vol 8 (2) ◽  
pp. 145-159 ◽  
Author(s):  
Eugeniusz Nowicki ◽  
Czes?aw Smutnicki

Sign in / Sign up

Export Citation Format

Share Document