Optimalisasi Waktu Produksi, Jumlah Produksi, Dan Jalur Distribusi Pada Oulet Lazatto di Karawang

Cici Lestari; Rianita Puspa Sari

doi:10.32734/jsti.v23i1.4908

Authors

Cici Lestari Universitas Singaperbangsa Karawang
Rianita Puspa Sari Universitas Singaperbangsa Karawang http://orcid.org/0000-0002-0015-104X

DOI:

https://doi.org/10.32734/jsti.v23i1.4908

Keywords:

Branch and Bound, Hungarian, Minimum Spanning Tree

Abstract

The development of the food and beverage business is still recorded as a number of high developments in this world, the types of food and beverage in various forms have increased because food is one of the basic needs that must be met. Lazatto is a food industry that is engaged in various fields of fast food restaurants by producing processed chicken. The problems that occur at Lazatto are the inability to maximize the amount of chicken production, optimize the production time for employees, and the distribution channel to determine the shortest route to utilize raw materials. The purpose of this research is to analyze the optimization of working time using the Hungarian method or assignment, the amount of production using the Branch and Bound method, and the distribution line using the Minimum Spanning Tree method. The results showed that the optimal working time is 83 minutes or 1 hour 23 minutes / one time production, the amount of production in one production is 23 pieces with a combination of 5 pieces of geprek chicken, 4 pieces of sadas chicken, and 14 pieces of fried chicken, with The optimal total distance for the distribution of raw materials is 137.6 km.

Downloads

Download data is not yet available.

Author Biography

Rianita Puspa Sari, Universitas Singaperbangsa Karawang

Program Studi Teknik Industri

Fakultas Teknik

Universitas Singaperbangsa Karawang

References

V. Mandasari and B. Tama, “Analisis Kepuasan Konsumen Terhadap Restoran Cepat Saji Melalui Pendekatan Data Mining: Studi Kasus XYZ,” J. Generic, vol. 6, no. 1, pp. 25–28, 2011.

“Tren Data Pertumbuhan Industri Makanan dan Minuman, 2010 – 2020,” Data Industri, 2020. https://www.dataindustri.com/produk/data-pertumbuhan-industri-makanan-dan-minuman/.

Ristono dkk, Ekonomi Teknik, Edisi Pert. Yogyakarta: Graha Ilmu, 2011.

S. Bariasti and A. Lestari, “Penyelesaian Masalah Penugasan Menggunakan Metode Hungarian dan Pinalti,” Sains Mat. dan Stat., vol. 3, no. 1, p. 1, 2017.

E. Rahmawati, N. Satyahadewi, and F. Frans, “OPTIMALISASI MASALAH PENUGASAN MENGGUNAKAN METODE HUNGARIAN ( Studi kasus pada PT Pos Indonesia ( Persero ) Pontianak ),” vol. 04, no. 3, pp. 363–370, 2015.

U. Tarigan and M. F. Ardiansyah, “Penerapan Fuzzy Min-Max Mamdani Untuk Memprediksi Jumlah Produksi Di Pt.Xyz,” J. Sist. Tek. Ind., vol. 21, no. 2, pp. 43–51, 2019, doi: 10.32734/jsti.v21i2.1226.

I. Masudin, D. M. Utama, and F. Susastro, “Penjadwalan Flowshop Menggunakan Algoritma Nawaz Enscore Ham,” J. Ilm. Tek. Ind., vol. 13, no. 1, pp. 54–59, 2014.

M. Firdaus, I. Masudin, and D. M. Utama, “Penjadwalan Flowshop Dengan Menggunakan Simulated Annealing,” Spektrum Ind., vol. 13, no. 1, p. 27, 2015, doi: 10.12928/si.v13i1.1836.

K. R. Baker and D. Trietsch, Principles of sequencing and scheduling. 2013.

N. I. Lesmana, “Penjadwalan Produksi Untuk Meminimalkan Waktu Produksi Dengan Menggunakan Metode Branch And Bound,” J. Tek. Ind., vol. 17, no. 1, p. 42, 2017, doi: 10.22219/jtiumm.vol17.no1.42-50.

A. Akram, A. Sahari, and A. I. Jaya, “OPTIMALISASI PRODUKSI ROTI DENGAN MENGGUNAKAN METODE BRANCH AND BOUND (Studi Kasus Pada Pabrik Roti Syariah Bakery, Jl. Maleo, Lrg.VIII No. 68 Palu),” J. Ilm. Mat. Dan Terap., vol. 13, no. 2, pp. 98–107, 2016, doi: 10.22487/2540766x.2016.v13.i2.7209.

A. Rahmawati and Mulyono, “Minimum Spanning Tree Pada Jaringan Pendistribusian,” UNNES J. Math., vol. 4, no. 2, 2015.

G. J. Hillier, F.S., & Lieberman, Introduction to Operations Research (10TH ed.). New York: McGraw-Hill Education, 2012.

E. R Gultom, “Merefungsi Pengangkutan Laut Indonesia Melalui Tol Laut Untuk Pembangunan Ekonomi Indonesia Timur,” Develop, vol. 1, no. 2, 2017, doi: 10.25139/dev.v1i2.381.

H. Sarjono, “Determination of best route to minimize transportation costs using nearest neighbor procedure,” Appl. Math. Sci., vol. 8, no. 61–64, pp. 3063–3074, 2014, doi: 10.12988/ams.2014.43225.

D. A. R. Wulandari and F. N. Arifin, “Penentuan Rute Terpendek Jalur Distribusi Air Artesis Menggunakan Kruskal,” J-SAKTI (Jurnal Sains Komput. dan Inform., vol. 2, no. 2, p. 121, 2018, doi: 10.30645/j-sakti.v2i2.72.

H. Li, W. Mao, A. Zhang, and C. Li, “An improved distribution network reconfiguration method based on minimum spanning tree algorithm and heuristic rules,” Int. J. Electr. Power Energy Syst., vol. 82, pp. 466–473, 2016, doi: 10.1016/j.ijepes.2016.04.017.

S. Rizki, “Penerapan Teori Graf Untuk Menyelesaikan Masalah Minimum Spanning Tree (Mst) Menggunakan Algoritma Kruskal,” AKSIOMA J. Math. Educ., vol. 1, no. 2, 2012, doi: 10.24127/ajpm.v1i2.68.

Sugiyono, Metode Penelitian Kuantitatif Kualitatif dan R&D. Bandung: Alfabeta, 2012.

& L. Hilier, Frederich S., Introduction to Operation Research, Schaum Ser. McGraw-Hill, 1990.

M. Saiful, A. Rapi, and W. Flannery, “Penjadwalan Produksi Dengan Metode Branch and Bound Pada Pt . Xyz,” Bksti, pp. 2–6, 2014.

W. Nur and N. M. Abdal, “Penggunaan Metode Branch and Bound dan Gomory Cut dalam Menentukan Solusi Integer Linear Programming,” Saintifik, vol. 2, no. 1, pp. 9–15, 2017, doi: 10.31605/saintifik.v2i1.91.

M. Paendong and J. D. Prang, “Optimisasi Pembagian Tugas Karyawan Menggunakan Metode Hungarian,” J. Ilm. Sains, vol. 11, no. 1, p. 109, 2011, doi: 10.35799/jis.11.1.2011.52.

Nelfiyanti & Dermawan. D, “Penentuan Rute Distribusi Bbm Yang Optimal Menggunakan Metode Minimal Spanning Tree Dan Alogitma Heuristik Di PT. Telkomsel Area Kabupaten Pelalawan,” J. Tek. Ind. - Univ. Bung Hatta, vol. 1 No.1, pp. 58–69, 2012.