Optimisasi Keuntungan Produksi Kue pada Cake By Cece Menggunakan Algoritma Branch and Bound

Eva Kosasih; Ni Wayan Rusniati; Ni Ketut Tari Tastrawati

doi:10.62383/algoritma.v3i5.748

Authors

Eva Kosasih Universitas Udayana
Ni Wayan Rusniati Universitas Udayana
Ni Ketut Tari Tastrawati Universitas Udayana

DOI:

https://doi.org/10.62383/algoritma.v3i5.748

Keywords:

Branch and Bound algorithm, integer linear programming, production optimization, MSMEs, Cake by Cece

Abstract

This study aims to optimize the cake production profit at Cake by Cece using the Branch and Bound algorithm. The data used include raw material requirements per batch, daily raw material availability, and selling prices for three types of cakes: Cookies, Brownies, and Cinnamon Roll. The optimization model is formulated as an Integer Linear Programming problem with the objective of maximizing total daily profit. The model is solved using the simplex method followed by the Branch and Bound algorithm to obtain valid integer solutions. The results indicate that the optimal production combination is 2 batches of Cookies, 2 batches of Brownies, and 3 batches of Cinnamon Roll, yielding a maximum profit of IDR 233,000 per day. This solution satisfies all raw material constraints and is feasible for daily operational implementation. This study provides quantitative recommendations to support production decision-making in culinary sector MSMEs.

Downloads

Download data is not yet available.

References

Badan Pusat Statistik. (2024). Laporan statistik ekonomi Indonesia triwulan pertama 2024. https://www.bps.go.id

Dali, M., Lesnussa, T., & Ilwaru, S. (2022). Optimalisasi produksi menggunakan algoritma Branch and Bound pada PT Satelit Maluku. Jurnal Sistem dan Teknologi Industri, 7(1), 45-53.

Falahiyah, N. (2020). Optimalisasi produksi pada UMKM Bakso Bening Sahabat menggunakan metode linear programming (Skripsi). Universitas Islam Negeri Jakarta.

Hillier, F. S., & Lieberman, G. J. (2010). Introduction to operations research (9th ed.). McGraw-Hill.

Khotimah, S., Wijayanti, D., & Setyaningsih, R. (2021). Penerapan algoritma Branch and Bound dalam meningkatkan efisiensi produksi UKM. Jurnal Teknologi Industri, 12(3), 210-219.

Meliana, R., Sari, D. P., & Wijaya, A. (2019). Optimisasi produksi roti menggunakan algoritma Branch and Bound pada CV Sedap Sari Bakery. Jurnal Teknologi Industri, 15(2), 123-130.

Sakdiah, S. N. T. (2024). Optimalisasi produksi menggunakan linear programming pada UMKM Rafif Nugget (Skripsi). Universitas Medan Area.

Sari, I. N. (2019). Optimisasi jumlah produksi pada UMKM Raina Kersen dengan metode linear programming. Jurnal Media Teknologi, 6(1), 67-74.

Supriyanto, A., & Khusnul, A. (2022). Penerapan metode Branch and Bound untuk efisiensi produksi UMKM sektor makanan. Jurnal Manajemen Operasi, 10(1), 45-53.

Taha, H. A. (2017). Operations research: An introduction (10th ed.). Pearson.

Wibowo, A., Widya, D., & Imani, R. (2018). Penjadwalan mesin menggunakan Branch and Bound di PT Japfa Comfeed Indonesia Tbk. Jurnal Teknik Industri, 9(2), 89-97.

Winston, W. L. (2004). Operations research: Applications and algorithms (4th ed.). Thomson Brooks/Cole.