2012
DOI: 10.1287/opre.1110.1009
|View full text |Cite
|
Sign up to set email alerts
|

Lower Bounds and Heuristics for Supply Chain Stock Allocation

Abstract: Assume that m periods with stochastic demand remain until the next replenishment arrives at a central warehouse. How should the available inventory be allocated among N retailers? This paper presents a new policy and a new lower bound for the expected cost of this problem. The lower bound becomes tight as N → ∞ . The infinite horizon problem then decomposes into N independent m-period problems with optimal retailer ship-up-to levels that decrease over the m periods, and the warehouse is optimally replenished … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
32
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 46 publications
(32 citation statements)
references
References 33 publications
0
32
0
Order By: Relevance
“…The balance assumption has been widely applied in inventory study. Literature that uses or relies on the balance assumption includes the works in [5,[8][9][10][11][12][13][14][15][16], and references therein.…”
Section: Allocation Policy At the Warehousementioning
confidence: 99%
“…The balance assumption has been widely applied in inventory study. Literature that uses or relies on the balance assumption includes the works in [5,[8][9][10][11][12][13][14][15][16], and references therein.…”
Section: Allocation Policy At the Warehousementioning
confidence: 99%
“…Inventory management and inventory control is a well-discussed field, not surprisingly there are a high number of publications with diverse focus projections (cf. Axsäter et al [30]; Berling and Marlund [31]; Marklund and Rosling [32]). However, the main principles behind inventory management are similar throughout the literature, i.e.…”
Section: Inventory Controlmentioning
confidence: 99%
“…Many studies use the balance assumption because of its mathematical tractability. However, the balance assumption does not always provide a good approximation, for example, in situations where the order cycles are long, the demand variability is high, and the retailers are very different in terms of service requirements and demand characteristics (Axsäter 2002, Marklund and Rosling 2012, Dogru et al 2009. Other literature focuses on specific heuristic allocation policy.…”
Section: Literature Reviewmentioning
confidence: 99%
“…For each of the 378 cases, we first use the heuristic dynamic allocation policy we proposed and find a reasonable good solution S h 0 . For a fair comparison of allocation policies, we use the same S h 0 for myopic optimal allocation and virtual allocation (Marklund and Rosling 2012). As there are only two types of retailers, we are able to find the optimal S for myopic optimal allocation and virtual allocation with given S h 0 by enumeration approach using lower bounds and upper bounds.…”
Section: Heuristic Dynamic Allocation Policymentioning
confidence: 99%
See 1 more Smart Citation