Analisa Optimalisasi Keuntungan dengan Integer Linear Programming dan Metode Branch and Bound pada Toko Bunga QuinnaStory

Ayunda Zuserain, Winarno Winarno, Billy Nugraha, Ade Momon

Abstract


QuinnaStory Flower Shop produces flower buckets with 2 types of sizes, namely small flower buckets and large flower buckets. With current problems in the form of limited resources, lack of automatic cutting machines, manpower and optimization of production planning. This study aims to determine how to solve the search for maximum profit from production. The optimal solution based on the problem at QuinnaStory Flower Shop can be solved by integer linear programming approach. The method used in this research is the simplex method to look for maximum benefits. The results obtained required the production of 36 small flower buckets and 31.5 large flower buckets to obtain a maximum profit of Rp. 2,790,000, - However, the results of product production / day are still in decimal form. Therefore, it is continued with the branch and bound method to find non-decimal results. The result of the settlement is required to produce 36 small flower buckets and 31 large flower buckets / day to get a maximum profit of IDR 2,764,000.


Keywords


Integer Linear Programming, Branch and Bound, Software Lingo

Full Text:

PDF

References


E. &. R. Y. Ahman, Pengantar Teori Ekonomi Mikro, Bandung: Ekonomi dan Koperasi, 2007.

S. Adiningsih, Ekonomi Mikro, Yogyakarta: BPFE Yogyakarta, 1999.

H. Siringoringo, Seri Teknik Riset Operasional. Pemrograman Linear., Yogyakarta: Penerbit Graha Ilmu, 2005

D. T. Syaifuddin, RISET OPERASI (APLIKASI QUANTITATIVE ANALYSIS FOR MANAGEMENT), vol. 3(1), Malang: Percetakan CV Citra, 2011, pp. 1-6.

S. Basriati, "INTEGER LINEAR PROGRAMMING DENGAN PENDEKATAN METODE CUTTING PLANE DAN BRANCH AND BOUND UNTUK OPTIMASI PRODUKSI TAHU," Vols. 4, No2, 2018

G. J. M. A. &. C. M. Lim, "Multi-Objective Nurse Scheduling Model with Patient Workload and Nurse Preferences," Journal of Management, pp. 149-160, 2012.

M. A. K. A.-B. M. A. &. B. A. L. Awadallah, "Nurse Scheduling Using Harmony Search Sixth International Conference on Bio Inspired Computting," no. Chigaco: Theories and Applications., pp. 58-63, 20122.

M. N. &. S. S. S. Azaiez, "Goal Programming Model for Nurse Scheduling," Elsevier: Computer and Operation Research, pp. 491- 507, 2005.

S. J. M. A. &. C. M. J. Kim, "A Strategy to Improve Perfomance of Genetic Algorithm for Nurse Scheduling Problem," International Journal of Software Engineering and Its Application, pp. 53-62, 2014.

K. A. &. T. J. M. Downsland, "Solving a Nurse Scheduling Problem with Knapsack, Network, and Tabu Search," Journal of the Operational Research Society, pp. 825-833, 2000.

J. F. &. P. H. W. Bard, "Preference Scheduling for Nurses Using Column Generation," European Journal of Operation Research, pp. 510-534, 2005.

L. J. T. &. L. Y. Y. Castillo, "Workforce Scheduling with Multiple Objectives," European Journal of Operational Research, pp. 162- 170, 2009.

F. H. B. Y. T. &. I. M. Amira, " NON-SEPARABLE QUADRUPLE LIFTING STRUCTURE FOR FOUR-DIMENSIONAL INTEGER WAVELET TRANSFORM WITH REDUCED ROUNDING NOISE.," 2011.

I. G. d. I. T. A. Sianturi, "Optimasi Jumlah Produksi CPO Dengan Biaya Minimum Melalui Pendekatan Linear Programming Di PT. XYZ," 2013.

A. R. S. Raudhatul Jannah A.M, "Optimasi Hasil Produksi Tahu dan Tempe dengan Metode Branch and Bound dan Metode Cutting Plane," vol. 1, 2018.

J. Naoum-sawaya, "Recursive Central Rounding for Mixed Integer Programs," 2014.

T. Y. d. M. I. F. Hamzah, "Non- Separable Four-Dimensional Integer Wavelet Transform with Reduced Rounding Noise," 2017.

H. W. d. J. Hooker, "Integer Programming of Projection," 2016.

S. Basriati, "INTEGER LINEAR PROGRAMMING DENGAN PENDEKATAN METODE CUTTING PLANE DAN BRANDCH AND BOUND UNTUK OPTIMASI PRODUKSI TAHU," vol. 4 No. 2, no. Jurnal Sains Matematika dan Statistika, 2018.




DOI: http://dx.doi.org/10.36055/62003

Refbacks

  • There are currently no refbacks.


  is supported by