Maksimasi Keuntungan Layanan Jasa Be Clean Laundry Dengan Menerapkan Metode Branch And Bound

Authors

  • Bayu Teza Syahputra Universitas Islam Negeri Sumatera Utara Medan
  • Riri Syafitri Lubis Universitas Islam Negeri Sumatera Utara Medan
  • Hendra Cipta Universitas Islam Negeri Sumatera Utara Medan

DOI:

https://doi.org/10.31102/zeta.2021.6.2.1-5

Keywords:

Metode Branch and Bound, Integer Linear Programming, Keuntungan Maksimal.

Abstract

The purpose of this research is to find the maximize benefits from Be Clean Laundry business. In optimize laundry business by looking at the limited resources of the business used branch and bound method. Using the branch and bound method assisted by QM software in more optimal laundry, coat 53 kg, doll 32 kg, blanket 95 kg, bedcover 105 kg, gordyn 91 kg, and clothes 805 kg with a profit of Rp. 4.027.000, while the previous profit based on estimate made by the laundry Owner of Rp. 4.000.000  increase of 0,7 %.

Downloads

Download data is not yet available.

References

Angeline, I, dan Tarigan, G. (2014). Penerapan Metode Branch andBound Dalam Menentukan Jumlah Produksi Optimum Pada CV. XYZ. Saintia Matematika (pp. 137– 145).

Anwar, C. (2014). Hakikat Manusia Dalam Pendidikan Sebuah Tinjauan. Filosofis. Yogyakarta: SUKA-Press.

Aminuddin. (2005), Prinsip-prinsip Riset Operasi, Jakarta: Erlangga.

Belotti, P. (2013). Bound Reduction Using Pairs Of Linear inqualities. Department Of Mathematical Sciences, Clemson University.

Bonami P., Lee J., Leyffer S., dan Wachter A. (2011). More Branch and Bound Experiments in Convex Nonlinear Integer Programming.

Syafwan, H. (2018). Penerapan Metode Branch And Bound Dalam Penyelesaian Masalah Pada Integer Programming (pp. 89-96).

Wijaya, A. (2013). Pengantar Riset Operasi. 3 Ed. Jakarta: Penerbit Mitra Wacana Media, 2013.

Downloads

Published

2021-06-23

How to Cite

Syahputra, B. T., Lubis, R. S., & Cipta, H. (2021). Maksimasi Keuntungan Layanan Jasa Be Clean Laundry Dengan Menerapkan Metode Branch And Bound. Zeta - Math Journal, 6(2), 38–42. https://doi.org/10.31102/zeta.2021.6.2.1-5

Issue

Section

Articles