Please use this identifier to cite or link to this item:
http://repository.ipb.ac.id/handle/123456789/57034
Title: | Penyelesaian Masalah Produksi dan Distribusi Zero Inventory Solution of a Zero-Inventory Production and Distribution Problem |
Authors: | Hanum,Farida Supriyo,Prapto Tri Hidayat, Muhamad Rofi |
Keywords: | Bogor Agricultural University (IPB) search tree. branch and bound procedure heuristic time window zero-inventory |
Issue Date: | 2012 |
Abstract: | In this paper, a zero-inventory production and distribution problem is discussed. It is assumed that production facilities have limited production rate and there are traveling times between locations. Furthermore, each customer has a fixed sequence in recieving deliveries and requests a certain delivery quantity as well as a time window for receiving the delivery. Moreover, the products have limited lifespan, which starts as soon as the production of customer’s order is completed. Since the production facilities have limited resources and there is only one truck to deliver all the deliveries, then not all of the customers can receive the deliveries within their specified time windows. The problem is to choose customers to receive the deliveries, which maximize the total demand satisfied, without violating the constrains on product lifespan and the delivery time window. A heuristic method can be used to seek the feasible production and distribution solution. However, a heuristic solution can not be verified as an optimal solution, but nevertheless, it can be considered as a lower bound of the optimal solution. Furthermore, a branch and bound procedure using search tree is used to find the optimal production and distribution solution. Pada karya ilmiah ini dibahas masalah produksi dan distribusi zero inventory. Diasumsikan bahwa fasilitas produksi mempunyai tingkat produksi yang terbatas dan terdapat waktu tempuh antarlokasi pelanggan. Pelanggan mempunyai urutan yang tetap dalam menerima pengiriman. Setiap pelanggan mengajukan jumlah permintaan dan time window untuk menerima pengiriman. Produk mempunyai umur yang terbatas. Umur produk dimulai segera setelah pesanan diproduksi. Karena pabrik mempunyai fasilitas produksi yang terbatas dan hanya terdapat sebuah truk untuk mengirimkan barang, maka mungkin tidak semua pelanggan menerima pengiriman dalam time window yang diajukan oleh pelanggan. Permasalahannya ialah memilih pelanggan mana yang mendapatkan pengiriman sehingga jumlah permintaan yang dipenuhi adalah maksimum tanpa melanggar kendala umur produk dan time window pelanggan. Metode heuristik digunakan untuk mencari jadwal produksi dan distribusi yang fisibel. Namun solusi yang dihasilkan metode heuristik belum dipastikan optimal, maka solusi yang ditemukan menggunakan metode heuristik dijadikan batas bawah dari solusi (jadwal) optimal. Selanjutnya digunakan metode pencabangan dan pembatasan menggunakan search tree untuk menentukan jadwal produksi dan distribusi yang optimal. |
URI: | http://repository.ipb.ac.id/handle/123456789/57034 |
Appears in Collections: | UT - Mathematics |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
G12mrh.pdf Restricted Access | Full text | 2.57 MB | Adobe PDF | View/Open |
G12mrh_Abstrak.pdf Restricted Access | Abstrak | 368.56 kB | Adobe PDF | View/Open |
G12mrh_BAB I Pendahuluan.pdf Restricted Access | BAB I | 324.87 kB | Adobe PDF | View/Open |
G12mrh_BAB II Landasan Teori.pdf Restricted Access | BAB II | 428.2 kB | Adobe PDF | View/Open |
G12mrh_BAB III Pembahasan.pdf Restricted Access | BAB III | 502.61 kB | Adobe PDF | View/Open |
G12mrh_BAB IV Penyelesaian Masalah.pdf Restricted Access | BAB IV | 823.88 kB | Adobe PDF | View/Open |
G12mrh_BAB V Simpulan dan Saran.pdf Restricted Access | BAB V | 321.69 kB | Adobe PDF | View/Open |
G12mrh_Cover.pdf Restricted Access | Cover | 421.25 kB | Adobe PDF | View/Open |
G12mrh_Daftar Pustaka.pdf Restricted Access | daftar pustaka | 292.82 kB | Adobe PDF | View/Open |
G12mrh_Lampiran.pdf Restricted Access | Lampiran | 2.36 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.