Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal STRING (Satuan Tulisan Riset dan Inovasi Teknologi)
Nintia Litano Buyung
Unknown Affiliation
Computer Science & IT Mathematics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Optimalisasi Keuntungan dengan Menggunakan Algoritma Branch and Bound pada PT XYZ Nintia Litano Buyung; Endang Suhendar
STRING (Satuan Tulisan Riset dan Inovasi Teknologi) Vol 5, No 1 (2020)
Publisher : Universitas Indraprasta PGRI Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (62.405 KB) | DOI: 10.30998/string.v5i1.5615

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.
Implementasi Algoritma Branch and Bound dalam Penentuan Jumlah Produksi untuk Memaksimalkan Keuntungan Yusrah Nazari Firdaus; Nintia Litano Buyung; Agustira Hermansyah; Ranti Nurhadiyati; Ilham Falani; Elfitria Wiratmani
STRING (Satuan Tulisan Riset dan Inovasi Teknologi) Vol 4, No 1 (2019)
Publisher : Universitas Indraprasta PGRI Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (422.007 KB) | DOI: 10.30998/string.v4i1.3717

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.
Co-Authors Agustira Hermansyah Elfitria Wiratmani Endang Suhendar Ilham Falani Ranti Nurhadiyati Yusrah Nazari Firdaus