MODIFIKASI MEKANISME PENENTUAN PENJADWALAN JOB PADA METODE DANNENBRING

Hendy Tannady(1*),

(1) Program Studi Teknik Industri, Fakultas Teknologi dan Desain, Universitas Bunda Mulia, Jln. Lodan Raya No. 2-Ancol-Jakarta Utara 14350
(*) Corresponding Author
DOI: https://doi.org/10.23917/jiti.v12i1.650

Abstract

Scheduling methods particularly in scheduling a job toward machine capacity is often not optimal in generating the minimum makespan time due to the inappropriate mechanism of determining the schedule from the job. By using an appropriate mechanism on the local search for both of the job order towards machine and the recapitulation of the makespan in each job in order to produce the optimal scheduling is proved an effective approach to minimize the error of the end time processes that are too long. This approach is also able to provide the optimal solution for the work planning. This research focuses on the searching for some mechanism design alternatives in job scheduling by employing the makespan recapitulation table of each job on the machine determined by Dannenbring method. The result of this research shows that the smallest possible makespan time is 93, by following the order of job j1-j7-j2-j8-j4-j5-j6-j3, j1-j6-j2-j7-j8-j4-j5-j3 and j1-j6-j2-j4-j8-j7-j5-j3 using hybrid Pi1 earlier mechanism and hybrid Pi2 earlier mechanism.

Keywords

scheduling; makespan; Dannenbring method; mechanism

References

Adam, E. E. Jr.; Ebert, R. J. 1989. Production and Operations Management. New Jersey : Prentice Hall Inc.

Al-Salem, A. 2004. “A Heuristic to Minimize Makespan in Proportional Parallel Flow Shops”. International Journal of Computing & Information Science, August 2004; pp. 98-107.

Baker, K.R. 1974. Introduction to Sequencing and Scheduling. New York: Wiley.

Bedworth, D. D. 1987. Integrated Production Control Systems, Management, Analysis, Design. New York: Wiley&Sons.

Campbell, H,G.; Dudek, R,A.; Smith, M.L. 1970. “A Heuristic Algorithm for the n job, m Machine Sequencing Problem”. Management Science, June 1970; pp. 630-637.

Dannenbring, D. 1977. “An Evaluation of Flow Shop Sequencing Heuristics”. Management Science, July 1977; pp. 1174-1182.

Garside, A.K. 2010. “Perbandingan Performansi Metode Johnson Dengan Heuristik Multi Tujuan Ditinjau Dari Makespan, Total Flow Time, Dan Iddle Time”. Jurnal Optimum; pp. 163-172.

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

Gupta, D.; Singla, P.; Bala, S.2012. “Application of Branch and Bound Technique for 3-Stage Flow Shop Scheduling Problem with Transportation Time”. Industrial Engineering Letters, Vol. 2 (1), pp. 1-5.

Hartono, Moh. 2001. “Penjadualan Produksi n job m mesin Untuk Sistem Produksi Job Shop di Perusahaan dan Industri Mesin Aneka Mesin Malang”, Jurnal Optimumm, 2001; hal. 10-18.

Heizer, J.; Render, B. 1999. Operations Management. New Jersey : Prentice Hall Inc.

Herjanto, Eddy. 1999. Manajemen Produksi dan Operasi. Jakarta : PT. Gramedia Widiasarana Indonesia.

Johnson, S.M. 1954. “Optimal two and three stage production schedule with set up times included”, Nay Res Log Quart, 1954; hal. 61-68.

Maflahah, I.; Mahcfud; Udin, F. 2012. “Model Penunjang Keputusan Jadwal Produksi Jus Buah Segar”. Jurnal Teknik Industri, Februari 2012; hal. 51-59.

Maulidya, R.; Saraswati, D.; Vania, D. 2009. “Perancangan Penjadwalan Flowshop Menggunakan Partikel Swarm Optimization Untuk Meminimasi Number of Tardy Jobs”, Jurnal Teknik Industri, hal. 189-198.

Niebel, B.; Freivalds, A. 2009. Methods, Standards, and Work Design. New York: McGraw-Hill Inc.

Palmer, D,S. 1965. “Sequencing Jobs Through a Multi Stage Process in The Minimum Total Time-A Quick Method for Obtaining A Near Optimum”, Operational Research Quarterly, 1965; hal. 101-107.

Pinedo, Michael. 2002. Scheduling : Theory, Algorithms, and Systems. New Jersey : Prentice Hall Inc. 2nd Edition.

Rizani, N. C.; Safitri, D. M.; Wulandari, P. A. 2011. “Perbandingan Pengukuran Waktu Baku Dengan Metode Stopwatch Time Study dan Metode Ready Work Factor (RWF) Pada Departemen Hand Insert PT. Sharp Indonesia, Jurnal Teknik Industri, hal. 127-136.

Tannady, H.; Steven. 2012. “Efisiensi Waktu Produksi Es Batu Sebagai Implikasi Urutan Penjadwalan Kedatangan Job yang Tepat”, Jurnal Ilmiah Teknik Industri, Juni 2012; hal. 91-101.

Untoro, W.Y. 2009. “Penerapan Metode Forward Chaining Pada Penjadwalan Mata Kuliah”, Jurnal Matematika dan Komputer Indonesia, 2009; hal. 17-24.

Wang, F.; Rao, Y. 2011. “Design and Application of a New Hybrid Heuristic Algorithm for Flow Shop Scheduling”, International Journal Computer Network and Information Security, March 2011; hal. 41-49.

Widmer, M.; Hertz, A. 1989. “A new heuristic method for the flow shop sequencing problem”, European Journal of Operation Research, 1989; hal. 186-193.

Wignjosoebroto, S. 2003. Ergonomi, Studi Gerak dan Waktu. Surabaya: Guna Widya.

Article Metrics

Abstract view(s): 1102 time(s)
PDF (Bahasa Indonesia): 2900 time(s)

Refbacks

  • There are currently no refbacks.