Optimalisasi Keuntungan dengan Menggunakan Algoritma Branch and Bound pada PT XYZ

Nintia Litano Buyung; Endang Suhendar

doi:10.30998/string.v5i1.5615

Optimalisasi Keuntungan dengan Menggunakan Algoritma Branch and Bound pada PT XYZ

Nintia Litano Buyung^(1*), Endang Suhendar⁽²⁾

(1)
(2) Universitas Indraprasta PGRI
(*) Corresponding Author

Abstract

In maximizing the profits to be obtained the company needs optimal production planning. The plan considers the resources of the company. PT XYZ is a furniture company. This research focuses on optimizing production planning on the manufacture of door products at PT. XYZ. There are several types of products issued in: D1 type door, D2 type door, D3 type door, and D4 type door. Production planning at PT. XYZ can be seen as an integer program model, which is a method related to optimizing resources to increase profits. Optimization is done by determining the amount of production for each type and each calculating existing resources. The solution search for this model is done by the Branch and Bound algorithm. Based on the calculation results using QM software for Windows, the amount corresponding to production is obtained by using Branches and Bound giving an increase of 36.5% compared to the acquisition of PT. XYZ before.

Keywords

Optimization; integer programming; Branch and Bound

Full Text:

PDF

References

S. Assauri, “Manajemen Produksi dan Operasi,” Jakarta Lemb. Penerbit Fak. Ekon. Univ. Indones., 2008.

Wayne L. Winston, Operations Research: Applications and Algorithms, Forth Edition. 2004.

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., 2016, doi: 10.22487/2540766x.2016.v13.i2.7209.

H. W. Jiao, F. H. Wang, and Y. Q. Chen, “An effective branch and bound algorithm for minimax linear fractional programming,” J. Appl. Math., vol. 2014, 2014, doi: 10.1155/2014/160262.

H. P. Williams, “The problem with integer programming,” IMA J. Manag. Math., vol. 22, no. 3, pp. 213–230, 2011, doi: 10.1093/imaman/dpq014.

Y. N. Firdaus, N. L. Buyung, A. Hermansyah, R. Nurhadiyati, I. Falani, and E. Wiratmani, “Implementasi Algoritma Branch and Bound dalam Penentuan Jumlah Produksi untuk Memaksimalkan Keuntungan,” STRING (Satuan Tulisan Ris. dan Inov. Teknol., 2019, doi: 10.30998/string.v4i1.3717.

I. Falani, “Penentuan Nilai Parameter Metode Exponential Smoothing Dengan Algoritma Genetik Dalam Meningkatkan Akurasi Forecasting,” Comput. Eng. Sci. Syst. J., vol. 3, no. 1, p. 14, 2018, doi: 10.24114/cess.v3i1.8268.

E. Mehdizadeh and S. Jalili, “An algorithm based on theory of constraints and branch and bound for solving integrated product-mix-outsourcing problem,” J. Optim. Ind. Eng., vol. 12, no. 1, pp. 167–172, 2019, doi: 10.22094/JOIE.2018.664.1429.

B. W. Taylor, Introduction to Management Science 11e, vol. 58, no. 3. 2013.

D. Reyniers and H. A. Taha, “Operations Research: An Introduction (4th Edition),” The Journal of the Operational Research Society, vol. 40, no. 11. p. 1054, 1989, doi: 10.2307/2583144.

DOI: http://dx.doi.org/10.30998/string.v5i1.5615