Penjadwalan Produksi Untuk Meminimalkan Waktu Produksi Dengan Menggunakan Metode Branch And Bound


  • Nunung Indra Lesmana



production scheduling, flow shop, branch and bound, makespan


Scheduling is the process of organizing, selecting and timing of the use of existing resources to produce output as expected within the expected time too. Problems faced by the company is determining the minimal production scheduling, as in the case of the production of the company in March, May and August 2015, delays occurred up to three business days, or approximately 14% compared to normal production time per month. The results of this study indicate if using methods Branch and Bound, the more processing time than the method the company trimmed. for example, in February 2016 when using the method of the company, the turnaround time is obtained 10584.385 minutes, whereas if the company uses Branch and Bound method can be reduced completion time of 789.66 minutes so that it becomes 9794.719 minutes, or 1.8 days faster than using companies.


Download data is not yet available.


V. A. Sari, D. D. Damayanti, and W. Juliani, "Penjadwalan Produksi Dengan Mempertimbangkan Ukuran Lot Transfer Batch Untuk Minimasi Makespan Komponen Isolating Cock Di Pt Pindad," Jurnal Rekayasa Sistem & Industri (JRSI), vol. 2, pp. 74-81, 2015.

M. Haming and M. Nurnajamuddin, Manajemen Produksi Modern. Jakarta: Bumi Aksara, 2007.

K. R. Baker and D. Trietsch, Principles of sequencing and scheduling: John Wiley & Sons, 2013.

I. Masudin, D. M. Utama, and F. Susastro, "Penjadwalan Flowshop Menggunakan Algoritma Nawaz Enscore HaM," Jurnal Ilmiah Teknik Industri, vol. 13, pp. 54-59, 2014.

M. Firdaus, I. Masudin, and D. M. Utama, "Penjadwalan Flowshop Dengan Menggunakan Simulated Annealing," Spektrum Industri, vol. 13, 2015.

Ł. Kruk, J. Lehoczky, and S. Shreve, "Second order approximation for the customer time in queue distribution under the FIFO service discipline," Annales Universitatis Mariae Curie-Sklodowska, sectio AI–Informatica, vol. 1, pp. 1-12, 2015.

M. Husen, I. Masudin, and D. M. Utama, "Penjadwalan Job Shop Statik Dengan Metode Simulated Annealing Untuk Meminimasi Waktu Makespan," Spektrum Industri, vol. 13, 2015.

Yusrofi, A. K. Garside, and D. Marsetiya U, "Penjadwalan Job Shop dengan Menggunakan Algoritma Penjadwalan Non Delay untuk Meminimasi Makespan Studi Kasus di Mebel Rieki," Teknik Industri, Universitas Muhammadiyah Malang, Malang, 2015.

S. Harto, A. K. Garside, and D. M. Utama, "penjadwalan produksi menggunakan algoritma jadwal non delay untuk meminimalkan makespan studi kasus di cv. Bima mebel," Spektrum Industri, vol. 14, 2016.

S. Altmeyer, S. M. Sundharam, and N. Navet, "The case for FIFO real-time scheduling," University of Luxembourg2016.

R. Ginting, Penjadwalan Mesin. Medan: Graha Ilmu, 2009.

K. R. Baker, Introduction to sequencing and scheduling: John Wiley & Sons, 1974.


How to Cite

Lesmana, N. I. (2017). Penjadwalan Produksi Untuk Meminimalkan Waktu Produksi Dengan Menggunakan Metode Branch And Bound. Jurnal Teknik Industri, 17(1), 42-50.