Optimal and Heuristic Echelon (r,nQ,T) policies in serial inventory systems with fixed costs

Loading...
Thumbnail Image

Date

2010-03-01

Journal Title

Journal ISSN

Volume Title

Citation Stats

Abstract

This paper studies a periodic-review, serial inventory system in which echelon (r,nQ,T) policies are implemented. Under such a policy, each stage reviews its inventory in every T period and orders according to an echelon (r,nQ,T) policy. Two types of fixed costs are considered: one is associated with each order batch Q, and the other is incurred for each inventory review. The objective is to find the policy parameters such that the average total cost per period is minimized. This paper provides a method for obtaining heuristic and optimal policy parameters. The heuristic is based on minimizing lower and upper bounds on the total cost function. These total cost bounds, which are separable functions of the policy parameters, are obtained in two steps: First, we decompose the total cost into costs associated with each stage, which include a penalty cost for holding inadequate stock. Second, we construct lower and upper bounds for the penalty cost by regulating downstream policy parameters. To find the optimal solution, we further construct cost bounds for each echelon (a subsystem that includes a stage and all of its downstream stages) by regulating holding and backorder cost parameters. The echelon lower-bound cost functions, as well as the stage cost bounds, generate bounds for the optimal solution. In a numerical study, we find that the heuristic is near optimal when the ratio of the fixed cost to the holding cost at the most downstream stage is large. We also find that changing the optimal batch sizes may not affect the optimal reorder intervals or, equivalently, the delivery schedules under some conditions. © 2010 INFORMS.

Department

Description

Provenance

Subjects

Citation

Published Version (Please cite this version)

10.1287/opre.1090.0734

Publication Info

Shang, KH, and SX Zhou (2010). Optimal and Heuristic Echelon (r,nQ,T) policies in serial inventory systems with fixed costs. Operations Research, 58(2). pp. 414–427. 10.1287/opre.1090.0734 Retrieved from https://hdl.handle.net/10161/4433.

This is constructed from limited available data and may be imprecise. To cite this article, please review & use the official citation provided by the journal.

Scholars@Duke

Shang

Kevin H. Shang

Joseph J. Ruvane, Jr. Distinguished Professor

Kevin Shang is the Joseph J. Ruvane, Jr. Distinguished Professor of Operations Management at the Fuqua School of Business, Duke University. Professor Shang received his M.B.A. from University of California, Riverside in 1998 and Ph.D. from University of California, Irvine in 2002.

Professor Shang's expertise is in supply chain management and inventory control. His research mainly focuses on developing simple and effective inventory policies for supply chain systems. Prof. Shang also conducts research in the interface of operations and finance and renewable energy systems.

Professor Shang's research has appeared in several leading management journals, including Management Science, Manufacturing and Service Operations Management, Operations Research. Several of his papers received research awards from professional societies. He has served as an editorial board member for several leading academic journals.


Unless otherwise indicated, scholarly articles published by Duke faculty members are made available here with a CC-BY-NC (Creative Commons Attribution Non-Commercial) license, as enabled by the Duke Open Access Policy. If you wish to use the materials in ways not already permitted under CC-BY-NC, please consult the copyright owner. Other materials are made available here through the author’s grant of a non-exclusive license to make their work openly accessible.