Lot sizing with minimum order quantity

[1]  Alan S. Manne,et al.  Programming of Economic Lot Sizes , 1958 .

[2]  M. Florian,et al.  DETERMINISTIC PRODUCTION PLANNING WITH CONCAVE COSTS AND CAPACITY CONSTRAINTS. , 1971 .

[3]  Yves Pochet.  Valid inequalities and separation for capacitated economic lot sizing , 1988 .

[4]  E. Anderson,et al.  Capacitated lot-sizing with minimum batch sizes and setup times , 1993 .

[5]  Laurence A. Wolsey,et al.  Lot-Sizing with Constant Batches: Formulation and Valid Inequalities , 1993, Math. Oper. Res..

[6]  Laurence A. Wolsey,et al.  Polyhedra for lot-sizing with Wagner—Whitin costs , 1994, Math. Program..

[7]  Miguel Constantino,et al.  Lower Bounds in Lot-Sizing Models: A Polyhedral Study , 1998, Math. Oper. Res..

[8]  R. Dekker,et al.  Controlling inventories in a supply chain: A case study , 2002 .

[9]  Chung-Yee Lee,et al.  Inventory replenishment model: lot sizing versus just-in-time delivery , 2004, Oper. Res. Lett..

[10]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[11]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering) , 2006 .

[12]  Mathieu Van Vyve,et al.  Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity , 2006, Math. Program..

[13]  Laurence A. Wolsey,et al.  Multi-item lot-sizing with joint set-up costs , 2009, Math. Program..

[14]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming , 2010 .

[15]  Laurence A. Wolsey,et al.  Single item lot-sizing with non-decreasing capacities , 2007, Math. Program..

[16]  Knut Richter,et al.  An O(T3) algorithm for the capacitated lot sizing problem with minimum order quantities , 2011, Eur. J. Oper. Res..

[17]  Diego Klabjan,et al.  Single Item Lot-Sizing Problem with Minimum Order Quantity , 2011 .

[18]  Irena Okhrin,et al.  The linear dynamic lot size problem with minimum order quantity , 2011 .

[19]  Bernard Penz,et al.  A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs , 2012, Eur. J. Oper. Res..

[20]  Shabbir Ahmed,et al.  Semi-continuous network flow problems , 2014, Math. Program..