Optimasi Pemilihan Muatan Produk Mebel Jenis Rotan Ke Dalam Kontainer dengan Menggunakan Algoritma Greedy (Studi Kasus: Pt. Wirasindo Santakarya - Sukoharjo)

Asari, Anugerah and , Much. Djunaidi, S.T., M.T. (2018) Optimasi Pemilihan Muatan Produk Mebel Jenis Rotan Ke Dalam Kontainer dengan Menggunakan Algoritma Greedy (Studi Kasus: Pt. Wirasindo Santakarya - Sukoharjo). Skripsi thesis, Universitas Muhammadiyah Surakarta.

	PDF (Naskah Publikasi) naskah publikasi.pdf Download (1MB)
	PDF (Halaman Depan) halaman depan.pdf Download (704kB)
	PDF (Bab I) BAB I.pdf Download (265kB)
	PDF (Bab II) BAB II.pdf Restricted to Repository staff only Download (486kB) | Request a copy
	PDF (Bab III) BAB III.pdf Restricted to Repository staff only Download (269kB) | Request a copy
	PDF (Bab IV) BAB IV.pdf Restricted to Repository staff only Download (2MB) | Request a copy
	PDF (Bab V) BAB V.pdf Restricted to Repository staff only Download (256kB) | Request a copy
	PDF (Daftar Pustaka) DAFTAR PUSTAKA.pdf Download (261kB)
	PDF (Surat Pernyataan Publikasi) SURAT PERNYATAAN PUBLIKASI ILMIAH.pdf Restricted to Repository staff only Download (346kB) | Request a copy
	PDF (Lampiran) LAMPIRAN.pdf Restricted to Repository staff only Download (1MB) | Request a copy

Abstract

In this era of goods delivery activities is a common thing done, no exception export activities, especially on furniture products in Indonesia. The loading of goods in the containers requires skill and experience, but only the skill is considered to be inadequate considering the size of many kinds of product. Therefore, especially at PT. Wisanka required calculations on the selection of cargo into containers. Objectives achieved in addition to selecting any product that can enter the container of course also know the total value of goods that are loaded to optimum profit and know the effect of profits obtained by the company. The method used is greedy algorithm applied to Matlab software. The calculated data is a four-month order from September to December 2017. The calculation is done by greedy by volume and greedy by profit , both of which both order the biggest value first, then the product is chosen to not exceed the maximum container size. The results obtained are the difference in profits from real shipments withcalculations greedy which are larger on average, namely September Rp 1.155.000,00 or 3,49% savings with the number of products 190 pcs from 333 pcs orders, in October the difference is Rp. 579.250,00 or a savings of 1,88% of the number of products 145 pcs out of 299 requests, in November the product sent all 302 pcs with a profit of Rp 39.917.500,00 and in December the difference was Rp. 6.335.000,00 or savings of 10.29% with the total of 299 pcs of 425 pcs requests.

Item Type:	Karya ilmiah (Skripsi)
Uncontrolled Keywords:	algoritma greedy, pemilihan muatan, optimum
Subjects:	T Technology > TS Manufactures
Divisions:	Fakultas Teknik > Teknik Industri
Depositing User:	ANUGERAH ASARI
Date Deposited:	11 Aug 2018 07:17
Last Modified:	11 Aug 2018 07:17
URI:	http://eprints.ums.ac.id/id/eprint/66022

Actions (login required)

View Item