A Test of Wagner’s Heuristics for the Spare Parts Inventory Control Problem

A Test of Wagner’s Heuristics for the Spare Parts Inventory Control Problem

Ibrahim S. Kurtulus
DOI: 10.4018/joris.2012100106
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Over the years, Wagner’s (1975) heuristic rules appealed to the practitioners because they had simple data requirements, were easy to understand and hence easy to apply. In his algorithmic solution, Wagner assumes that the exact distribution of demand (during lead time) is known. If such a distribution is not available, he recommends using the normal distribution. The author’s purpose is to compare the cost of the solutions provided by Wagner’s (1975) heuristics to optimal (Archibald & Silver, 1978) and determine their quality. Their second goal is to perform sensitivity analysis on the results with respect to demand’s skewness, the ratio of ordering cost to carrying cost. The author’s third goal is to use as much actual data as they possibly can.
Article Preview
Top

Introduction

The problem studied is a joris.2012100106.m01 type of inventory control system (Hadley & Whitin, 1963) for a single item, which is subject to sporadic demand that is also highly variable in size. Item replenishment occurs after a fixed period of time joris.2012100106.m02 (lead time) and there is a fixed ordering (or setup) cost joris.2012100106.m03 plus a unit costjoris.2012100106.m04. Units carried in excess of demand incur a holding cost of joris.2012100106.m05 per unit and demand not satisfied is backordered and incurs a penalty cost of joris.2012100106.m06 per unit. The objective function is to minimize the expected value of the sum of carrying, backordering and ordering costs. Although most problems of this nature can be solved optimally, when mean demand and its frequency of occurrence are small and backordering costs are high, it takes a very long time (days) to find the optimal solution, indicating that we still need heuristics. The goals of this research - none of which have been addressed before - are as follows:

  • 1.

    Using the expected total cost as the criterion, compare the performance of two popular heuristic lot sizing rules (Wagner, 1975) with the corresponding optimal solutions.

  • 2.

    Perform sensitivity analysis on ordering costs, carrying costs, and the symmetry of the distribution of demand. Show how each affects the performance of the heuristics.

  • 3.

    Use as much actual data as possible.

For the problem discussed, when the ordering decisions are restricted to demand occurrences, a policy of type joris.2012100106.m07 will minimize the undiscounted expected cost over an infinite horizon (Beckmann, 1961; Vienott & Wagner, 1965; Iglehart, 1963; Archibald & Silver, 1978; Ehrhard, 1979). Accordingly, when inventory on hand plus on order minus backorders, joris.2012100106.m08 is less than or equal tojoris.2012100106.m09, a replenishment order of size joris.2012100106.m10 is placed (Silver & Peterson, 1985).

In studies dealing with the spare parts inventory control problem, various assumptions have been made with respect to demand. However, the most commonly used were the Poisson distribution (Schultz, 1987; Gelders & Van Looy, 1978; Hadley & Whitin, 1963) and the normal distribution (Croston, 1972; Bartakke, 1981; Porteus, 1985; Vereecke & Verstraeten, 1994; Sani & Kingsman, 1997).

A few (Dunsmuir & Snyder, 1989; Segerstedt, 1994; Yeh, 1997) have used the gamma distribution, for demand size and occurrence, after observing that most spare parts inventories typically possess positively skewed frequency profiles with a large spike at zero.

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 14: 1 Issue (2023)
Volume 13: 2 Issues (2022)
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing