Skip to main content
Duke University Libraries
DukeSpace Scholarship by Duke Authors
  • Login
  • Ask
  • Menu
  • Login
  • Ask a Librarian
  • Search & Find
  • Using the Library
  • Research Support
  • Course Support
  • Libraries
  • About
View Item 
  •   DukeSpace
  • Duke Scholarly Works
  • Scholarly Articles
  • View Item
  •   DukeSpace
  • Duke Scholarly Works
  • Scholarly Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Thumbnail
View / Download
209.9 Kb
Date
2010-03-01
Authors
Shang, KH
Zhou, SX
Repository Usage Stats
347
views
468
downloads
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.
Type
Journal article
Permalink
https://hdl.handle.net/10161/4433
Published Version (Please cite this version)
10.1287/opre.1090.0734
Publication Info
Shang, KH; & Zhou, SX (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.
Collections
  • Scholarly Articles
More Info
Show full item record

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.
Open Access

Articles written by Duke faculty are made available through the campus open access policy. For more information see: Duke Open Access Policy

Rights for Collection: Scholarly Articles


Works are deposited here by their authors, and represent their research and opinions, not that of Duke University. Some materials and descriptions may include offensive content. More info

Make Your Work Available Here

How to Deposit

Browse

All of DukeSpaceCommunities & CollectionsAuthorsTitlesTypesBy Issue DateDepartmentsAffiliations of Duke Author(s)SubjectsBy Submit DateThis CollectionAuthorsTitlesTypesBy Issue DateDepartmentsAffiliations of Duke Author(s)SubjectsBy Submit Date

My Account

LoginRegister

Statistics

View Usage Statistics
Duke University Libraries

Contact Us

411 Chapel Drive
Durham, NC 27708
(919) 660-5870
Perkins Library Service Desk

Digital Repositories at Duke

  • Report a problem with the repositories
  • About digital repositories at Duke
  • Accessibility Policy
  • Deaccession and DMCA Takedown Policy

TwitterFacebookYouTubeFlickrInstagramBlogs

Sign Up for Our Newsletter
  • Re-use & Attribution / Privacy
  • Harmful Language Statement
  • Support the Libraries
Duke University