Formulations for dynamic lot sizing with service levels

Naval Research Logistics

Volumn 60, Issue 2, 2013, Pages 87-101

  Gade, Dinakar ^a   Küçükyavuz, Simge ^a  

^a The Ohio State University   (United States)

Author keywords

extended formulation; Fixed charge networks; lot sizing; service levels; shortest paths

Indexed keywords

GRAPH THEORY;

EXTENDED FORMULATIONS; FIXED-CHARGE NETWORKS; LOT SIZING; SERVICE LEVELS; SHORTEST PATH;

INTEGER PROGRAMMING;

EID: 84873729375     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.21519     Document Type: Article

References (19)

1. Bárány, I., Edmonds, J., Wolsey, L.A., Packing and covering a tree by subtrees Combinatorica 6 1986 221-233
2. Birge, J.R., Louveaux, F., Introduction to stochastic programming, Springer Verlag New York 1997
3. Eppen, G.D., Martin, R.K., Solving multi-item capacitated lot-sizing problems with variable definition Oper Res 35 1987 832-848
4. Gade, D., Küçükyavuz, S., A note on Lot-sizing with fixed charges on stocks: the convex hull Discrete Optim 8 2011 385-392
5. Helber, S., Sahling, F., Schimmelpfeng, K., Dynamic capacitated lot sizing with random demand and dynamic safety stock http://www3.wiwi.uni- hannover.de/Forschung/ Diskussionspapiere/dp-465.pdf (Accessed November 16, 2012)
6. Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R. E., Danna, E., Gamrath, G., Gleixner, A. M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D. E., Wolter, K., MIPLIB 2010 Math Program Comput 3 2011 103-163
7. Krarup, K., Bilde, O., Plant location, set covering and economic lot-sizes: An O(mn) algorithm for structured problems in Optimierung bei Graphentheoretischen und Ganzzahligen Probleme, Collatz, L., Birkhauser Verlag Bassel 1977
8. Küçükyavuz, S., Pochet, Y., Uncapacitated lot sizing with backlogging: The convex hull Math Program 118 2009 151-175
9. Miller, A.J., Wolsey, L.A., Tight MIP formulations for multi-item discrete lot-sizing problems Oper Res 51 2003 557-565
10. Nahmias, S., Production and operations analysis 5th ed. McGraw-Hill/Irwin New York, NY 2004
11. Pochet, Y., Wolsey, L.A., Lot-size models with backlogging: Strong reformulations and cutting planes Math Program 40 1988 317-335
12. Pochet, Y., Wolsey, L.A., Production planning by mixed integer programming Springer Verlag New York 2006
13. Rardin, R.L., Wolsey, L.A., Valid inequalities and projecting the multicommodity extendedformulation for uncapacitated fixed charge network flow problems Eur J Oper Res 71 1993 95-109
14. Tempelmeier, H., A column generation heuristic for dynamic capacitated lotsizing with random demand under a fill rate constraint Omega 39 2011 627-633
15. Van Vyve, M., Ortega, F., Lot-sizing with fixed charges on stocks: The convex hull Discrete Optimization 1 2004 189-203
16. Wagner, H.M., Whitin, T.M., Dynamic Version of the Economic Lot Size Problem Manage Sci 5 1958 89-96
17. Wolsey, L.A., Solving multi-item lot-sizing problems with an MIP solverusing classification and reformulation Manage Sci 48 2002 1587-1602
18. Zangwill, W.I., A deterministic multi-period production scheduling model with backlogging Manage Sci 13 1966 105-119
19. Zangwill, W.I., A backlogging model and a multi-echelon model of a dynamiceconomic lot size production system - A∼network approach Manage Sci 15 1969 506-527