Penjadwalan Produksi untuk Meminimasi Makespan dengan Implementasi Algoritma Fuzzy Logic

Abstract

PT. XYZ is one of the manufacturing companies engaged in the production of plastic packaging, with 3 types of production in general, namely: joly, clear plastic cups, and plastic printing cups. The production transformation process itself is based on a flow shop, which is a product that has different specifications but the same order of production. In carrying out its activities PT. XYZ makes products based on orders from consumers (Make to order). Based on company demand data, clear plastic cups are one of the most products. PT. Scheduling system XYZ currently uses the First Come First Serve (FCFS) rule. In the FCFS rule, it does not question the duration or duration of the process. Orders that arrive first will be a priority in their production. If there are orders that come together then the orders will be done through the queue. Such a scheduling model is often not profitable for orders that require a short processing time because if the order is behind the queue it will result in long idle times before being processed on the factory floor. As a result, the total time for completing all orders (makespan) on the production floor, as well as the amount of work in process at several work stations. The available one cannot meet the duedate deadline. Tujuan umum yang ingin dicapai adalah untuk mendapatkan model penjadwalan yang mampu memberikan nilai makespan yang minimum dengan menggunakan metode Fuzzy. Metode penjadwalan produksi yang memberikan hasil yang optimal adalah Algoritma Pemrograman Fuzzy dengan Total makespan sebesar 20091,71 menit = 334,99 jam = 13,95 ≈ 14 hari sedangkan makepan yang diperoleh dari metode penjadwalan aktual yang digunakan di PT. XYZ dengan ketentuan First Come First Melayani sebesar 24480,71 menit = 408,01 jam = 17 hari.