Identical Parallel Machine Scheduling to Minimize Makespan Using Suggested Algorithm Method at XYZ Company
Abstract
XYZ company produce the various shape of motor spare parts product. The company has three identical parallel spot welding machines that use a random method of production scheduling, based on machine capacity without any sequence of jobs, and only use daily production targets given to operators. Based on the data, the actual scheduling of the machines has a very large completion time difference between each machine, or the machine loading is uneven. As a result, the makespan becomes longer with a value of 440000 seconds (26 days). This research aims to minimize the existing makespan by giving proposed scheduling, using the suggested algorithm method, which has a small number of iterations and has an optimal result. The method begins with the longest processing time sequence rule which is used as the upper bound for the first iteration, then continued to calculate the lower bound and machine workload. The calculation stops at the 15th iteration because the completion time value exceeds the lower and upper bound so that the optimal scheduling taken is scheduled in the 14th iteration with a makespan value of 914412 seconds (16 days). The proposed scheduling can minimize the makespan from the actual schedule by 38%.
References
[2] N. I. Lesmana, “Penjadwalan Produksi Untuk Meminimalkan Waktu Produksi Dengan Menggunakan Metode Branch and Bound,” J. Tek. Ind., vol. 17, no. 1, p. 42, 2017
[3] D. M. Utama, “Algoritma LPT-Branch and Bound Pada Penjadwalan Flexible Flowshop untuk Meminimasi Makespan,” PROZIMA (Productivity, Optim. Manuf. Syst. Eng., vol. 2, no. 1, p. 20, 2019
[4] H. Wibowo, “Penjadwalan Mesin Screw Press Stasiun Kempa Pada Produksi Cpo (Crude Palm Oil) Dan Kernel Dengan Menggunakan Metode Indikator,” Spektrum Ind., vol. 14, no. 1, p. 45, 2016
[5] M. D. Prasetio, “An Approaching Machine Learning Model: Tile Inspection Case Study,” Int. J. Innov. Enterp. Syst., vol. 4, no. 01, pp. 12–22, 2020
[6] V. Gaspersz, Production Planning and Inventory Control Berdasarkan Pendekatan Sistem Terintegrasi MRP II dan JIT menuju Manufakturing 21. Jakarta: Gramedia Pustaka Utama, 2005.
[7] R. Ginting, Penjadwalan Mesin. Yogyakarta: Graha Ilmu, 2009.
[8] D. Setiya Widodo, P. Budi Santoso, and E. Siswanto, “Pendekatan Algoritma Cross Entropy-Genetic Algorithm Untuk Menurunkan Makespan Pada Penjadwalan Flow Shop,” J. Eng. Manag. Industial Syst., vol. 2, no. 1, pp. 41–49, 2014
[9] Y. Muharni, E. Febianti, and N. N. Sofa, “Minimasi Makespan Pada Penjadwalan Flow Shop Mesin Paralel Produk Steel Bridge B-60 Menggunakan Metode Longest Processing Time Dan Particle Swarm Optimization,” J. Ind. Serv., vol. 4, no. 2, 2019, doi: 10.36055/jiss.v4i2.5154.
[10] R. I. Safitri, “Analisis Sistem Penjadwalan Produksi Berdasarkan Pesanan Pelanggan dengan Metode FCFS, LPT, SPT dan EDD Pada PD. X,” J. Optimasi Tek. Ind., vol. 1, no. 2, p. 26, 2019
[11] Y. Mauergauz, Advanced Planning and Scheduling in Manufacturing and Supply Chains. Switzerland: Springer, 2016.
[12] Y. German, I. Badi, A. Bakir, and A. Shetwan, “Scheduling to Minimize Makespan on Identical Parallel Machines,” Int. J. Sci. Eng. Res., vol. 7, no. 3, 2016.
[13] M. H. Riaja, P. P. Suryadhini, and A. Oktafiani, “PENJADWALAN IDENTICAL PARALELL MACHINE MENGGUNAKAN METODE SUGGESTED ALGORITHM DAN BRANCH AND BOUND UNTUK MEMINIMASI MAKESPAN PADA PROSES INJECTION MOLDING DI CV. GRADIENT,” e-Proceeding Eng., vol. 6, pp. 6565–6572, 2019.
[14] H. Habiba, A. Hassam, Z. Sari, C. M. Amine, and T. Souad, “Minimizing Makespan on Identical Parallel Machines,” Proc. - 2019 3rd Int. Conf. Appl. Autom. Ind. Diagnostics, ICAAID 2019, no. September, pp. 25–27, 2019
[15] M. Widyastuti, E. Irawan, and A. P. Windarto, “Penerapan Metode Gantt Chart dalam Menentukan Penjadwalan Kinerja Karyawan,” Pros. Semin. Nas. Ris. Inf. Sci., vol. 1, no. September, p. 557, 2019
[16] T. D. SANTOSO, D. FAUJI, and R. KURNIAWAN, “Metode Cpm & Gantt Chart Untuk Penjadwalan Dan Analisis Aktivitas Kritis Pada Proyek Pembangunan Perumahan Griya Utama …,” no. 2017, 2020.
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
