Aplikasi model traveling salesman problem pada sistem penjadwalan produksi (studi kasus PT Coca-Cola Bottling Indonesia Semarang)

Sulasthomo , Himawan (2003) Aplikasi model traveling salesman problem pada sistem penjadwalan produksi (studi kasus PT Coca-Cola Bottling Indonesia Semarang). Undergraduate thesis, FMIPA UNDIP.

[img]PDF
Restricted to Repository staff only

2424Kb
[img]
Preview
PDF
16Kb
[img]
Preview
PDF
219Kb
[img]
Preview
PDF
381Kb
[img]
Preview
PDF
324Kb
[img]
Preview
PDF
807Kb
[img]
Preview
PDF
937Kb
[img]PDF
Restricted to Repository staff only

405Kb
[img]
Preview
PDF
235Kb
[img]
Preview
PDF
213Kb
[img]
Preview
PDF
216Kb

Abstract

Biaya minimal dalam sistem produksi dipengaruhi oleh efisiensi waktu. Sistem penjadwalan produksi yang bergantung waktu setup (syk) di PT. Coca Cola Bottling Indonesia Semarang dengan algoritma Eastman pada model Traveling Salesman Problem yang menggunakan metode Branch and Bound dilakukan untuk memilih cycle terpendek pada proses pembotolan produk. Hasilnya diberikan alternatif urutan penjadwalan sehingga diperoleh total waktu proses (makespan) yang minimal. Minimum cost production system is influenced by efficiency of processing time. Sequencing dependent setup time (sik) system in PT Coca Cola Bottling Indonesia Semarang by Eastman algorithm on Traveling Salesman Problem that use Branch and Bound method with choose shortest cycle in bottling process. It was given the alternatif scheduling then minimum total processing time (makespan).

Item Type:Thesis (Undergraduate)
Subjects:Q Science > QA Mathematics
Divisions:Faculty of Science and Mathematics > Department of Mathematics
ID Code:31614
Deposited By:Mr UPT Perpus 1
Deposited On:23 Nov 2011 14:31
Last Modified:23 Nov 2011 14:31

Repository Staff Only: item control page