Penerapan Mixed Integer Programming dalam Pengoptimalan Keuntungan pada D’Laundry Factory Pekanbaru

Elfira Safitri, Sri Basriati, Khotimah Khotimah, Mohammad Soleh, Retno Ayu Puji Lestari, Nilwan Andiraja

Abstract


D’Laundry Factory is one of the businesses engaged in washing and ironing services. The problem that is often faced by laundry business owner is determining the amount of laundry items received by D’Laundry Factory to optimize maximum profits. The purpose of this study was to determine the combination of the number of laundry items received by the D’Laundry Factory to optimize profits using Mixed Integer Programming. The method used in this research is the Branch and Bound method. Based on the results of the study obtained that the DLaundry Factory Pekanbaru business received blanket 70 kg, bedcover 750 kg, dolls 20 kg, shoes 90 kg, bags 17,5 kg, helmets 30 kg, strollers 511 kg, curtains 200 kg, clothes 325.4 kg with a maximum profit of Rp.15.745.850.


Full Text:

PDF

References


Abdullah, M.H, Antoni, “Optimasi Perencanaan Produksi Wire Drawing menggunakan Mixed Integer Linear Programming (Studi Kasus di PT. SW)”, Matrik (Jurnal Manajemen dan Teknik), vol.19, no. 2, pp. 9–22, 2019.

Basriati, S, “Integer Linear Programming dengan Pendekatan Metode Cutting Plane dan Branch And Bound untuk Optimasi Produksi Tahu”, Jurnal Sains Matematika dan Statistika, vol.4, no. 2, pp. 95–104, 2018.

Dimyati. T, Dimyati A, Operation Research: Model-Model Pengambilan Keputusan, Sinar Baru Bandung: Bandung, 2006

Firdaus.Y.N, Litano. N, Hermansyah. A, Nurhadiyati. S, Falani. I, Wiratmani. E, “Implementasi Algoritma Branch And Bound dalam Penentuan Jumlah Produksi untuk Memaksimalkan Keuntungan”, String. vol.4, no. 1, pp. 4-9, 2019.

Lesmana.E, Badrulfalah, Bahtiar, “Aplikasi Model Mixed Integer Linear Programming untuk Pengolahan dan Pendistribusian Ikan pada Industri Perikanan (Studi Kasus: PT. Multi Mina Rejeki)”, Teorema, vol.3, no. 2, pp. 195–206, 2018.

Nur. W, Abdal. N.M, “Penggunaan Metode Branch and Bound dan Gomory Cut dalam Menentukan Solusi Integer Linear Programming”,Saintifik, vol.2, no. 1, pp. 9-15, 2016.

Safitri. E, Basriati.S, Najmi. H, “Penerapan Metode Branch and Bound dalam Optimalisasi Poduk Mebel (Studi Kasus: Toko Mebel di Jalan Marsan Panam)”, Kubik: Jurnal Publikasi Ilmiah Matematika, vol. 5, no. 1, pp. 43-53, 2020.

Safitri. E, Basriati.S, Yuhandi, “Penyelesaian Program Linier menggunakan Metode Simpleks Dua Fase dan Metode Quick Simpleks Dua Fase”,Wahana Matematika dan Sains: Jurnal Matematika, Sains dan Pembelajaannya, vol. 15, no. 3, pp. 57-71, 2021.

Syaputra. B.T, Lubis. R.S, Cipta.H, “Maksimasi Keuntungan Layanan Jasa Be Clean Laundry dengan Menerapkan Metode Branch and Bound”, Zeta- Math Journal, vol. 6, no. 2, pp. 1-5, 2021. 2021; 6(2): 1-5.

Supatimah.S, Andriani. S, “Optimasi Keuntungan dengan Metode Branch and Bound”, Aksioma, vol. 10, no. 1, pp. 13-23, 2019.

Suryawan. G. Penerapan Branch And Bound Algorithm Dalam Optimalisasi Produksi Roti”, vol. 5, no. 4, pp. 148-155, 2016.

Vielma. J.P, “Mixed Integer Linear Programming”, Social for Industrial and Applied Mathematics, vol.1, 2015.

Winston. W.L, Operation Research Applications and Algorithms, Fourth, 2003.




DOI: http://dx.doi.org/10.24014/jsms.v9i1.19755

Refbacks

  • There are currently no refbacks.


Jurnal JSMS

p-ISSN     : 2460-4542 (print)
e-ISSN     : 2615-8663 (online)
Alamat   : Program Studi Matematika
                   Fakultas Sains dan Teknologi, UIN Suska Riau
                   Jl. H.R Soebrantas, No. 155, Tampan, Pekanbaru.
Website : http://ejournal.uin-suska.ac.id/index.php/JSMS
e-mail    : jsmsfst@uin-suska.ac.id