PENJADWALAN FLOWSHOP DENGAN PERTIMBANGAN SETUP, PROCESSING, DAN REMOVAL TIME TERPISAH UNTUK MEMINIMASI MAKESPAN (STUDI KASUS UD PRIMA GRAFIKA)
| Main Author: | Virgianita, Restu Dilla |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2018
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/43711/1/PENDAHULUAN.pdf http://eprints.umm.ac.id/43711/2/BAB%20I.pdf http://eprints.umm.ac.id/43711/3/BAB%20II.pdf http://eprints.umm.ac.id/43711/4/BAB%20III.pdf http://eprints.umm.ac.id/43711/5/BAB%20IV.pdf http://eprints.umm.ac.id/43711/6/BAB%20V.pdf http://eprints.umm.ac.id/43711/7/BAB%20VI.pdf http://eprints.umm.ac.id/43711/8/LAMPIRAN.pdf http://eprints.umm.ac.id/43711/ |
Daftar Isi:
- Production scheduling is one of the important things in production activities. After scheduling will be obtained the sequence of jobs to be processed. UD Prima Grafika is one of the manufacturing companies that have implemented flowshop using the FCFS (First Come First Serve) algorithm in their production scheduling. However, the FCFS algorithm is not appropriate for solving production problems at UD Prima Grafika by separating setup, processing, and removal time to minimize makespan. The purpose of this study is to determine the algorithm that produces minimum makespan. The algorithms used in this study include the Sule & Huang decision rule I algorithm, the Sule & Huang decision rule II, and the proposed algorithm which is the development of the Sule & Huang decision rule II algorithm with the Nawaz Enscore Ham (NEH) algorithm approach. The results obtained show that the makespan algorithm is Sule & Huang decision rule I, Sule & Huang decision rule II, and the proposed algorithm is better than the FCFS algorithm.