Application of the greedy algorithm to maximize advantages of cutting steel bars in the factory construction
Article Sidebar
Main Article Content
Abstract
Indonesia is one of the countries that is currently exuberant with development issues in order to balance the ongoing process of global modernization. In the infrastructure development process, the developer will enter into a contract with the contractor. This study aims to analyze the performance of the greedy algorithm in optimizing steel cutting with maximum profit to construction companies. The methods used include literature studies, program design, and program trials where the algorithm used is a greedy one. From the results obtained, it is evident that the Greedy algorithm can provide optimal steel cutting solutions because it works by calculating and deviating from all available separation settings, so there is no need to recalculate if the program performs that step.
Article Details
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
References
V. Julianto, I. Saad, and S. Sukma, “Pengaruh Manajemen Waktu Penyelesaian Pekerjaan dan Mutu Pekerjaan Terhadap Kepuasan Pelanggan pada PT. Wijaya Karya (PERSERO), Tbk,” Jurnal Administrasi dan Management, vol. 9, no. 1, pp. 21–28, 2019. http://ejournal.urindo.ac.id/index.php/administrasimanajemen/article/view/337
A. Juniar, “Algoritma Optimasi Untuk Meminimalkan Sisa Pemotongan Bar Steel Pada Perusahaan Konstruksi,” Jurnal Teknologi dan Managemen, vol. 11, no. 1, Feb. 2013. http://p2m.stmi.ac.id/jurnal/detail_artikel/MjU/-algoritma-optimasi-untuk-meminimalkan-sisa-pemotongan-bar-steel-pada-perusahaan-konstruksi-
G. Hermawan, “Implementasi Algoritma Greedy Best First Search Pada Aplikasi Permainan Congklak Untuk Optimasi Pemilihan Lubang Dengan Pola Berfikir Dinamis,” in Seminar Nasional Teknologi Informasi dan Multimedia, Jan. 2012, pp. 1–6. https://repository.ubaya.ac.id/439/1/Hermawan_Implementasi%20Algoritma_Abstract_2012.pdf
A. V. Dereventsov and V. N. Temlyakov, “Biorthogonal Greedy Algorithms in convex optimization,” Appl Comput Harmon Anal, vol. 60, pp. 489–511, Sep. 2022. https://doi.org/10.1016/j.acha.2022.05.001
C. Wang, P. Ge, L. Sun, and F. Wang, “Research on user-side flexible load scheduling method based on greedy algorithm,” Energy Reports, vol. 8, pp. 192–201, Dec. 2022. https://doi.org/10.1016/j.egyr.2022.10.352
A. Ambarwari and N. Yanto, Penerapan Algoritma Greedy Pada Permasalahan Knapsack Untuk Optimasi Pengangkutan Peti Kemas. 2016. doi: 10.13140/RG.2.1.2775.6569. https://www.researchgate.net/publication/290797775_Penerapan_Algoritma_Greedy_Pada_Permasalahan_Knapsack_Untuk_Optimasi_Pengangkutan_Peti_Kemas
H. Subakti and W. Gata, “Optimasi Minimum Pola Baju Khas Kain Tenun Sarung Samarinda Menggunakan Algoritma Greedy,” Inspiration: Jurnal Teknologi Informasi dan Komunikasi, vol. 11, no. 1, p. 1, Jun. 2021. http://dx.doi.org/10.35585%2Finspir.v11i1.2602
E. N. Hayati and A. Yohanes, “Pencarian Rute Terpendek Menggunakan Algoritma Greedy,” in Prosiding Industrial Engineering National Conference (IENACO), 2014, pp. 391–397. https://publikasiilmiah.ums.ac.id/bitstream/handle/11617/4535/IENACO-051.pdf?sequence=1
H. Sunandar and Pristiwanto, “Optimalisasi Implementasi Algoritma Greedy dalam Fungsi Penukaran Mata Uang Rupiah,” Jurnal teknik Informatika UNIKA, vol. 4, no. 2, pp. 193–201, 2019. http://ejournal.ust.ac.id/index.php/JTIUST/article/view/588
H. Irwan, “Optimasi Penjadwalan Job Shop dengan Metode Algoritma Greedy,” PROFISIENSI: Jurnal Program Studi Teknik Industri, vol. 8, no. 2, pp. 164–176, Dec. 2020. https://doi.org/10.33373/profis.v8i2.2810