Show simple item record

dc.contributor.advisorUkurta
dc.contributor.authorSari, Firda
dc.date.accessioned2024-09-30T08:52:21Z
dc.date.available2024-09-30T08:52:21Z
dc.date.issued2024
dc.identifier.urihttps://repositori.usu.ac.id/handle/123456789/97924
dc.description.abstractIn the production process, obstacles are often encountered, such as the product not reaching consumers on time. Company scheduling can minimize costs and production time, so that orders are completed according to the agreed time. CV. Kotama Shoes is a craft industry which operates in the field of shoe making. The scheduling system implemented is first come first serve (FCFS). Based on observations, there were delays in fulfilling orders in the periods May, August, September 2023 and January 2024. The high production process time at certain stations caused the completion time (makespan) required on the production floor to increase. With the proposed tabu search and branch and bound methods, it is hoped that the product completion time (makespan), namely the amount of time required to complete the processing of all work, will be shorter. Setting the job sequence by minimizing makespan using the tabu search method produces an E-D-C-B-A job sequence with a makespan value of 101,57 hours. The branch and bound method also produces the same final result, namely an E-D-C-B-A job sequence with a makespan value of 101,57 hours. Both proposed methods are better than the company's actual method with a makespan value of 110,95 hours. The proposed method obtains a lower makespan than the actual method with a relative error value of 9.24%.en_US
dc.language.isoiden_US
dc.publisherUniversitas Sumatera Utaraen_US
dc.subjectProduction Schedulingen_US
dc.subjectMakespanen_US
dc.subjectFlow Shopen_US
dc.subjectTabu Search Algorithmen_US
dc.subjectBranch and Bound Algorithmen_US
dc.subjectSDGsen_US
dc.titleUsulan Penjadwalan Produksi Sepatu untuk Meminimasi Makespan Menggunakan Metode Algoritma Tabu Search dan Algoritma Branch and Bound pada CV Kotama Shoesen_US
dc.title.alternativeSchedulling Shoe Production oo Minimize Makespan using The Tabu Search Algorithm Method and The Branch and Bound Algorithm Method on Kotama Shoes Companyen_US
dc.typeThesisen_US
dc.identifier.nimNIM200403006
dc.identifier.nidnNIDN0008066208
dc.identifier.kodeprodiKODEPRODI26201#Teknik Industri
dc.description.pages172 Pagesen_US
dc.description.typeSkripsi Sarjanaen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record