Time-Partitioning Heuristics: Application to One Warehouse, Multiitem, Multiretailer Lot-Sizing Problems

Naval Research Logistics

Volumn 46, Issue 5, 1999, Pages 463-486

  Federgruen, Awi ^a   Tzur, Michal ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004601104     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199908)46:5<463::AID-NAV2>3.0.CO;2-S     Document Type: Article

References (27)

1. A. Aggarwal and J.K. Park, Improved algorithms for economic lot size problems, Oper Res 41 (1993), 549-571.
2. E. Arkin, D. Joneja, and R. Roundy, Computational complexity of uncapacitated multi-echelon production planning problems, Oper Res Lett 8 (1989), 61-66.
3. A. Bensoussan, J.M. Proth, and M. Queyranne, A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs, Nav Res Logistics 38 (1991), 729-742.
4. S. Chand and T.E. Morton, Minimal forecast horizon procedures for dynamic lot size models, Nav Res Logistics Quart 33 (1986), 111-122.
5. R.E. Erickson, C.L. Monma, and A.F. Veinott, Jr., Send-and-split method for minimum-concave-cost network flows, Math Oper Res 12 (1987), 634-664.
6. A. Federgruen and D. Simchi-Levi, "Analytical analysis of vehicle routing and inventory routing problems," Handbook on operations research and management science, M. Ball, T. Magnanti, C. Monma, and G. Nemhauser (Editors), Vol. 8.
7. A. Federgruen and M. Tzur, A simple forward algorithm to solve general dynamic lot-sizing models with n periods in O(n log n) or O(n) time, Manage Sci 37 (1991), 909-925.
8. A. Federgruen and M. Tzur, Minimal forecast horizons and a new planning procedure for the general dynamic lot sizing model: Nervousness revisited, Oper Res 42 (1994), 456-468.
9. A. Federgruen and M. Tzur, The Joint Replenishment Problem with time-varying parameters: Efficient, asymptotic and ε-optimal solutions, Oper Res 42 (1994), 1067-1087.
10. A. Federgruen and M. Tzur, Capacitated lot-sizing models, Working paper, Graduate School of Business, Columbia University, New York, 1995.
11. A. Federgruen and Y.S. Zheng, The joint replenishment problem with general joint cost structures: general solution methods and performance bounds, Oper Res 40 (1994), 378-404.
12. M. Florian, J.K. Lenstra, and A.H.G. Rinnooy Kan, Deterministic production planning: algorithms and complexity, Manage Sci 26 (1980), 669-679.
13. M. Haimovich and A.H.G. Rinnooy Kan, Bounds and heuristics for capacitated routing problems, Math Oper Res 10 (1985), 527-542.
14. D. Joneja, The joint replenishment problem: New heuristics and worst case performance bounds, Oper Res 38 (1990), 711-723.
15. D. Joneja, Multi-echelon assembly systems with nonstationary demands: Heuristics and worst case performance bounds, Oper Res 39 (1991), 512-518.
16. R.M. Karp, Probabilistic analysis of partitioning algorithms for the travelling salesman problems in the plane, Math Oper Res 2 (1977), 209-224.
17. S.F. Love, A facilities in series inventory model with nested schedules. Manage Sci 18 (1972), 327-338.
18. T. Morin, "Computational advances in dynamic programming," Dynamic programming and its applications, M. Puterman (Editor), Academic, New York, 1977, pp. 53-91.
19. J.A. Muckstadt and R. Roundy, Multi-item, one-warehouse, multi-retailer distribution systems, Manage Sci 33 (1987), 1613-1621.
20. M. Queyranne, Finding 94% effective policies in linear time for some production/inventory systems. Working paper, University of British Columbia, Vancouver, Canada, 1987.
21. P. Raghavan and M.R. Rao, The multi-item lot sizing problem with joint replenishments: A polyhedral approach, Technical Report SOR-91-8, Department of Statistics and Operations Research. Leonard N. Stern School of Business, New York University, New York, 1991.
22. R. Roundy, 98% effective integer ratio lot sizing for one warehouse multi-retailer systems. Manage Sci 31 (1985), 1416-1430.
23. M. Salomon, Deterministic lotsizing models for production planning, Ph.D. dissertation, Erasmus University, Rotterdam, Netherlands, 1990.
24. L.S. Stowers and U.S. Palekar, A dual ascent procedure for the joint replenishment problem, Working paper, University of Illinois at Urbana-Champaign, Department of Mechanical and Industrial Engineering, Champaign, 1994.
25. M. Tzur, A new planning approach for single and multi item dynamic lot-sizing models, Ph.D. dissertation, Columbia University, New York, 1992.
26. A.P.M. Wagelmans, C.P.M. Van Hoesel, and A. Kolen, Economic lot-sizing: An O(n log n)-algorithm that runs in linear time in the Wagner-Whitin case. Oper Res 40 (1992). S145-S156.
27. W.I. Zangwill, A backlogging model and a multi-echelon model of a dynamic economic lot size production system - a network approach, Manage Sci 15 (1969), 506-527.