96 research outputs found
Comparison of two methods for customer differentiation
In response to customer specific time guarantee requirements, service providers can offer differentiated ser- vices. However, conventional customer differentiation methods often lead to high holding costs and may have some practical drawbacks. We compare two customer differentiation policies: stock reservation and pipeline stock priority for high priority customers. We derive exact analytical expressions of the waiting time distri- bution of both types of customers for a stock reservation policy. We then provide accurate approximation methods for a pipeline stock priority policy. By comparison, we offer insights concerning which method should be used under different service level requirements
Enabling customer satisfaction and stock reduction through service differentiation with response time guarantees
In response to customer specific service time guarantee requirements, service providers can offer differentiated services. However, conventional customer differentiation models based on fill rate constraints do not take full advantage of the stock reduction that can be achieved by differentiating customers based on agreed response times. In this paper we focus on the (S â 1, S, K) model with two customer classes, in which low priority customers are served only if the inventory level is above K. We employ lattice paths combinatorics to derive the exact distribution of the response time (within leadtime) for the lower priority class and provide a simple and accurate approximation for the response time of the high priority class. We show that the stock levels chosen based on agreed response times can be significantly lower than the ones chosen based on fillrates. This indicates that response time guarantees are an efficient tool in negotiating after-sale contracts, as they improve customer satisfaction and reduce investment costs
Piecewise linear approximations for the static-dynamic uncertainty strategy in stochastic lot-sizing
In this paper, we develop mixed integer linear programming models to compute
near-optimal policy parameters for the non-stationary stochastic lot sizing
problem under Bookbinder and Tan's static-dynamic uncertainty strategy. Our
models build on piecewise linear upper and lower bounds of the first order loss
function. We discuss different formulations of the stochastic lot sizing
problem, in which the quality of service is captured by means of backorder
penalty costs, non-stockout probability, or fill rate constraints. These models
can be easily adapted to operate in settings in which unmet demand is
backordered or lost. The proposed approach has a number of advantages with
respect to existing methods in the literature: it enables seamless modelling of
different variants of the above problem, which have been previously tackled via
ad-hoc solution methods; and it produces an accurate estimation of the expected
total cost, expressed in terms of upper and lower bounds. Our computational
study demonstrates the effectiveness and flexibility of our models.Comment: 38 pages, working draf
Approximation Algorithms for Stochastic Inventory Control Models
Approximation Algorithms for Stochastic Inventory Control Model
Inventory control for point-of-use locations in hospitals
Most inventory management systems at hospital departments are characterised by lost sales, periodic reviews with short lead times, and limited storage capacity. We develop two types of exact models that deal with all these characteristics. In a capacity model, the service level is maximised subject to a capacity restriction, and in a service model the required capacity is minimised subject to a service level restriction. We also formulate approximation models applicable for any lost-sales inventory system (cost objective, no lead time restrictions etc). For the capacity model, we develop a simple inventory rule to set the reorder levels and order quantities. Numerical results for this inventory rule show an average deviation of 1% from the optimal service levels. We also embed the single-item models in a multi-item system. Furthermore, we compare the performance of fixed order size replenishment policies and (R, s, S) policies
Recommended from our members
On Double-Boundary Non-Crossing Probability for a Class of Compound Processes with Applications
We develop an efficient method for computing the probability that a non-decreasing, pure jump (compound) stochastic process stays between arbitrary upper and lower boundaries (i.e., deterministic
functions, possibly discontinuous) within a finite time period. The compound process is composed of a process modelling the arrivals of certain events (e.g., demands for a product in inventory systems, customers in queuing, or claims/capital gains in insurance/dual risk models), and a sequence of independent and identically distributed random variables modelling the sizes of the events. The events arrival process is assumed to belong to the wide class of point processes with conditional stationary independent increments which includes (non-)homogeneous Poisson, binomial, negative binomial, mixed Poisson and doubly stochastic Poisson (i.e., Cox) processes as special cases. The proposed method is based on expressing the non-exit probability through Chapman-Kolmogorov equations, re-expressing them in terms of a circular convolution of two vectors which is then computed applying fast Fourier transform (FFT). We further demonstrate that our FFT-based method is computationally efficient and can be successfully applied in the context of inventory management (to determine an optimal replenishment policy), ruin theory (to evaluate
ruin probabilities and related quantities) and double-barrier option pricing or simply computing non-exit probabilities for Brownian motion with general boundaries
- âŠ