A note on Tempelmeier's {\beta}-service measure under non-stationary stochastic demand

نویسندگان

  • Roberto Rossi
  • S. Armagan Tarim
  • Onur A. Kilic
چکیده

Tempelmeier (2007) considers the problem of computing replenishment cycle policy parameters under non-stationary stochastic demand and service level constraints. He analyses two possible service level measures: the minimum no stock-out probability per period (α-service level) and the so called “fill rate”, that is the fraction of demand satisfied immediately from stock on hand (β-service level). For each of these possible measures, he presents a mixed integer programming (MIP) model to determine the optimal replenishment cycles and corresponding order-up-to levels minimizing the expected total setup and holding costs. His approach is essentially based on imposing service level dependent lower bounds on cycle orderup-to levels. In this note, we argue that Tempelmeier’s strategy, in the β-service level case, while being an interesting option for practitioners, does not comply with the standard definition of “fill rate”. By means of a simple numerical example we demonstrate that, as a consequence, his formulation might yield sub-optimal policies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Approach of Convergence to Stationary State of Multi Server Queue with Balking (TECHNICAL NOTE)

This investigation deals with multi server queue with balking. The customers arrive in poisson fashion and independent of time, under the assumption that system is initially empty. The number of customers in the system is stochastically increasing and distributed in steady state (stationary state) as required. The expressions for the measure of the speed of convergence from transient state to s...

متن کامل

Optimal flexible capacity in newsboy problem under stochastic demand and lead-time

In this paper, we consider a newsvendor who is going to invest on dedicated or flexible capacity, our goal is to find the optimal investment policy to maximize total profit while the newsvendor faces uncertainty in lead time and demand simultaneously. As highlighted in literature, demand is stochastic, while lead time is constant. However, in reality lead time uncertainty decreases newsvendor's...

متن کامل

Computing Replenishment Cycle Policy under Non-stationary Stochastic Lead Time

In this paper we address the general multi-period production/inventory problem with non-stationary stochastic demand and supplier lead time under service-level constraints. A replenishment cycle policy (Rn,Sn) is modeled, where Rn is the n-th replenishment cycle length and Sn is the respective order-up-to-level. Initially we extend an existing formulation for this policy in a way to incorporate...

متن کامل

Production Planning under Stochastic Time-varying Demand: Flexible Service Level Approach

Consider stochastic production-inventory control problem in which there are multiple capacity sources, multiple heterogeneous products, non-stationary demand and time-varying costs. If shortage costs can be evaluated the natural objective is to minimize expected production, inventory and shortage costs. Otherwise one can use service level requirements as target inventory while trying to minimiz...

متن کامل

Efficiency and Effectiveness with interval indices in stochastic environments

Non-parametric DEA is a technique on the basic of mathematical programming to determine the efficiency of homological decision making units. DEA models changes in demand cause changes in variations in output levels and also will cause changes in a firm’s inefficiency. Often a firm can adjust input influencing on the output level. Models designed with technique on DEA that considers changes in d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011