Penjadwalan Produksi Flow Shop untuk Meminimalkan Makespan dengan Metode Pour, Pemrograman Dinamis dan Branch and Bound di CV. Bonjor Jaya

Dwi Agustina Kurniawati

Abstract


Scheduling is defined as the process of allocating resources to select a set of tasks within a certain period. CV. Bonjor Jaya implements scheduling with the First Come First Serve (FCFS) system. This study aims to find the sequence combination of products that have a minimum makespan value using the Pour method, Dynamic Programming and Branch and Bound. The Pour method produces a combination of 3-4-2-1 with an makespan value of 89814.59 seconds. Dynamic Programming Method produces a combination of 3-1-2-4 sequence with an makespan value of 90012.03 seconds. The Branch and Bound method produces a sequence combination of 3-4-2-1 and 3-2-4-1 with an makespan value of 89814.59 seconds. Based on the makespan value obtained, the Pour and Branch and Bound methods are the most appropriate method to be applied in the CV. Bonjor Jaya with the difference in makespan value 484.39 faster than the scheduling method applied by the company.

Keywords


Branch and Bound; makespan; Dynamic Programming; Scheduling; Pour

Full Text:

PDF

Article Metrics

Abstract views : 250| PDF views : 0

References


. Baker, K. R. dan Trietsch, D. 2009. Principles of Sequencing and Scheduling. New York: John Wiley and Sons Ltd.

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

. Irsyad, A. L. 2015. Penjadwaln Flow Shop N Job M Mesin Dengan Metode First Come First Served (FCFS), Earliest Due Date (EDD),Dan Algoritma Heuristik Pour. Skripsi. Universitas Islam Negeri Sunan Kalijaga. Yogyakarta.

. Pour, H. D. 2001. A New Heuristic for n-Job m-Machine Problem. Production Planning Control, Vol. 12, No. 7, 648-653.

. Hamman, M. K. 2015. Penjadwalan Produksi Flow Shop Untuk Meminimalkan Makespan Dengan Metode Campbell, Dudek, And Smith (CDS), Metode Palmer, Metode Dannenbring, Dan Metode Ignall-Scharge (Studi Kasus Di CV. Bonjor Jaya Klaten). Skripsi. Universitas Islam Negeri Sunan Kalijaga Yogyakarta.

. Karim, M. S. 2015. Penjadwalan Produksi Flow Shop Dengan Metode Ignall-Scharge Dan Algoritma Nawaz Enscore And Ham Di CV. Bestone Indonesia. Skripsi. Universitas Islam Negeri Sunan Kalijaga. Yogyakarta.

. Widyawati, S. dan Abusini, S. 2015. Penjadwalan Produksi Untuk Meminimumkan Makespan Pada Flow Shop Menggunakan Metode Branch And Bound (Studi Kasus CV. Dian’s Print). Jurnal Mahasiswa Matematika, Vol. 3, No. 1, Februari 2015, Hal. 65-68.

. Mangngenre, S., Rapi, A. dan Flannery, W. 2013. Penjadwalan Produksi Dengan Metode Branch and Bound Pada PT. XYZ. Jurnal Teknik Industri, Fakultas Teknik, Universitas Hasanuddin, Makassar.




DOI: http://dx.doi.org/10.25105/jti.v9i2.4920

Refbacks

  • There are currently no refbacks.


Copyright (c) 2019 JURNAL TEKNIK INDUSTRI

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.