Multistage Lot Sizing Problems via Randomized Rounding
Published Online:1 Aug 2001https://doi.org/10.1287/opre.49.4.599.11222
References
- 98%-Effective lot sizing policies for series inventory systems with backlogging. Oper. Res. (1995) 43:335–345Link, Google Scholar
- Lot sizing policies for finite production rate assembly systems. Oper. Res. (1992) 40:126–141Link, Google Scholar
- The economic lot-scheduling problem: achieving feasibility using time-varying lot sizes. Oper. Res. (1987) 35:764–771Link, Google Scholar
- , Guy R., Submodular Functions, Matroids and Certain Polyhedra, Combinatorial Structures and Their Applications (1970) (Gordon and Breach, New York) 69–87Google Scholar
- Optimal power-of-two replenishment strategies in capacitated general production/distribution networks. Management Sci. (1993) 39(6):710–727Link, Google Scholar
- Simple power-of-two policies are close to optimal in a general class of production/distribution system with general joint setup costs. Math. Oper. Res. (1992) 17(4Link, Google Scholar
- Convex separable optimization is not much harder than linear optimization. J. ACM (1990) 37:843–861Crossref, Google Scholar
- The joint replenishment problem with power-of-two restriction. AIIE Trans. (1985) 17:25–32Google Scholar
- Determining optimal reorder intervals in capacitated production-distribution systems. Management Sci. (1988) 34:938–958Link, Google Scholar
- Minimizing separable convex objective on arbitrary directed trees of variable upperbound constraints. Math. Oper. Res. (1991) 16:504–533Link, Google Scholar
- Approximation procedures for the one-warehouse multi-retailer system. Management Sci. (1994) 40:1305–1316Link, Google Scholar
- Establishing consistent and realistic reorder intervals in production-distribution systems. Oper. Res. (1985) 33:1316–1341Link, Google Scholar
- , Graves S. C., Rinnooy Kan A. H. G., Zipkin P. H. Analysis of multistage production systems. Logistics of Production and Inventory (1993) (North Holland, Amsterdam) 59–131Crossref, Google Scholar
- Interior-point polynomial methods in convex programming (1994) (SIAM, Philadelphia) Crossref, Google Scholar
- Finding 94% effective policies in linear time for some production/inventory systems. (1987) . Unpublished manuscriptGoogle Scholar
- 98% Effective integer-ratio lot sizing for one warehouse multi-retailer systems. Management Sci. (1985) 31:1416–1430Link, Google Scholar
- A 98% Effective lot sizing rule for a multi-product, multi-stage production inventory system. Math. Oper. Res. (1986) 11:699–727Link, Google Scholar
- Rounding off to powers of two in continuous relaxations of capacitated lot sizing problems. Management Sci. (1989) 35:1433–1442Link, Google Scholar
- Constructing approximation algorithms via linear programming relaxations. (1996) . Doctoral Thesis, MIT, Cambridge, MAGoogle Scholar
- , Cunningham W., McCormicks S., Queyranne M. On improved randomized algorithms for lot sizing problems. Proc. of the 5th Integer Programming and Combinatorial Optimization Conference (1996) (Springer-Verlag, Berlin) 359–373LNCS 1084Crossref, Google Scholar
- Replenishment strategies for production/distribution networks with general joint setup costs. (1987) . Doctoral thesis, Columbia University, New YorkGoogle Scholar

