OPTIMASI KEUNTUNGAN PRODUK KERIPIK SINGKONG MENGGUNAKAN METODE BRANCH AND BOUND DAN ALGORITMA GENETIKA PADA GNP SNACK

OPTIMASI KEUNTUNGAN PRODUK KERIPIK SINGKONG MENGGUNAKAN METODE BRANCH AND BOUND DAN ALGORITMA GENETIKA PADA GNP SNACK

GNP Snack company has problems in making raw material inventories which are sometimes not enough for 0.5 tons of cassava chips to fulfill demand. This will affect the production process carried out every day. Production needs per day 1 - 1.5 tons of production of cassava chips. The company benefits...

Full description

Bibliographic Details
Main Authors: Sarif Hasan, Yohanes Anton Nugroho
Format: Article
Language:English
Published: Industrial Engineering Department Faculty of Industrial Technology Universitas Ahmad Dahlan 2020-04-01
Series:Spektrum Industri: Jurnal Ilmiah Pengetahuan dan Penerapan Teknik Industri
Subjects:
benefits optimization
branch and bound
genetic algorithm
Online Access:http://journal.uad.ac.id/index.php/Spektrum/article/view/13299

Internet

http://journal.uad.ac.id/index.php/Spektrum/article/view/13299

Similar Items