Skip to main content
Journal cover image

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

Publication ,  Journal Article
Shang, KH; Zhou, SX
Published in: Operations Research Letters
November 1, 2009

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.

Duke Scholars

Published In

Operations Research Letters

DOI

ISSN

0167-6377

Publication Date

November 1, 2009

Volume

37

Issue

6

Start / End Page

433 / 437

Related Subject Headings

  • Operations Research
  • 4901 Applied mathematics
  • 1503 Business and Management
  • 0103 Numerical and Computational Mathematics
  • 0102 Applied Mathematics
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Shang, K. H., & Zhou, S. X. (2009). A simple heuristic for echelon (r, n Q, T) policies in serial supply chains. Operations Research Letters, 37(6), 433–437. https://doi.org/10.1016/j.orl.2009.08.003
Shang, K. H., and S. X. Zhou. “A simple heuristic for echelon (r, n Q, T) policies in serial supply chains.” Operations Research Letters 37, no. 6 (November 1, 2009): 433–37. https://doi.org/10.1016/j.orl.2009.08.003.
Shang KH, Zhou SX. A simple heuristic for echelon (r, n Q, T) policies in serial supply chains. Operations Research Letters. 2009 Nov 1;37(6):433–7.
Shang, K. H., and S. X. Zhou. “A simple heuristic for echelon (r, n Q, T) policies in serial supply chains.” Operations Research Letters, vol. 37, no. 6, Nov. 2009, pp. 433–37. Scopus, doi:10.1016/j.orl.2009.08.003.
Shang KH, Zhou SX. A simple heuristic for echelon (r, n Q, T) policies in serial supply chains. Operations Research Letters. 2009 Nov 1;37(6):433–437.
Journal cover image

Published In

Operations Research Letters

DOI

ISSN

0167-6377

Publication Date

November 1, 2009

Volume

37

Issue

6

Start / End Page

433 / 437

Related Subject Headings

  • Operations Research
  • 4901 Applied mathematics
  • 1503 Business and Management
  • 0103 Numerical and Computational Mathematics
  • 0102 Applied Mathematics