SYAFEI, MUHAMAD (2015) PENJADWALAN SINGLE MACHINE DENGAN METODE ALGORITMA BRANCH AND BOUND UNTUK MEMINIMASI TOTAL LATENESS DAN JUMLAH TARDY JOB. S1 thesis, UNIVERSITAS SULTAN AGENG TIRTAYASA.
![[img]](https://eprints.untirta.ac.id/style/images/fileicons/text.png) |
Text
PENJADWALAN SINGLE MACHINE DENGAN.pdf - Published Version Restricted to Registered users only Download (34MB) |
Abstract
PT. XYZ adalah salah satu perusahaan manufaktur yang memproduksi pipa baja las. PT. XYZ mempunyai 2 jenis mesin yaitu mesin ERW (Electric Resistance Welding) digunakan untuk pembuatan pipa baja dengan las longitudinal dan mesin SPM (Spiral Pipe Machine) digunakan untuk pembuatan pipa baja dengan las spiral. Jumlah mesin ERW yang hanya 1 buah membuat pembuatan pipa longitudinal sangat bergantung pada efektifitas penggunaan mesin ERW tersebut. Hal ini yang menyebabkan sering terjadinya keterlambatan dalam proses penyelesaian job. Tujuan dari penelitian ini yaitu meminimasi total lateness dan jumlah tardy job pada produk pipa longitudinal yang terjadi di PT. XYZ dengan metode algoritma branch and bound. Sebelum melakukan perhitungan algoritma branch and bound dilakukan penentuan jadwal inisial dengan aturan priority rule EDD (earliest due date), SPT(shortest proccesing time) dan LDD (last due date). Hasil penelitian ini didapatkan nilai total lateness pada jadwal existing sebesar 1616 jam dan 6 tardy job dengan urutan sequencing job (1-2-3-4-5-6-7-8-9-10-11-12-13-14-15), kemudian dilanjutkan dengan pembuatan jadwal inisial EDD, SPT dan LDD. Pada perhitungan metode algoritma branch and bound baik itu menggunakan jadwal inisial EDD, SPT maupun LDD menghasilkan 24 alternatif sequencing yang sama dengan nilai total lateness 344 jam dan 2 tardy job yaitu job ke-1 dan ke-2 akan tetapi alternatif sequencing yang dipilih ialah alternatif sequencing yang dihasilkan oleh metode algoritma branch and bound dengan jadwal inisial EDD dan SPT. Hal ini dikarenakan jadwal inisial EDD terbukti menghasilkan jadwal alternatif dengan total lateness yang minimum sedangkan jadwal inisial SPT menghasilkan jadwal alternatif dengan jumlah tardy job yang minimum. Oleh karena itu alternatif jadwal sequencing dengan urutan job (9-8-5-10-7-4-11-13-12-14-15-6-3-1-2) dipilih sebagai alternatif jadwal sequencing terbaik.
| Item Type: | Thesis (S1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Contributors: |
|
|||||||||
| Additional Information: | PT. XYZ is a manufacturing company that produces steel pipe welding. PT. XYZ has two types of machines are machines ERW(Electric Resistance Welding) is used for the manufacture of steel pipes with longitudinal welding and machine SPM(Spiral Pipe Machine) is used for the manufacture of steel pipes with spiral weldin . The number of machines that only 1 piece ERW pipe manufacture longitudinal create highly dependent on the effective use of the ERW machine. This led to frequent delays in the completion of the job. The purpose of this study is to minimize the total lateness and number of tardy jobs in longitudinal pipe products that occur in the PT. XYZ with a branch and bound algorithm method. Before performing the calculation of branch and bound algorithm is the determination of the initial schedule with priority rules rule EDD(earliest due date), SPT(Shortest proccesing time) and LDD(last due date). The results of this study, the total lateness on the existing schedule is 1616 hours and 6 of tardy jobs with job sequencing sequence(1-2-3-4-5-6-7-8-9-10-11-12-13-14- 15), then proceed with the making the initial schedule EDD, SPT and LDD. In the calculation method branch and bound algorithm that uses the initials schedule EDD , SPT and LDD produce 24 alternative sequencing with the same value of 344 hours of total latenss and 2 of tardy jobs are jobs 1st and 2nd but the selected sequencing alternative is the result of alternative sequencing by the method of branch and bound algorithm with the initial schedule EDD and SPT. Because the initial schedule EDD shown to produce an alternative schedule with minimum total lateness and the initial schedule SPT while generating alternative schedule with the minimum number of tardy jobs. Therefore, an alternative schedule job sequencing is (9-8-5-10-7-4-11-13-12-14-15-6-3-1-2) was chosen as the best alternative sequencing schedule. | |||||||||
| Uncontrolled Keywords: | Kata kunci: Algoritma Branch and Bound, Lateness, Tardy Job, EDD (Earliest Due Date,) SPT (Short Processing Time), LDD (Last Due Date). | |||||||||
| Subjects: | H Social Sciences > HD Industries. Land use. Labor | |||||||||
| Divisions: | 03-Fakultas Teknik 03-Fakultas Teknik > 26201-Jurusan Teknik Industri |
|||||||||
| Depositing User: | Perpustakaan Pusat | |||||||||
| Date Deposited: | 22 Apr 2022 22:16 | |||||||||
| Last Modified: | 08 Sep 2022 14:46 | |||||||||
| URI: | http://eprints.untirta.ac.id/id/eprint/13572 |
Actions (login required)
 |
View Item |