Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows

References

• Afentakis P. A parallel heuristic algorithm for lot-sizing in multistage production systems. IIE Trans (1987) 19:34–42Crossref, Google Scholar
• Billington P., McClain J., Thomas L. Mathematical programming approaches to capacity-constrained MRP systems: Review formulation and problem reduction. Management Sci (1983) 32:989–1006Link, Google Scholar
• De Matta R., Guignard M. The performance of rolling production schedules in a process industry. IIE Trans (1995) 27:564–573Crossref, Google Scholar
• Dillenberger C., Escudero L. F., Wollensack A., Zhang W. On practical resource allocation for production planning and scheduling with period overlapping setups. Eur. J. Oper. Res. (1994) 75:275–286Crossref, Google Scholar
• Drexl A., Kimms A. Lot sizing and scheduling—Review and extensions. Eur. J. Oper. Res. (1997) 99:221–235Crossref, Google Scholar
• Eppen G. D., Martin R. K. Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper. Res. (1987) 35:832–848Link, Google Scholar
• Fleischmann B. The discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. (1990) 44:337–348Crossref, Google Scholar
• Harrison T., Lewis H. Lot sizing in serial assembly systems with multiple constrained resources. Management Sci (1996) 42:19–36Link, Google Scholar
• Heinrich D. E., Schneeweiss C., Axsäter S., Schneeweiss D., Silver E. A. Multi-stage lot-sizing for general production systems. Multi-Stage Productions Planning and Inventory Control (1986) (Springer, Berlin, Germany) 150–181Crossref, Google Scholar
• Katok E., Lewis H. S., Harrison T. P. Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources. Management Sci (1998) 44:859–877Link, Google Scholar
• Krarup J., Bilde O., Collatz L. Plant location set covering and economic lot sizing: An O(nm) algorithm for structured problems. Numerische Methoden bei Optimierungsaufgaben, Band 3, Optimierung bei graphentheoretischen und ganzzahligen Problemen (1977) (Birkhäuser, Basel, Switzerland) 155–180Crossref, Google Scholar
• Lambrecht M., Eecken J. V., Vanderveken H. A comparative study of lot sizing procedures for multi-stage assembly systems. OR Spektrum (1983) 5:33–43Crossref, Google Scholar
• Maes J., McClain J., Van Wassenhove L. Multilevel capacitated lotsizing complexity and LP-based heuristics. Eur. J. Oper. Res. (1991) 53:131–148Crossref, Google Scholar
• McKnew M. A., Saddam C. A., Coleman B. J. An efficient zero-one formulation of the multi-level lot-sizing problem. Decision Sci (1991) 22:280–295Crossref, Google Scholar
• Pochet Y., Wolsey L. A. Solving multi-item lot-sizing problems using strong cutting planes. Management Sci (1991) 37:53–67Link, Google Scholar
• Rosling K., Axsäter S., Schneeweiss D., Silver E. A. Optimal lot-sizing for dynamic assembly systems. Multi-Stage Productions Planning and Inventory Control (1986) (Springer, Berlin, Germany) 119–131Crossref, Google Scholar
• Salomon M.Deterministic Lotsizing Models for Production Planning (1991) (Springer, Berlin, Germany) Crossref, Google 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. Production Inventory Management (1973) 14:64–74Google Scholar
• Simpson N., Erenguc S. Improved heuristic methods for multiple stage production planning. Comput. Oper. Res. (1998a) 25:611–623Crossref, Google Scholar
• Simpson N., Erenguc S. Production planning in multiple stage manufacturing environments with joint costs, limited resources and set-up times. (1998b) . Technical report, University of Florida, Gainesville, FLGoogle Scholar
• Stadtler H. Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing. OR Spektrum (1997) 19:87–96Crossref, Google Scholar
• Stadtler H. Improved rolling schedules for the dynamic single-level lot-sizing problem. Management Sci (2000) 46:318–326Link, Google Scholar
• Tebboth J., Daniel R. A tightly integrated modelling and optimisation library: A new framework for rapid algorithmic development. Ann. Oper. Res. (1998) 7:1–21Google Scholar
• Tempelmeier H., Derstroff M. A Lagrangean heuristic for mult-item multi-level capacitated lotsizing with setup times. Management Sci (1996) 42:738–757Link, Google Scholar
• Tempelmeier H., Helber S. A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures. Eur. J. Oper. Res. (1994) 75:296–311Crossref, Google Scholar
• Trigiero W. A dual-cost heuristic for the capacitated lot sizing problem. IIE Trans (1987) 19:67–72Crossref, Google Scholar
• Vickery S. K., Markland R. E. Integer goal programming for multistage lot sizing: Experimentation and implementation. J. Oper. Management (1985) 5(2):169–182Crossref, Google Scholar
• Wagner H. M., Whitin T. M. Dynamic version of the economic lot size model. Management Sci (1958) 5:89–96Link, Google Scholar
• Wolsey L. A.Integer Programming (1998) (John Wiley, New York) Google Scholar