Periodic review (s, S) policies for joint replenishment inventory systems
Article Abstract:
A new class of policies is proposed for the joint replenishment problem (JRP) with stochastic demand. JRP is an inventory control problem observed in multiitem, joint replenishment inventory systems where replenishments can be coordinated. The proposed policy, called P(s, S) policy, entails the review of the inventory of each item at fixed and constant time intervals. Computation of the (s, S) policy for each of these items is based on the assumption that the item carries the minor and not the major setup cost. The P(s, S) policy involves more computations than the periodic policies of Atkins and Iyogun (1988), but these additional computational requirements should not be too burdensome due to recent advances in algorithms for computation of (s, S) policies. In addition, the practical implementation of the new policy should not present any problem.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
A Dynamic Programming Algorithm For Joint Replenishment Under General Order Cost Functions
Article Abstract:
The multi-item joint replenishment problem is generalized to allow ordering costs to be dependent on the specific items jointly supplied. A fixed cycle approach is examined in which all the items of a group are always jointly replenished. A dynamic programming algorithm is developed for partitioning the items into groups, each with its own fixed cycle time, resulting in an optimal fixed cycle replenishment policy.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1985
User Contributions:
Comment about this article or add new information about this topic:
Comment on "a dynamic programming algorithm for joint replenishment under general order cost functions."
Article Abstract:
Rosenblatt and Kaspi's proposed Dynamic Programming algorithm for an optimum partition problem is demonstrated to be incorrect. An alternative Dynamic Programming algorithm is offered for the problem. The alternative algorithm is not guaranteed to provide an optimal solution, and should be considered to be heuristic.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1987
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Designing the future. The hot zones for entrepreneurs. Preventive medicine
- Abstracts: A heuristic algorithm for the capacitated multiple supplier inventory grouping problem. Multiperiod capacity expansion in globally dispersed regions
- Abstracts: Prudential margin policy in a futures-style settlement system. Efficient use of commodity futures in diversified portfolios
- Abstracts: A comparison of strategies to dampen nervousness in MRP systems. A Lot-Sizing Algorithm for Reducing Nervousness in MRP Systems
- Abstracts: A dual ascent procedure for multiproduct dynamic demand coordinated replenishment with backlogging. Reducing Control Loss in Organizations: The Implications of Dual Hierarchies, Mentoring and Strengthing Vertical Dyadic Linkages