Implementasi Algoritma Branch and Bound dalam Penentuan Jumlah Produksi untuk Memaksimalkan Keuntungan

Yusrah Nazari Firdaus(1*), Nintia Litano Buyung(2), Agustira Hermansyah(3), Ranti Nurhadiyati(4), Ilham Falani(5), Elfitria Wiratmani(6)

(1) Universitas Indraprasta PGRI
(2) 
(3) 
(4) 
(5) 
(6) 
(*) Corresponding Author

Abstract


Optimal production planning in order to maximize profits, taking into account the limited resources they have. UKM Puguh Jaya is a mattress fabric convection business. There are several types of manufactured products including: 120 types of fabric, 140 types of fabric, the type of fabric 160. Production planning in SMEs can be seen as an integer programming model that aims to maximize profits, by determining the amount of production for each type and remember all the resources limited availability. The solution search for this model is done by the Branch and Bound algorithm. Based on the calculation results using QM software for Windows, it is known that the determination of the amount of production using branches and algorithms is bound to provide a profit increase of 18.7% compared to the profit from the previous UKM Puguh Jaya.


Keywords


Optimization, integer programming, algorithm Branch and Bound

Full Text:

PDF

References


Akram, S. A., dan Jaya, A. I. Optimalisasi Produksi Roti dengan Menggunakan Metode Branch and Bound (Studi Kasus Pada Pabrik Roti Syariah Bakery, Jl. Maleo, Lrg.VIII No. 68 Palu). Jurnal Ilmiah Matematika dan Terapan, 13(2) : 98-107. 2016.

Falani, I. Penentuan Nilai Parameter Metode Exponential Smoothing dengan Algoritma Genetik dalam Meningkatkan Akurasi Forecasting. Journal of Computer Engineering System and Science, 3(1) : 14–16. 2018.

Hillier, F. S., dan Lieberman, G. J. Operations Reasearch. Edisi ke-8. Terjemahan oleh Parama Kartika Dewa, dkk. Yogyakarta: ANDI. 2005.

Jiao, H. W., dkk. An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming. Journal of Applied Mathematics, Volume 2014 : 8. 2014.

Mehdizadeh, E., dan Jalili, S. An Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem. Journal of Optimization in Industrial Engineering, 12(1) : 167-172. 2019.

Puryani., dan Ristono, A. Penelitian Operasional. Yogyakarta: Graha Ilmu. 2012.

Taha, H. A. Operations Research: An Introduction. Edisi ke-8. United States of America: Prentice-Hall International, INC. 2007.

Taylor, B. W. Introduction to Management Science. Edisi ke-11. United States of America: Prentice-Hall International, INC. 2013.

Williams, H. P. The Problem with Integer Programming. Journal of Management Mathematics, 22(3) : 213-230. 2011.

Winston, W. L. Operations Research: Applications and Algorithms. Edisi Keempat. Canada: Brooks/Cole-Thomson Learning. 2004.




DOI: http://dx.doi.org/10.30998/string.v4i1.3717

Refbacks

  • There are currently no refbacks.


Copyright (c) 2019 Yusrah Nazari Firdaus, Nintia Litano Buyung, Agustira Hermansyah, Ranti Nurhadiyati, ilham falani, Elfitria Wiratmani

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

 

STRING (Satuan Tulisan Riset dan Inovasi Teknologi) indexed by:

Lisensi Creative Commons
Ciptaan disebarluaskan di bawah Lisensi Creative Commons Atribusi 4.0 Internasional.
View My Stats
Flag Counter