Optimasi Perencanaan Produksi pada Industri Pengalegan Ikan dengan Adanya Fleksibel Job Shop

Abstract

Perencanaan produksi pada perusahaan manufaktur salah satunya untuk memenuhi kebutuhan produksi bagi aktivitas produksi. Kebutuhan produksi perusahaan pengalengan ikan sifatnya tidak tentu dan merupakan masalah ketidakpastian. Industri pengalengan ikan proses manufakturnya termasuk dalam sistem fleksibel job shop (FJSS). Model optimasi FJSS merupakan persoalan sulit non polinomial (NP hard problem). Industri pengalengan ikan merupakan produk kedaluwarsa sehingga perusahaan perlu memperhatikan aspek kedaluwarsa agar produk yang sampai ke konsumen kondisinya baik. Selain itu perusahaan juga perlu mempertimbangkan ukuran lot agar biaya simpan dan biaya set up mesin optimal. Masalah FJSS dengan adanya penambahan persyaratan kedaluwarsa dan ukuran lot lebih menyebabkaan kesulitan. Selanjutnya dikembangkan suatu model matematika yang modelnya merupakan program integer campuran skala besar. Untuk menyelesaikan masalah tersebut dikembangkan konsep algoritma variabel super basis dieksploitasi.

Production planning for manufacturing companies is an aspect to meet production needs for production activities. The need of production in fish canning companies is uncertain and is a problem of uncertainty. The fish canning industry manufacturing process is included in the flexible job shop system (FJSS). The FJSS optimization model is a hard non-polynomial problem. Fish canning industry is an expired product so companies need to condiserate. expiration aspects in order for the that products that are delivered to consumers to be in a good condition. In addition, the company also needs to consider lot size so that the cost of storage and set-up are optimal. The FJSS problem, with the addition of expired aspect and lot size, makes it more difficult. Furthermore, a mathematical model is developed, where as the model is a large-scale mixed integer program. To solve this problem, the concept of exploiting superbasic variable algorithm is developed.