A polyhedral approach to a production planning problem

Annals of Operations Research

Volumn 96, Issue 1-4, 2000, Pages 75-95

  Constantino, Miguel ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

Cutting plane algorithm; Production planning; Valid inequalities

Indexed keywords

EID: 0034356736     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018963805173     Document Type: Article

References (24)

1. A. Aggarwal and J. Park, Improved algorithms for economic lot size problems, Operations Research 41 (1993) 549-571.
2. I. Barany, T.J. Van Roy and L.A. Wolsey, Strong formulations for multi-item capacitated lot sizing, Management Science 30 (1984) 1255-1261.
3. I. Barany, T.J. Van Roy and L.A. Wolsey, Uncapacitated lot sizing: the convex hull of solutions, Mathematical Programming Study 22 (1984) 32-43.
4. M. Constantino, A polyhedral approach to production planning models: start-up costs and times, upper and lower bounds on production, Ph.D. Dissertation, Université Catholique de Louvain, Belgium (1995).
5. M. Constantino, Valid inequalities for lot-sizing with start-up costs and times, upper and lower bounds on production, Working Paper, Centro de Investigação Operacional, University of Lisbon, Portugal (1996).
6. M. Constantino, A cutting plane approach to capacitated lot-sizing with start-up costs, Mathematical Programming 75 (1996) 353-376.
7. CPLEX Optimization, Inc., Using the CPLEX Callable Library and CPLEX Mixed Integer Library (Incline Village, NV, USA, 1994).
8. C.A. van Eijl, A polyhedral approach to the discrete lot-sizing and scheduling problem, Ph.D. Dissertation, Technische Universiteit Eindhoven, The Netherlands (1996).
9. A. Federgruen and M. Tzur, A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n log n) or O(n) time, Management Science 37 (1991) 909-925.
10. C.P.M. van Hoesel and A.W.J. Kolen, A Linear description of the discrete lot-sizing and scheduling problem, European Journal of Operational Research 75 (1994) 342-353.
11. C.P.M. van Hoesel, A.P.M. Wagelmans and L.A. Wolsey, Polyhedral characterization of the economic lot-sizing problem with start-up costs, SIAM Journal of Discrete Mathematics 7 (1994) 141-151.
12. J. Leung, T.M. Magnanti and R. Vachani, Facets and algorithms for capacitated lot-sizing, Mathematical Programming 45 (1989) 331-359.
13. T.M. Magnanti and R. Vachani, A strong cutting plane algorithm for production scheduling with changeover costs, Operations Research 38 (1990) 456-473.
14. G.L. Nemhauser and M.W.P. Savelsbergh, MINTO, a Mixed INTeger Optimizer, Operations Research Letters 15 (1994) 47-58.
15. M.W. Padberg and G. Rinaldi, A branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Review 33 (1991) 60-100.
16. Y. Pochet, Valid inequalities and separation for capacitated economic lot-sizing, Operations Research Letters 7 (1988) 109-116.
17. Y. Pochet and L.A. Wolsey, Lot-size models with backlogging: strong reformulation and cutting planes, Mathematical Programming 40 (1988) 317-335.
18. Y. Pochet and L.A. Wolsey, Solving multi-item lot-sizing problems using strong cutting planes, Management Science 37 (1991) 53-67.
19. Y. Pochet and L.A. Wolsey, Lot-sizing with constant batches: formulation and valid inequalities, Mathematics of Operations Research 18 (1993) 767-785.
20. Y. Pochet and L.A. Wolsey, Polyhedra for lot-sizing with Wagner-Whitin costs, Mathematical Programming 67 (1994) 297-323.
21. Y. Pochet and L.A. Wolsey, Algorithms and reformulations for lot sizing problems, in: Combinatorial Optimization, eds. W. Cook et al., DIMACS Series in Discrete Mathematics and Theoretical Computer Science 20 (1995) 245-293.
22. A.P.M. Wagelmans, C.P.M. van Hoesel and A.W.J. Kolen, Economic lot-sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case, Operations Research 40 (1992) 145-156.
23. H.M. Wagner and T.M. Whitin, Dynamic version of the economic lot size model, Management Science 5 (1958) 89-96.
24. L.A. Wolsey, Uncapacitated lot-sizing problems with start-up costs, Mathematics of Operations Research 18 (1989) 767-785.