Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

A note on the can-order policy for the two-item stochastic joint-replenishment problem

10 references·4 citing·33 second hop

FromToDepth

this work references cited by second hop

References

1964On a Basic Class of Multi-Item Inventory Problems178 cited
1984Coordinated Replenishments in a Multi-Item Inventory System with Compound Poisson Demands162 cited
1974A control system for coordinated inventory replenishment118 cited
1969Optimal Continuous Review Policies for Two Product Inventory Systems with Joint Setup Costs93 cited
1992A Comparison of Three Joint Ordering Inventory Policies*65 cited
1981Establishing reorder points in the ( S,c,s ) coordinated control system under compound Poisson demand63 cited
1975A coordinated inventory control system for compound Poisson demand and zero lead time†59 cited
1994Optimal Control Policy for Stochastic Inventory Systems with Markovian Discount Opportunities47 cited
1988A Heuristic with Lower Bound Performance Guarantee for the Multi-Product Dynamic Lot-Size Problem28 cited
1999Can-order policies for coordinated inventory replenishment with Erlang distributed times between ordering25 cited

Cited by

2023Adaptive inventory replenishment using structured reinforcement learning by exploiting a policy structure17 cited
2022The joint replenishment problem: Optimal policy and exact evaluation method16 cited
2022A review of the joint replenishment problem from 2006 to 202215 cited
2015Applying Genetic Algorithm for Can-Order Policies in the Joint Replenishment Problem

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

13 cited