A simple heuristic for echelon (r, n Q, T) policies in serial supply chains

Published

Journal Article

This paper proposes a simple heuristic that generates a solution for echelon (r, n Q, T) policies by sequentially solving a deterministic demand problem, a subproblem with fixed reorder intervals, and a subproblem with fixed batch sizes. For each of these problems, we further simplify the computation by solving a series of single-stage systems whose parameters are obtained directly from the original problem data. In a numerical study, we find that this heuristic outperforms an existing one in the literature. © 2009 Elsevier B.V. All rights reserved.

Full Text

Duke Authors

Cited Authors

  • Shang, KH; Zhou, SX

Published Date

  • November 1, 2009

Published In

Volume / Issue

  • 37 / 6

Start / End Page

  • 433 - 437

International Standard Serial Number (ISSN)

  • 0167-6377

Digital Object Identifier (DOI)

  • 10.1016/j.orl.2009.08.003

Citation Source

  • Scopus