STRING (Satuan Tulisan Riset dan Inovasi Teknologi)
Vol 5, No 1 (2020)

Optimalisasi Keuntungan dengan Menggunakan Algoritma Branch and Bound pada PT XYZ

Nintia Litano Buyung (Unknown)
Endang Suhendar (Universitas Indraprasta PGRI)



Article Info

Publish Date
05 Aug 2020

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.

Copyrights © 2020






Journal Info

Abbrev

STRING

Publisher

Subject

Computer Science & IT Mathematics

Description

STRING (Satuan Tulisan Riset dan Inovasi Teknologi) focuses on the publication of the results of scientific research related to the science and technology. STRING publishes scholarly articles in Science and Technology Focus and Scope Covering: 1. Computing and Informatics 2. Industrial Engineering ...