., Vera (2017) Usulan Penjadwalan Job Shop Untuk Meminimasi Makespan Menggunakan Algoritma Genetika(Studi Kasus Di Bengkel Las Endang Palembang). Other thesis, Universitas Katolik Musi Charitas Palembang.
![[img]](http://eprints.ukmc.ac.id/style/images/fileicons/text.png) |
Text
TI-2017-1212003-cover.pdf Download (116kB) |
|
Text
TI-2017-1212003-abstract.pdf Download (8kB) |
|
Text
TI-2017-1212003-tableofcontent.pdf Download (137kB) |
|
Text
TI-2017-1212003-chapter1.pdf Download (209kB) |
|
Text
TI-2017-1212003-chapter2.pdf Restricted to Repository staff only Download (537kB) |
|
Text
TI-2017-1212003-chapter3.pdf Restricted to Repository staff only Download (102kB) |
|
Text
TI-2017-1212003-chapter4.pdf Restricted to Repository staff only Download (685kB) |
|
Text
TI-2017-1212003-chapter5.pdf Restricted to Repository staff only Download (107kB) |
|
Text
TI-2017-1212003-conclusion.pdf Download (90kB) |
|
Text
TI-2017-1212003-reference.pdf Download (91kB) |
|
Text
TI-2017-1212003-attachment.pdf Restricted to Repository staff only Download (3MB) |
|
Text
TI-2017-1212003-complete.pdf Restricted to Repository staff only Download (5MB) |
|
Text
TI-2017-1212003-summary_id.pdf Restricted to Repository staff only Download (676kB) |
Abstract
Endang Welding Workshop was one of the welding shop that receives goods from iron-making services, such as trellis, iron fence, iron or clothesline pole, and so on. The problem is often a delay of delivery of orders caused by the length of the total order completion time (makespan) with the percentage reached 60% of total orders in December of 2015. This caused of Endang Welding Workshop implement a scheduling system First Come First Serve (FCFS) in scheduling sequences 1-2-3-4-5-6-7-8-9-10-11-12-13-14-15-16-17-18. In this research was given alternative production scheduling using Genetic Algorithm to minimize the makespan. Genetic Algorithm is formed by using Visual Basic software with input data processing time of each component-machine whose output represents the sequence of component-machine and routing of products in the form of string that has been processed by the program implementation which is steps of Genetic Algorithm. Job shop scheduling using Genetic Algorithm could minimize the makespan of 22,55% of the FCFS method in scheduling sequences 10-16-17-11-18-6-14-7-4-12-15-2-1-5-13-9-8-3.
| Item Type: | Thesis (Other) |
|---|---|
| Additional Information: | Skripsi Lengkap dapat dibaca di Ruang Referensi Perpustakaan UKMC Kampus Bangau. |
| Uncontrolled Keywords: | Production Scheduling, Job Shop, Genetic Algorithm, Makespan, Visual Basic. |
| Subjects: | Q Science > Q Science (General) |
| Divisions: | Theses - S1 > Industrial Engineering Study Program |
| Depositing User: | Perpustakaan Unika Musi Charitas |
| Date Deposited: | 11 Oct 2017 12:52 |
| Last Modified: | 27 Oct 2017 02:30 |
| URI: | http://eprints.ukmc.ac.id/id/eprint/388 |
Actions (login required)
 |
View Item |
