An Algorithm for Determining the Best Lower Bound for the Stochastic Joint Replenishment Problem
Published Online:1 Oct 2007https://doi.org/10.1287/opre.1070.0401
References
- One warehouse multiple retailer systems with vehicle routing costs. Management Sci. (1990) 36:92–114Link, Google Scholar
- Periodic versus can-order policies for coordinated multi-item inventory systems. Management Sci. (1988) 34:791–796Link, Google Scholar
- Lower bounds for multi-echelon stochastic inventory systems. Management Sci. (1994) 40:1426–1443Link, Google Scholar
- The greedy procedure for resource allocation problems: Necessary and sufficient conditions for optimality. Oper. Res. (1986) 34:909–918Link, Google Scholar
- An efficient algorithm for computing an optimal (r, Q) policy in continuous review stochastic inventory systems. Oper. Res. (1992a) 40:808–813Link, Google Scholar
- The joint replenishment problem with general joint cost structures. Oper. Res. (1992b) 40:384–403Link, Google Scholar
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region. Eur. J. Oper. Res. (1991) 54:227–236Crossref, Google Scholar
- A dynamic programming algorithm for joint replenishment under general order cost functions. Management Sci. (1985) 31:369–373Link, Google Scholar
- Periodic review (s, S) policies for joint replenishment inventory systems. Management Sci. (1997) 43:1447–1454Link, Google Scholar
- An algorithm for determining the best lower bound for the stochastic joint replenishment problem. (2004) . Unabridged working paper, Nanyang Business School, Nanyang Technological University, SingaporeGoogle Scholar
- Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems. Management Sci. (1997) 43:294–312Link, Google Scholar
- Finding optimal (s, S) policies is as simple as evaluating a single policy. Oper. Res. (1991) 39:654–665Link, Google Scholar
