Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems

References

• Aggarwal A., Park J. Improved algorithms for economic lot size problems. Oper. Res. (1993) 41:549–571Link, Google Scholar
• Ahuja R., Hochbaum D. Solving linear cost dynamic lot sizing problems in O(n log n) time. Oper. Res. (2004) . ForthcomingGoogle Scholar
• Anily S., Tzur M. Shipping multiple-items by capacitated vehicles—An optimal dynamic programming approach. Transportation Sci. (2005) 39(2):233–248Link, Google Scholar
• Anily S., Tzur M. Algorithms for the multi-item, multi-vehicles capacitated dynamic lot sizing problem. Naval Res. Logist. (2006) 53(2):157–169Crossref, Google Scholar
• Baker K., Dixon P. An algorithm for the dynamic lot size problem with time-varying production capacity constraints. Management Sci. (1978) 24:710–720Link, Google Scholar
• Barany I., Van Roy T., Wolsey L. Strong formulations for multi-item capacitated lot-sizing. Management Sci. (1984a) 30:1255–1261Link, Google Scholar
• Barany I., Van Roy T., Wolsey L. Uncapacitated lot-sizing: The convex hull of solutions. Math. Programming Stud. (1984b) 22:32–43Crossref, Google Scholar
• Belvaux G., Wolsey L.bc-prod—A specialized branch-and-cut system for lot-sizing problems (2000) 46:724–738Google Scholar
• Belvaux G., Wolsey L. Modelling practical lot-sizing problems as mixed-integer programs. Management Sci. (2001) 47:993–1007Link, Google Scholar
• Bitran G., Yanasse H. Computational complexity of the capacitated lot size problem. Management Sci. (1982) 28:1174–1186Link, Google Scholar
• Bixby R. MIP: A progress report. Talk at 1st Columbia Optimization Day. (2001) (Columbia University, New York) Google Scholar
• Chen H., Hearn D., Lee C. A new dynamic programming method for the single capacitated dynamic lot size model. J. Global Optim. (1994) 4:285–300Crossref, Google Scholar
• Chung C., Lin M. An O(T2) algorithm for the NI/G/NI/ND capacitated single item lot size problem. Management Sci. (1988) 34:420–426Link, Google Scholar
• Dixon P., Silver E. A heuristic solution for the multi-item, single level, limited capacity lot sizing problem. J. Oper. Management (1981) 2:23–39Crossref, Google Scholar
• Dogramaci A., Panayiotopoulos J., Adam N. The dynamic lotsizing problem for multiple items under limited capacity. IEE Trans. (1981) 13:294–303Google Scholar
• Eisenhut P. A dynamic lotsizing algorithm with capacity constraints. Trans. Amer. Inst. Electr. Engrgs. (1975) 7:170–176Google Scholar
• Eppen G., Martin R. Solving multi-item capacitated lot sizing problems using variable redefinitions. Oper. Res. (1987) 35:832–848Link, Google 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–925Link, Google Scholar
• Federgruen A., Tzur M. Minimal forecast horizons and a new planning procedure for the general dynamic lot sizing model: Nervousness revisited. Oper. Res. (1994a) 42:456–469Link, Google Scholar
• Federgruen A., Tzur M. Capacitated lot-sizing models. (1994b) . Working paper, Graduate School of Business, Columbia University, New YorkGoogle Scholar
• Federgruen A., Tzur M. The joint replenishment problem with time-varying parameters: Efficient, optimal and ϵ-optimal solutions. Oper. Res. (1994c) 42:1067–1087Link, Google Scholar
• Federgruen A., Tzur M. Time-partitioning heuristics: Application to one-warehouse, multiitem, multiretailer lot-sizing problems. Naval Res. Logist. (1999) 46:463–486Crossref, Google Scholar
• Florian M., Klein M. Deterministic production planning with concave costs and capacity constraints. Management Sci. (1971) 18:12–20Link, Google Scholar
• Florian M., Lenstra J., Rinnooy Kan A. Deterministic production planning: Algorithms and complexity. Management Sci. (1980) 26:669–679Link, Google Scholar
• Gavish B., Johnson R. A fully polynomial approximation scheme for single-product scheduling in a finite capacity facility. Oper. Res. (1990) 38:70–83Link, Google Scholar
• Graves S. Using Lagrangean techniques to solve hierarchical production planning problems. Management Sci. (1982) 28:260–275Link, Google Scholar
• Karni R., Roll Y. A heuristic algorithm for the multi-item lotsizing problem with capacity constraints. Amer. Inst. Indust. Engrgs. Trans. (1982) 13:249–256Google Scholar
• Kuik R., Solomon M., van Wassenhove L. Batching decisions: Structures and models. Eur. J. Oper. Res. (1994) 18:213–263Google Scholar
• Lambrecht M., Vander Eecken J. A capacity constrained single-facility dynamic lot-size model. Eur. J. Oper. Res. (1978) 2:132–136Crossref, Google Scholar
• Leung J., Magnanti T., Vachani R. Facets and algorithms for capacitated lot sizing. Math. Programming (1989) 45:331–359Crossref, Google Scholar
• Maes J., van Wassenhove L. Multi item single level capacitated dynamic lotsizing heuristics: A computational comparison (Part I: Static case; Part II: Rolling horizon). IIE Trans. (1986) 18:114–129Crossref, Google Scholar
• Maes J., van Wassenhove L. Multi-item single-level capacitated dynamic lot-sizing heuristics: A general review. J. Oper. Res. Soc. (1988) 39:991–1004Crossref, Google Scholar
• Martin R. Generating alternative mixed-integer programming models using variable redefinitions. Oper. Res. (1987) 35:820–831Link, Google Scholar
• MEMIPS Model enhanced solution methods for integer programming software. (1997) . Esprit Project 20118, Public report reference DR1.1.10Google Scholar
• Nahmias S.Production and Operations Analysis (1989) (Homewood, Boston, MA) Google Scholar
• PAMIPS Development of parallel algorithms and software for mixed-integer programming in industrial scheduling. (1995) . Esprit Project 8755, Public report reference DR4.3.5Google Scholar
• Pochet Y. Valid inequalities and separation for capacitated economic lot sizing. Oper. Res. Lett. (1988) 7:109–116Crossref, Google Scholar
• Salomon M. Deterministic lotsizing models for production planning. (1990) . Ph.D. dissertation, Erasmus University, Rotterdam, The NetherlandsGoogle Scholar
• Shaw D., Wagelmans A. An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs. Management Sci. (1998) 44:831–838Link, Google Scholar
• Stadtler H. Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Oper. Res. (2003) 51:487–502Link, Google Scholar
• Suerie C., Stadtler H. The capacitated lot-sizing problem with linked lot sizes. Management Sci. (2003) 49:1039–1054Link, Google Scholar
• Trigeiro W., Thomas L., McClain J. Capacitated lot sizing with setup times. Management Sci. (1989) 35:353–366Link, Google Scholar
• Van Hoesel C., Wagelmans A. An O(T3) algorithm for the economic lot-sizing problem with constant capacities. Management Sci. (1996) 42:142–150Link, Google Scholar
• Van Hoesel C., Wagelmans A. Fully polynomial approximation schemes for single-item capacitated lot-sizing problems. Math. Oper. Res. (2001) 26:339–357Link, Google Scholar
• Van Nunen J., Wessels J. Multi item lot size determination and scheduling under capacity constraints. Eur. J. Oper. Res. (1978) 2:36–41Crossref, Google Scholar
• Van Roy T., Wolsey L. Solving mixed integer programming problems using automatic reformulation. Oper. Res. (1987) 35:45–48Link, Google Scholar
• Wagelmans A., van Hoesel C., 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:145–156Link, Google Scholar