PENJADWALAN PRODUKSI JOB SHOP MENGGUNAKAN METODE ALGORITMA JADWAL NON DELAY DAN METODE HEURISTIC SCHEDULE GENERATION DI CV INSAN JAYA
Abstract
Production scheduling is defined as the process of allocating existing sources or machines to carry out a set of tasks within a certain period of time. CV. Insan Jaya is a manufacturing company engaged in woodworking. Products made by the company are sills, doors and windows. The company is currently experiencing difficulties in fulfilling demand due to the absence of an effective work schedule. Therefore an appropriate work plan is prepared by conducting an effective work scheduling so that the completion of the work is as planned. The purpose of this study is to minimize the total product completion time and calculate time performance based on idle time, flow time and mean flow time. Based on these objectives, scheduling is arranged using the Non Delay Algorithm and Heuristic Schedule Generation methods. The Non Delay Algorithm Method and Heuristic Schedule Generation were chosen to minimize machine idle time so as to minimize the mean flow time (mean flow time) and total turnaround time (makespan). Scheduling Non Delay Schedule Algorithm produces a makepan of 78 hours, idle time of 361 hours, flow time of 1998 hours and mean flow time of 439 hours while the Heuristic Schedule Generation method produces a makepan of 76 hours, idle time of 153 hours, flow time of 3385 hour and mean flow time are 751 hours.
Keywords: Job Shop, Heuristic Schedule Generation Method, Non Delay Schedule Algorithm Method, Makespan, Idle Time, Flow Time dan Mean Flow Time.
References
Baker, K.R. & Trietsch, D., 2009. Principles Of Sequencing And Scheduling, New Jersey: John Wiley & Sons.
Dugardin, F., Chehade, H., Amodeo, L.,Yalaoui, F., Prins, C., 2007. Hybrid Job Shop and parallel machine schedulling problems: minimization of total tardiness criterion E. Leuner, ed.Multiprocessor Scheduling: Theory and Applications, (December), pp.273–292.
Elsayed and Boucher, Thomas O,1994, “Analisys and Control of Production System”,Prestice Hall International,Inc.
Harto, Setyo, Garside, Annisa Kesy, Utama, Dana Marsetya, 2016, Penjadwalan Produksi Menggunakan Algoritma Jadwal Non Delay Untuk Meminimalkan Makespan Studi Kasus Di Cv. Bima Mebel, Spektrum Industri, Vol. 14, No. 1, 1 – 108.
Herjanto,eddy,1999, “Manajemen Produksi dan Operasi”, PT. Gramedia Widiasarana Indonesia, Jakarta.
Lumban Gaol, Suharni, dkk. Analisa Penjadwalan Job Shop Untuk Meminimalkan Waktu Keseluruhan Produk Menggunakan Pendekatan Heuristic Dispathcing Rule.
Lysandra, M., Harsono, A. & Mustofa, F.H., 2014. Usulan Penjadwalan Kendaraan Shuttle Pt . Dengan Modifikasi Algoritma N-Jobs M- Mesin. Jurnal Online Institut Teknologi Nasional, 02(03), pp.237–247.
Masruroh, Nisa, Analisa Penjadwalan Produksi Dengan Menggunakan Metode Ampbell Dudeck Smith, Palmer, Dan Dannenbring Di Pt.Loka Refraktoris Surabaya, Jurnal Ilmiah Teknik Industri FTI-UPN”Veteran” Jatim.158-171.
Nasution, H.Arman,1999, “Perencanaan dan Pengendalian Produksi”, PT.Guna Widya, Jakarta.
Patricia, Elika, Suryono, Hadi, 2011, Analisis Penjadwalan Kegiatan Produksi Pada Pt.Muliaglass Float Division Dengan Metode Forward Dan Backward Scheduling, Journal of Industrial Engineering & Management Systems, Vol.43, No 1.
Setiawati, Lestari, Bidiawati, Ayu, 2005, Penerapan Model Penjadwalan Job N Jobs M Mesin Paralel Untuk Meminimasi Mean Flow Time, Jurnal Teknos-2k, Vol.5, No. 2.
Sipper, D. & Robert L. Bulfin, J., 1977. Production, Planning, Control, and Integration, MC Graw-Hill.
Fatmawati, Wiwiek, dkk, 2009, Penjadwalan Kerja Dengan Metode Algoritma Actives Chedule Dan Heuristic Schedule Untuk Minimisasi Waktu Penyelesaian (Studi Kasus di PT. InTAC Brass Indonesia), Proceedings Seminar Nasional Teknologi Industri (SNTI), Universitas Islam Sultan Agung Semarang.
