แจ้งเอกสารไม่ครบถ้วน, ไม่ตรงกับชื่อเรื่อง หรือมีข้อผิดพลาดเกี่ยวกับเอกสาร ติดต่อที่นี่ ==>
หากไม่มีอีเมลผู้รับให้กรอก thailis-noc@uni.net.th
หากไม่มีอีเมลผู้รับให้กรอก thailis-noc@uni.net.th
Duangrat Hirunyasiri. A new heuristic to compute efficient policies for one-warehouse N-Retailer inventory system. Doctoral Degraee(Industrial Engineering). Kasetsart University. Office of the University Library. : Kasetsart University, 2020.
A new heuristic to compute efficient policies for one-warehouse N-Retailer inventory system
Name: Duangrat Hirunyasiri
Classification :.LCCS: T57.84
LCSH:
Heuristic programming
LCSH:
Routing-machines
LCSH:
Warehouses
LCSH:
Industrial Engineering
Abstract:
This dissertation investigates the effective inventory replenish time interval policy for two-echelon inventory system over an infinite planning horizon for an item with deterministic demand rates and constant lead times. It is assumed that shortages are not allowed. This research presents inventory replenish time interval policy corresponding to transportation lead time which using third-party logistics service provider for a small quantity shipped. Consider a two-stage supply system one warehouse N-retailer (OWNR) and assume that a warehouse buys an item from an external supplier to fill the orders of the buyers and all retailers face deterministic demand rate and lead times are constant. The objective is to find an effective replenish time interval that minimize the long-run total cost which are average ordering, holding and transportation costs. The heuristic development from the power of two policy while the computational results are provided to show that the proposed heuristic is not necessary to be restrict to power of two policy and also more practical for decision makers managing their warehouses and retailers in real-life cases when consideration with lead time. In the result show that the proposed heuristic can be practical in the real-life case by giving 90% opportunity to reduce total inventory cost and can reduce inventory cost 14.26% when compare with inventory cost from lead time and the inventory cost can be reduce 0.272% when replenish time are not necessary to be power of two multiples.
Kasetsart University. Office of the University Library
Address:
Bangkok
Email:
tdckulib@ku.ac.th
Name: Anan Mungwattana
Role:
Thesis Advisor
Created:
2020
Modified:
2025-06-30
Issued:
2025-06-30
วิทยานิพนธ์/Thesis
application/pdf
URL: https://www.lib.ku.ac.th/KUthesis/2563/duangrat-hir-all.pdf
CallNumber:
T57.84|b.D82
eng
DegreeName: Doctor of Engineering
Level: Doctoral Degraee
Descipline: Industrial Engineering
Grantor: Kasetsart University
©copyrights Kasetsart University
RightsAccess:
ใช้เวลา
0.023097 วินาที
Duangrat Hirunyasiri
| Title | Contributor | Type |
|---|---|---|
| A new heuristic to compute efficient policies for one-warehouse N-Retailer inventory system
มหาวิทยาลัยเกษตรศาสตร์ Duangrat Hirunyasiri | Anan Mungwattana | วิทยานิพนธ์/Thesis |
Anan Mungwattana
| Title | Creator | Type and Date Create |
|---|---|---|
| Determining order quantities and re-order points for multi-stage and multi-level items using simulation
มหาวิทยาลัยเกษตรศาสตร์ Anan Mungwattana | Kanokwan Kanokjiraporn | วิทยานิพนธ์/Thesis |
| Web-based vehicle scheduling and routing for small and medium-sized delivering service companies
มหาวิทยาลัยเกษตรศาสตร์ Anan Mungwattana | Natchanun Angsuseranee | วิทยานิพนธ์/Thesis |
| A new heuristic to compute efficient policies for one-warehouse N-Retailer inventory system
มหาวิทยาลัยเกษตรศาสตร์ Anan Mungwattana | Duangrat Hirunyasiri | วิทยานิพนธ์/Thesis |