Pengembangan Algoritma Non Delay Pada Kasus Penjadwalan Non-Permutation Hybrid Flowshop Untuk Minimasi Mean Flowtime

Authors

  • Siti Muhimatul Khoiroh University of 17 Agustus 1945 Surabaya

DOI:

https://doi.org/10.22219/JTIUMM.Vol19.No2.148-156

Keywords:

Production scheduling, non-permutation, hybrid flowshop, non-delay algorithm, SPT, LRT.

Abstract

Production scheduling is one of the key success factors in the production process. Scheduling approach with Non-Permutation flow shop is a generalization of the traditional scheduling problems Permutation flow shop for the manufacturing industry to allow changing the job on different machines with the flexibility of combinations. This research tries to develop a heuristic approach that is non-delay algorithm by comparing Shortest Processing Time (SPT) and Largest Remaining Time (LRT) in the case of non-permutation flow shop to produce minimum mean flow time ratio. The result of simulation shows that the SPT algorithm gives less mean flow time value compared to LRT algorithm which means that SPT algorithm is better than LRT in case of non-permutation hybrid flow shop.

Downloads

Download data is not yet available.

Author Biography

Siti Muhimatul Khoiroh, University of 17 Agustus 1945 Surabaya

INDUSTRIAL ENGINEERING DEPARTMENT

References

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.

J. O. Ong and D. Juliyanti, "Pengembangan Model Penjadwalan Mesin Majemuk Melalui Job Sisipan," 2013.

F. R. Pratiwi, A. Rahman, and C. F. M. Tantrika, "Penjadwalan Hybrid Flowshop dengan Integer Linear Programming untuk Meminimasi Makespan (Studi Kasus: Pt. Dwisutra Setia Agung Surabaya)," Jurnal Rekayasa dan Manajemen Sistem Industri, vol. 2, pp. p940-951, 2014.

F. Putamawa, B. Santosa, and N. Siswanto, "Penyelesaian Permasalahan Multi-Objective Hybrid Flow Shop Scheduling dengan Algoritma Modified Particle Swarm Optimization," ed: Surabaya: ITS, 2014.

C. F. M. Tantrika, "Penjadwalan Flowshop Dengan Mixed Integer Programming Untuk Meminimasi Total Flowtime Dan Total Tardiness," Journal of Engineering and Management in Industrial System, vol. 3, 2015.

J. O. Ong, "Penjadwalan Non-Delay Melalui Mesin Majemuk Untuk Meminimumkan Makespan," Spektrum Industri, vol. 11, 2013.

T. A. Barokah, E. Zaini, and A. Saleh, "Usulan Penjadwalan Produk Menggunakan Algoritma Non Delay Dengan Mesin Paralel Pada PT. Adhichandra dwiutama," reka integra, vol. 4, 2016.

W. N. Cahyanto, S. Hafidh Munawir, and M. Eng, "Penjadwalan Job Shop Mesin Majemuk Menggunakan Algoritma Non Delay Untuk Meminimumkan Mean Flow Time Dan Penentuan Due Date," Universitas Muhammadiyah Surakarta, 2016.

D. M. Utama, "Analisa Perbandingan Penggunaan Aturan Prioritas Penjadwalan Pada Penjadwalan Non Delay N Job 5 Machine," Research Report, vol. 1, 2017.

S. M. Johnson, "Optimal two‐and three‐stage production schedules with setup times included," Naval research logistics quarterly, vol. 1, pp. 61-68, 1954.

H. G. Campbell, R. A. Dudek, and M. L. Smith, "A heuristic algorithm for the n job, m machine sequencing problem," Management science, vol. 16, pp. B-630-B-637, 1970.

A. sulaksmi, A. K. Garside, and F. hadziqah, "Penjadwalan Produksi Dengan Algoritma Heuristik Pour (Studi Kasus: Konveksi One Way–Malang)," Jurnal Teknik Industri, vol. 15, pp. 35-44, 2014.

I. Masudin, D. M. Utama, and F. Susastro, "Penjadwalan Flowshop Menggunakan Algoritma Nawaz Enscore HAM," 2014.

A. V. Limas, J. Sudirwan, and S. N. Fadlilah, "Perancangan Sistem Penjadwalan Mesin Hybrid Flow Shop dengan Algoritma Levyflight Discrete Firefly," ComTech: Computer, Mathematics and Engineering Applications, vol. 5, pp. 671-684, 2014.

D. S. Widodo and M. S. D. Ellianto, "Penjadwalan Flow Shop Dengan Pendekatan Cross Entropy-Genetic Algorithm Untuk Menurunkan Makespan Pada Pembuatan Roda Gigi," Heuristic: Jurnal Teknik Industri, vol. 12, 2016.

M. Firdaus, I. Masudin, and D. M. Utama, "Penjadwalan Flowshop Dengan Menggunakan Simulated Annealing," Spektrum Industri, vol. 13, 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.

R. Nasution, A. K. Garside, and D. M. Utama, "Penjadwalan Job Shop Dengan Pendekatan Algoritma Artificial Immune System," Jurnal Teknik Industri, vol. 18, pp. 29-42, 2017.

B. Vahedi-Nouri, P. Fattahi, and R. Ramezanian, "Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints," Journal of Manufacturing Systems, vol. 32, pp. 167-173, 2013.

Downloads

Published

08/29/2018

How to Cite

Khoiroh, S. M. (2018). Pengembangan Algoritma Non Delay Pada Kasus Penjadwalan Non-Permutation Hybrid Flowshop Untuk Minimasi Mean Flowtime. Jurnal Teknik Industri, 19(2), 148–156. https://doi.org/10.22219/JTIUMM.Vol19.No2.148-156

Issue

Section

Article