Multi-product valid inequalities for the discrete lot-sizing and scheduling problem

Computers and Operations Research

Volumn 54, Issue , 2015, Pages 12-20

  Gicquel, C ^a   Minoux, M ^b  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Discrete lot sizing problem; Mixed integer linear programming; Production planning; Valid inequalities

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; OPTIMIZATION; PLANNING; PRODUCTION CONTROL;

COMBINATORIAL OPTIMIZATION PROBLEMS; LOT SIZING PROBLEMS; LOT-SIZING AND SCHEDULING; MIXED INTEGER LINEAR PROGRAMMING; PRODUCTION PLANNING; SEPARATION ALGORITHMS; SEQUENCE-DEPENDENT CHANGEOVERS; VALID INEQUALITY;

SCHEDULING;

EID: 84907997374     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2014.08.022     Document Type: Article

References (19)

1. I. Barany, T.J. van Roy, and L.A. Wolsey Strong formulations for multi-item capacitated lot sizing Manag Sci 30 10 1984 1255 1261
2. G. Belvaux, and L.A. Wolsey Modelling practical lot-sizing problems as mixed-integer programs Manag Sci 47 7 2001 993 1007
3. L. Buschkühl, F. Sahling, S. Helber, and H. Tempelmeier Dynamic capacitated lot-sizing problems classification and review of solution approaches OR Spectr 32 2010 231 261
4. S.G. Dastidar, and R. Nagi Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs Comput Oper Res 32 2005 2987 3005
5. G.D. Eppen, and R. K Martin Solving multi-item capacitated lot-sizing problems using variable redefinition Oper Res 35 6 1987 832 848
6. D. Ferreira, A.R. Clark, B. Almada-Lobo, and R. Morabito Single-stage formulations for synchronized two-stage lot-sizing and scheduling in soft drink production Int J Prod Econ 136 2012 255 265
7. B. Fleischmann The discrete lot sizing and scheduling problem Eur J Oper Res 44 1990 337 348
8. C. Gicquel, M. Minoux, and Y. Dallery On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times Oper Res Lett 37 2009 32 36
9. C. Gicquel, M. Minoux, and Y. Dallery Exact solution approaches for the discrete lot-sizing and scheduling problem with identical parallel resources Int J Prod Res 49 9 2011 2587 2603
10. R. Jans, and Z. Degraeve Meta-heuristics for dynamic lot sizing a review and comparison of solution approaches Eur J Oper Res 177 2007 1855 1875
11. R. Jans, and Z. Degraeve Modelling industrial lot sizing problems a review Ind J Prod Res 46 6 2008 1619 1643
12. B.W. Kernighan, and S. Lin An efficient heuristic procedure for partitioning graphs Bell Syst Tech J 49 1970 291 307
13. J. Leung, T.L. Magnanti, and R. Vachani Facets and algorithms for capacitated lot sizing Math Program 45 1989 331 359
14. A.J. Miller, G.L. Nemhauser, and M.W.P. Savelsbergh On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra Eur J Oper Res 125 2000 298 315
15. Y. Pochet, and L.A. Wolsey Production planning by mixed integer programming 2006 Springer Science Berlin
16. M. Salomon, M. Solomon, L. van Wassenhove, Y. Dumas, and S. Dauzère-Pérès Solving the discrete lotsizing and scheduling problem with sequence dependant set-up costs and set-up times using the Travelling Salesman Problem with time windows Eur J Oper Res 100 1997 494 513
17. C. Silva, and J.M. Magalhaes Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry Comput Ind Eng 50 2006 79 89
18. C.A. van Eijl, and C.P.M. van Hoesel On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs Oper Res Lett 20 1997 7 13
19. H.M. Wagner, and T.M. Whitin Dynamic version of the economic lot size model Manag Sci 5 1 1958 89 96