Penerapan Branch and Bound Algorithm Dalam Optimalisasi Produksi Roti

Abstract

Companies which engaged in production activities such as Ramadhan Bakery would want optimal profit in their every production. The aim of this study was to find optimal profit and optimal combination of bread production (original chocolate bread, extra chocolate bread, rounding chocolate bread and mattress chocolate bread) that was produced by Ramadhan Bakery by applying Branch and Bound Algorithm method. Branch and Bound Algorithm is one method to solve Integer Programming’s problems other than Cutting Plane method. Compared with Cutting Plane method, Branch and Bound Algorithm method is more effective in determining the optimal value. As the result of this study showed that to get optimal profit, Ramadhan Bakery should produce 360 pcs of original chocolate bread, 300 pcs of extra chocolate bread, 306 pcs of rounding chocolate bread and 129 pcs of mattress chocolate bread with optimal profit amounts Rp. 1.195.624,00.. The profit will increase amounts 25,2 % than before.

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

“…Jika solusi yang diharapkan benilai integer, maka kembali ke Langkah d. Tetapi jika solusi yang diharapkan bernilai noninteger maka kembali ke Langkah c. Memeriksa solusi optimal. Jika subpersoalan sudah bernilai integer, maka dipilih nilai terbesar untuk kasus maksimum dan dipilih nilai terkecil untuk kasus minimum [11].…”

Analysis of Taklinear Performance and Integer Linear Programming Models in Nurses Scheduling Problems

“…This method divides the problem into sub-problems that lead to solutions by forming a search tree structure and limiting it to achieve an optimal solution (Sumathi, 2016) . Branch and Bound algorithm procedures are carried out repeatedly to form a search tree and bounding process by determining the upper bound and lower bound in finding the optimal solution (Suryawan, Tastrawati, & Sari, 2016) Literature Review (Angeline, Iryanto, & Tarigan, 2014) apply the branch and bound method in determining the optimum amount of production at Cv. Xyz, in his research, reviewed based on the amount of raw material inventory, market demand, profits, and time of manufacture of each pant.…”

“…In the process of completion, the branch and bound method require a large number of simplex iterations and a log time but more convergence is guaranteed. (Suryawan, Tastrawati, & Sari, 2016) Applying the branch and bound algorithm method in optimizing bread production results in a 25.2% increase in profits through calculations by applying the branch and bound algorithm. (Rafeek & Siswanto, 2015) Make an ITS course schedule and then develop an integer programming (ILP) method to solve NP-Complete problems using LINGO software.…”