共 50 条
The cost allocation issue in joint replenishment
被引:10
|作者:
Dror, Moshe
[2
]
Hartman, Bruce C.
[1
]
Chang, Wei
[3
]
机构:
[1] American Univ, Kogod Sch Business, Washington, DC 20016 USA
[2] Univ Arizona, MIS Dept, Eller Coll Management, Tucson, AZ 85721 USA
[3] Univ Pittsburgh, Pittsburgh, PA USA
关键词:
Cost allocation;
Inventory games;
Joint replenishment;
Allocation sensitivity;
INVENTORY CENTRALIZATION;
GAME;
COOPERATION;
D O I:
10.1016/j.ijpe.2011.07.015
中图分类号:
T [工业技术];
学科分类号:
08 ;
摘要:
Joint replenishment for several products to achieve a lower inventory logistics cost has been a topic of extensive studies. Less attention has been paid to the issue of deciding how the joint replenishment costs should be allocated across the individual products. Ideally, when items are ordered together one would require a stable cost allocation, such that no subset of products subsidizes another subset. When part of each product's ordering cost is product specific and part can be shared with other products (like in a 3PL setting of Anily and Haviv), it has been shown that even when a stable allocation exists, such an allocation might be difficult to compute. In addition, usually the components of ordering costs are partially determined using estimates and accounting discretion. This paper provides two main insights for determining an appropriate cost allocation. It provides the means to test how sensitive a stable cost allocation is to a range of cost parameter values. Then, in a computational study, it is shown how to obtain a stable cost allocation without excessive computation. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:242 / 254
页数:13
相关论文