Dynamic-programming-based inequalities for the capacitated lot-sizing problem

References

• Atamtürk , A. and Hochbaum , D. S. 2001 . Capacity acquisition, subcontracting, and lot sizing. . Management Science , 47 : 1081 – 1100 .
   Web of Science ®Google Scholar
• Atamtürk , A. and Muñoz , J. C. 2004 . A study of the lot-sizing polytope. . Mathematical Programming , 99 ( 3 ) : 443 – 465 .
   Web of Science ®Google Scholar
• Baker , K. R. , Dixon , P. , Magazine , M. J. and Silver , E. A. 1978 . An algorithm for the dynamic lot-size problem with time-varying production capacity constraints. . Management Science , 24 ( 16 ) : 1710 – 1720 .
   Google Scholar
• Barany , I. , Van Roy , T.J. and Wolsey , L. A. 1984 . Uncapacitated lot sizing: the convex hull of solutions. . Mathematical Programming Study , 22 : 32 – 43 .
   Web of Science ®Google Scholar
• Briskorn , D. 2006 . A note on capacitated lot sizing with setup carry over. . IIE Transactions , 38 ( 11 ) : 1045 – 1047 .
   Web of Science ®Google Scholar
• Chan , T. 1996 . Optimal output-sensitive convex hull algorithms in two and three dimensions. . Discrete & Computational Geometry , 16 : 361 – 368 .
   Web of Science ®Google Scholar
• Chen , H. D. , Hearn , D. W. and Lee , C. Y. 1994 . A new dynamic programming algorithm for the single item capacitated dynamic lot size model. . Journal of Global Optimization , 4 ( 3 ) : 285 – 300 .
   Web of Science ®Google Scholar
• Chung , C. S. , Flynn , J. and Lin , C. H.M. 1994 . An effective algorithm for the capacitated single item lot size problem. . European Journal of Operational Research , 75 ( 2 ) : 427 – 440 .
   Web of Science ®Google Scholar
• Constantino , M. 1996 . A cutting plane approach to capacitated lot-sizing with start-up costs. . Mathematical Programming , 75 : 353 – 376 .
   Web of Science ®Google Scholar
• Eppen , G. D. and Martin , R. K. 1987 . Solving multi-item capacitated lot sizing problems using variable redefinition. . Operations Research , 35 ( 6 ) : 832 – 848 .
   Web of Science ®Google Scholar
• Florian , M. and Klein , M. 1971 . Deterministic production planning with concave costs and capacity constraints. . Management Science , 18 ( 1 ) : 12 – 20 .
   Web of Science ®Google Scholar
• Florian , M. , Lenstra , J. K. and Rinnooy Kan , A.H.G. 1980 . Deterministic production planning: algorithms and complexity. . Management Science , 26 ( 7 ) : 669 – 679 .
   Web of Science ®Google Scholar
• Jans , R. and Degraeve , Z. 2004 . An industrial extension of the discrete lot-sizing and scheduling problem. . IIE Transactions , 36 ( 1 ) : 47 – 58 .
   Web of Science ®Google Scholar
• Karni , R. 1986 . A study of lot sizing algorithms. . IIE Transactions , 18 ( 4 ) : 356 – 366 .
   Web of Science ®Google Scholar
• Leung , J. M.Y. , Magnanti , T. L. and Vachani , R. 1989 . Facets and algorithms for capacitated lot sizing. . Mathematical Programming , 45 ( 2 ) : 331 – 359 .
   Web of Science ®Google Scholar
• Loparic , M. , Marchand , H. and Wolsey , L. A. 2003 . Dynamic knapsack sets and capacitated lot-sizing. . Mathematical Programming , 95 : 53 – 69 .
   Web of Science ®Google Scholar
• Martin , R. K. , Rardin , R. L. and Campbell , B. A. 1990 . Polyhedral characterization of discrete dynamic programming. . Operations Research , 38 ( 1 ) : 127 – 138 .
   Web of Science ®Google Scholar
• Miller , A. J. , Nemhauser , G. L. and Savelsbergh , M. W.P. 2000 . On the capacitated lot-sizing and continuous 0–1 knapsack polyhedra. . European Journal of Operational Research , 125 ( 2 ) : 298 – 315 .
   Web of Science ®Google Scholar
• Padberg , M. W. , Van Roy , T.J. and Wolsey , L. A. 1984 . Valid linear inequalities for fixed charge problems. . Operations Research , 32 ( 4 ) : 842 – 861 .
   Web of Science ®Google Scholar
• Pochet , Y. 1988 . Valid inequalities and separation for capacitated economic lot sizing. . Operations Research Letters , 7 ( 3 ) : 109 – 115 .
   Web of Science ®Google Scholar
• Pochet , Y. and Wolsey , L. A. 1993 . Lot-sizing with constant batches: formulation and valid inequalities. . Mathematics of Operations Research , 18 ( 4 ) : 767 – 785 .
   Web of Science ®Google Scholar
• Toy , A. O. and Berk , E. 2006 . Dynamic lot sizing problem for a warm/cold process. . IIE Transactions , 38 ( 11 ) : 1027 – 1044 .
   Web of Science ®Google Scholar
• Van Hoesel , C.P.M. and Wagelmans , A.P.M. 1996 . An O(T 3) algorithm for the economic lot-sizing problem with constant capacities. . Management Science , 42 ( 1 ) : 142 – 150 .
   Web of Science ®Google Scholar
• Van Hoesel , C.P.M. and Wagelmans , A.P.M. 2001 . Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. . Mathematics of Operations Research , 26 ( 2 ) : 339 – 357 .
   Web of Science ®Google Scholar
• Wagner , H. M. and Whitin , T.M. 1958 . Dynamic version of the economic lot size model. . Management Science , 5 : 89 – 96 .
   Web of Science ®Google Scholar