Improved Rolling Schedules for the Dynamic Single-Level Lot-Sizing Problem

References

  • Baker K. R. An experimental study of the effectiveness of rolling schedules in production planning. Decision Sci. (1977) 8:19–27CrossrefGoogle Scholar
  • Baker K. R. Lot-sizing procedures and a standard data set. A reconciliation of the literature. J. Manufacturing Oper. Management (1989) 2:199–221Google Scholar
  • Baker K. R., Petersen D. W. An analytic framework for evaluating rolling schedules. Management Sci. (1979) 25:341–351LinkGoogle Scholar
  • Bensoussan A., Proth J.-M., Queyranne M. A planning horizon algorithm for deterministic inventory management with piecewise linear concave cost. Naval Res. Logist. (1991) 38:729–742CrossrefGoogle Scholar
  • Berry W. L. Lot sizing procedures for requirements planning systems: A framework for analysis. Prod. Inventory Management (1972) 13(2):19–34Google Scholar
  • Blackburn J. D., Millen R. A. Heuristic lot-sizing performance in a rolling-schedule environment. Decision Sci. (1980) 11:691–701CrossrefGoogle Scholar
  • Carlson R. C., Beckmann S. L., Kropp D. H. The effectiveness of extending the horizon in rolling production scheduling. Decision Sci. (1982) 13:129–146CrossrefGoogle Scholar
  • Chand S. A note on dynamic lot-sizing in a rolling-horizon environment. Decision Sci. (1982) 13:113–119CrossrefGoogle Scholar
  • Chand S., Morton T. E. Minimal forecast horizon procedures for dynamic lot size models. Naval Res. Logist. Quart. (1986) 33:111–122CrossrefGoogle Scholar
  • Chand S., Sethi S., Sorger G. Forecast horizons in the discounted dynamic lot size model. Management Sci. (1992) 38:1034–1048LinkGoogle Scholar
  • Eppen G. D., Martin R. K. Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper. Res. (1987) 35:832–848LinkGoogle Scholar
  • Federgruen A., Tzur M. A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n log n) or O(n) time. Management Sci. (1991) 37:909–925LinkGoogle Scholar
  • Federgruen A. Minimal forecast horizons and a new planning procedure for the general dynamic lot sizing model: Nervousness revisited. Oper. Res. (1994) 42:456–468LinkGoogle Scholar
  • Grinold R. C. Model building techniques for the correction of end effects in multistage convex programs. Oper. Res. (1983) 31:407–431LinkGoogle Scholar
  • Groff G. K. A lot sizing rule for time-phased component demand. Prod. Inventory Management (1979) 20:47–53Google Scholar
  • McClain J. O., Thomas J. Horizon effects in aggregate production planning with seasonal demand. Management Sci. (1977) 23:728–736LinkGoogle Scholar
  • Robrade A. D.Dynamische Einprodukt-Lagerhaltungsmodelle bei periodischer Bestandsüberwachung (1990) (Physica, Heidelberg Germany) Google Scholar
  • Russel R. A., Urban T. L. Horizon extensions for rolling production schedules: Length and accuracy requirements. Internat. J. Prod. Econom. (1993) 29:111–122CrossrefGoogle Scholar
  • Silver E. A., Meal H. A heuristic for selecting lot-size quantities for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment. Prod. Inventory Management (1973) 14:64–74Google Scholar
  • Stadtler H. Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing. OR Spektrum (1997) 19:87–96CrossrefGoogle Scholar
  • Tempelmeier H.Material-Logistik (1995) 3rd ed.(Springer, Berlin, Heidelberg, New York) CrossrefGoogle Scholar
  • Tempelmeier H., Helber S. A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures. European J. Oper. Res. (1994) 75:296–311CrossrefGoogle Scholar
  • Wagelmans A., Van Hoesel S., Kolen A. Economic lot sizing: An O(n log n)-algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. (1992) 40:S145–S156LinkGoogle Scholar
  • Wagner H. M., Whitin T. Dynamic version of the economic lot size model. Management Sci. (1958) 5:89–96LinkGoogle Scholar
  • Zoller K., Robrade A. Efficient heuristics for dynamic lot sizing. Internat. J. Prod. Res. (1988) 26:249–265CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.