Analisis Sensitivitas Model Goal Programming Pada Optimasi Produksi Roti Menggunakan Metode Branch and Bound

Rindawati Ahmad, Muhammad Rifai Katili, Sri Lestari Mahmud, Djihad Wungguli, La Ode Nashar

Abstract


Sya'qila Bakery is a manufacturing industry that produces bread in five flavor variants. The planning carried out by Sya'qila Bakery in the bread production process is considered suboptimal due to the limitation in the quantity of production for each flavor variant, resulting in occasional shortages of raw materials. Additionally, the order production process requires a long total completion time (makespan), resulting in delays in production completion (meaning tardiness). This research aims to optimize the total completion time, the average lateness, the use of raw materials, and production revenue. In this research, the Goal Programming model is utilized with the Branch and Bound method. The analysis results with the Goal Programming model using the Branch and Bound method obtain an optimal solution, which includes an excess of 36 minutes in total completion time (makespan), an excess of 6 minutes in average lateness (mean tardiness), no excess in the availability of raw materials, and zero sales revenue shortfall. Sensitivity analysis results indicate that bread production at Sya'qila Bakery will remain optimal if changes occur in the production completion time, production delay time, and raw material availability, as long as these changes remain within their tolerance limits.

Keywords


Sensitivity analysis; Branch and Bound; Goal Programming; Makespan

Full Text:

PDF

References


D. Handayani, A., Ramdani, S. H., & Taurusyanti, “Analisis Penjadwalan Produksi Pada PT. Kurnia Dwimitra Sejati,” J. Online Mhs. Bid. Manaj., pp. 1–15, 2021.

A. R. Brahmana and T. S. Sinaga, “Optimasi Produksi dengan Program Dinamis pada Pabrik Fractination and Refinery Factory (FRF) PT. XYZ,” vol. 3, no. 4, pp. 49–54, 2013.

I. Linda, F. H. Badruzzaman, P. Matematika, F. Matematika, and P. Alam, “Optimalisasi Jumlah Produksi Celana Jeans untuk Memaksimalkan Keuntungan dengan Menggunakan Metode Branch and Bound,” Pros. Mat., vol. 6, no. 2, pp. 35–42, 2020.

A. K. Garside, D. M. Utama, and M. R. Arifin., “Penjadwalan Produksi Flowshop Menggunakan Algoritma Branch And Bound Untuk Meminimasi Mean Tardiness,” vol. 5, no. 1, pp. 1–5, 2020.

Siswanto, Operations Research Jilid 1. Jakarta: Erlangga, 2007.

S. Salunkhe, S. Guessasma, V. Naranje, and S. Aly, “Binary goal programming model for optimizing tire selection using branch and bound algorithm,” Int. J. Simul. Multidiscip. Des. Optim., vol. 12, no. 8, pp. 1–11, 2021, doi: 10.1051/smdo/2021008.

Y. N. Firdaus et al., “Implementasi Algoritma Branch and Bound Dalam,” String, vol. 4, no. 1, pp. 4–9, 2019.

Nurjanna, Fardinah, and D. Ekawati, “Penerapan Algoritma Branch and Bound dalam Optimalisasi Produk Tenun Sa’be,” J. Math. Theory Appl., vol. 4, no. 1, pp. 8–14, 2022.

D. M. N. Faisal, H. B. P. P, and S. Sunarya, “Perhitungaan Metode Goal Programming Untuk Optimasi Perencanaan Produk Keripik Singkong Pada PT . Cassava Chips,” Bull. Appl. Ind. Eng. Theory, vol. 2, no. 1, pp. 16–20, 2020.

D. Dali, Y. A. Lesnussa, V. Yan, and I. Ilwaru, “Optimalisasi Keuntungan Menggunakan Metode Branch and Bound Pada Produksi Spring Bed,” vol. 12, no. 2, pp. 78–88, 2022, doi: 10.24843/JMAT.2022.v12.i02.p151.

M. Ismail, N. Achmad, and S. L. Mahmud, “Analisis Sensitivitas dalam Optimasi Keuntungan Produksi Kue Ulang Tahun dengan Metode Branch and Bound,” Euler J. Ilm. Mat. Sains dan Teknol., vol. 10, no. 2, pp. 282–291, 2022, doi: 10.34312/euler.v10i2.15307.

K. V. Adtria, K. Kamid, and N. Rarasati, “Analisis Sensitivitas dalam Optimalisasi Produksi Makaroni Iko Menggunakan Linear Programming,” Imajiner J. Mat. dan Pendidik. Mat., vol. 3, no. 2, pp. 174–182, 2021, doi: 10.26877/imajiner.v3i2.8098.

V. Devani, N. Andriani, B. Sembiring, and M. Wadhiah, “Optimasi Produksi Crumb Rubber dengan Menggunakan Metode Branch And Bound Grafik Perbandingan Hasil dan Target Produksi Karet,” Semin. Nas. Teknol. informasi, Komun. dan Ind., vol. 14, pp. 191–198, 2022.

Z. Ayunda, W. Winarno, B. Nugraha, and A. Momon, “Analisa Optimalisasi Keuntungan dengan Integer Linear Programming dan Metode Branch and Bound pada Toko Bunga QuinnaStory,” J. Ind. Serv., vol. 6, no. 2, pp. 99–104, 2021.

N. F. Al Muzakki, “Optimasi Produksi Gerabah dengan Metode Round Off dan Branch and Bound Terhadap UKM Dewi Sri Teracotta,” vol. 09, no. 02, pp. 251–259, 2021.

P. Subagyo, M. Asri, and T. Hani Handoko, Dasar-dasar operations research. Yogyakarta : BPFE, 1993.




DOI: https://doi.org/10.37905/euler.v11i2.22299

Refbacks

  • There are currently no refbacks.


Copyright (c) 2023 Rindawati Ahmad, Muh Rifai Katili, Sri Lestari Mahmud, Djihad Wungguli, La Ode Nashar

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi has been indexed by:

                         EDITORIAL OFFICE OF EULER : JURNAL ILMIAH MATEMATIKA, SAINS, DAN TEKNOLOGI

 Department of Mathematics, Faculty of Mathematics and Natural Science, Universitas Negeri Gorontalo
Jl. Prof. Dr. Ing. B. J. Habibie, Tilongkabila, Kabupaten Bone Bolango 96554, Gorontalo, Indonesia
 Email: euler@ung.ac.id
 +6287743200854 (Call/SMS/WA)
 Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi (p-ISSN: 2087-9393 | e-ISSN:2776-3706) by Department of Mathematics Universitas Negeri Gorontalo is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.  Powered by Public Knowledge Project OJS.