Show simple item record

MODIFIKASI MEKANISME PENENTUAN PENJADWALAN JOB PADA METODE DANNENBRING

dc.contributor.authorTannady, Hendy
dc.date.accessioned2013-07-22T04:41:24Z
dc.date.available2013-07-22T04:41:24Z
dc.date.issued2012-06
dc.identifier.citationAdam, E. E. Jr., Ebert, R. J. 1989. Production and Operations Management. New Jersey : Prentice Hall Inc. Al-Salem, A., “A Heuristic to Minimize Makespan in Proportional Parallel Flow Shops”. International Journal of Computing & Information Science, August 2004; hal. 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., and Smith, Milton, L., “A Heuristic Algorithm for the n job, m Machine Sequencing Problem”, Management Science, June 1970; hal. 630-637. Dannenbring, D., “An Evaluation of Flow Shop Sequencing Heuristics” Management Science, July 1977; hal. 1174-1182. Garside, Annisa. K., “Perbandingan Performansi Metode Johnson Dengan Heuristik Multi Tujuan Ditinjau Dari Makespan, Total Flow Time, Dan Iddle Time”, Jurnal Optimumm; hal. 163-172. Ginting, R. 2009. Penjadwalan Mesin. Edisi Pertama. Yogyakarta : Graha Ilmu. Gupta, D., Singla, P., Bala, S., “Application of Branch and Bound Technique for 3-Stage Flow Shop Scheduling Problem with Transportation Time”, Industrial Engineering Letters, hal. 1-5. Hartono, Moh., “Penjadualan Produksi n job m mesin Untuk Sistem Produksi Job Shop di Perusahaan dan Industri Mesin Aneka Mesin Malang”, Jurnal Optimumm, 2001; hal. 1018. 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., “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., “Model Penunjang Keputusan Jadwal Produksi Jus Buah Segar”, Jurnal Teknik Industri, Februari 2012; hal. 51-59. Maulidya, R., Saraswati, D., Vania, D., “Perancangan Penjadwalan Flowshop Menggunakan Partikel Swarm Optimization Untuk Meminimasi Number of Tardy Jobs”, Jurnal Teknik Industri, hal. 189-198. Niebel, Benjamin., Freivalds, Andris. 2009. Methods, Standards, and Work Design. New York : McGraw-Hill Inc. Palmer, D,S. “Sequencing Jobs Through a Multi Stage Process in The Minimum Total TimeA 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. 2 nd Edition. Rizani, N. C., Safitri, D. M., Wulandari, P. A., “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., “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., “Penerapan Metode Forward Chaining Pada Penjadwalan Mata Kuliah”, Jurnal Matematika dan Komputer Indonesia, 2009; hal. 17-24. Wang, F., Rao, Y., “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., “A new heuristic method for the flow shop sequencing problem”, European Journal of Operation Research, 1989; hal. 186-193. Wignjosoebroto, Sritomo. 2003. Ergonomi, Studi Gerak dan Waktu. Surabaya : Guna Widya.en_US
dc.identifier.issn1412-6869
dc.identifier.urihttp://hdl.handle.net/11617/3296
dc.description.abstractScheduling 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-j6j2-j7-j8-j4-j5-j3 and j1-j6-j2-j4-j8-j7-j5-j3 using hybrid Pi1 earlier mechanism and hybrid Pi2 earlier mechanism.en_US
dc.publisherlppmumsen_US
dc.subjectschedulingen_US
dc.subjectmakespanen_US
dc.subjectDannenbring methoden_US
dc.subjectmechanismen_US
dc.titleMODIFIKASI MEKANISME PENENTUAN PENJADWALAN JOB PADA METODE DANNENBRINGen_US
dc.typeArticleen_US


Files in this item

Thumbnail
Name:
JITI-12-01-01-Tannadi-OK.pdf
Size:
111.4Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record