<p>This thesis studies the allocation of stock in a two-level inventory system with stochastic demand. The system consists of one central warehouse which supplies N non-identical retailers with one single product. Customer demand occurs solely at the retailers and follows independent Poisson processes. The purpose is to investigate the value of using a more advanced allocation policy than First Come-First Serve at the central warehouse. The focus is on evaluating how well the simple First Come-First Serve assumption works in a system where the warehouse has access to real-time point-of-sale data, and where shipments are time based and consolidated for all retailers. The considered allocation policy is a myopic policy where the solution to a minimization problem, formulated as a constrained newsvendor problem, determines how the warehouse allocates its stock to the retailers. The minimization problem is solved using (a heuristic method based on) Lagrangian relaxation, and simulation is used to evaluate the average inventory holding costs and backorder costs per time unit when using the considered policy. The simulation study shows that cost savings around 1-4 percent can be expected for most system configurations. However, there were cases where savings were as high as 5 percent, as well as cases where the policy performed worse than First Come-First Serve. The study also shows that the highest cost savings are found in systems with relatively low demand, few retailers, short transportation times and a short time interval between shipments.</p>
Identifer | oai:union.ndltd.org:UPSALLA/oai:DiVA.org:liu-10410 |
Date | January 2007 |
Creators | Howard, Christian |
Publisher | Linköping University, Department of Mathematics, Matematiska institutionen |
Source Sets | DiVA Archive at Upsalla University |
Language | English |
Detected Language | English |
Type | Student thesis, text |
Page generated in 0.0171 seconds