An evaluation of semidefinite programming based approaches for discrete lot-sizing problems

European Journal of Operational Research

Volumn 237, Issue 2, 2014, Pages 498-507

  Gicquel, C ^a   Lisser, A ^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

Cutting planes; Discrete lot sizing and scheduling problem; Manufacturing; Quadratically constrained quadratic binary programming; Semidefinite relaxation; Sequence dependent changeover costs and times

Indexed keywords

MANUFACTURE; MATHEMATICAL MODELS; OPERATIONS RESEARCH;

CUTTING PLANES; LOT-SIZING AND SCHEDULING; QUADRATIC BINARY PROGRAMMING; SEMIDEFINITE RELAXATION; SEQUENCE-DEPENDENT CHANGEOVERS;

MATHEMATICAL PROGRAMMING;

EID: 84899465928     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.02.027     Document Type: Article

References (34)

1. M.F. Anjos, A. Kennings, and A. Vannelli A semidefinite optimization approach of the single-row layout problem with unequal dimensions Discrete Optimization 2 2005 113 122
2. G. Belvaux, and L.A. Wolsey Modelling practical lot-sizing problems as mixed-integer programs Management Science 47 7 2001 993 1007
3. S.J. Benson, Y. Ye, and X. Zhang Solving large-scale sparse semidefinite programs for combinatorial optimization SIAM Journal on Optimization 10 2 2000 443 461
4. L. Buschkühl, F. Sahling, S. Helber, and H. Tempelmeier Dynamic capacitated lot-sizing problems: Classification and review of solution approaches OR Spectrum 32 2010 231 261
5. S.G. Dastidar, and R. Nagi Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs Computers & Operations Research 32 2005 2987 3005
6. A. Engau Recent progress in interior-point methods: Cutting-plane methods and warm starts Handbook of semidefinite, conic and polynomial optimiztion International series in operations research and management science 2012 Springer 471 488
7. G.D. Eppen, and R.K. Martin Solving multi-item capacitated lot-sizing problems using variable redefinition Operations Research 35 6 1987 832 848
8. 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 International Journal of Production Economics 136 2012 255 265
9. B. Fleischmann The discrete lot sizing and scheduling problem European Journal of Operational Research 44 1990 337 348
10. C. Gicquel, M. Minoux, and Y. Dallery On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times Operations Research Letters 37 2009 32 36
11. C. Gicquel, M. Minoux, and Y. Dallery Exact solution approaches for the discrete lot-sizing and scheduling problem with identical parallel resources International Journal of Production Research 49 9 2011 2587 2603
12. M.X. Goemans, and D.P. Williamson Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming Journal of the ACM 42 6 1995 1115 1145
13. Helmberg, C. (2000). Semidefinite programming for combinatorial optimization. Habilitationsschrift, TU Berlin.
14. C. Helmberg Semidefinite programming European Journal of Operational Research 137 3 2002 461 482
15. C. Helmberg, and F. Rendl A spectral bundle method for semidefinite programming SIAM Journal of Optimization 10 3 2000 673 696
16. C. Helmberg, F. Rendl, and R. Weismantel A semidefinite programming approach to the quadratic knapsack problem Journal of Combinatorial Optimization 4 2 2000 197 215
17. R. Jans, and Z. Degraeve Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches European Journal of Operational Research 177 2007 1855 1875
18. R. Jans, and Z. Degraeve Modelling industrial lot sizing problems: A review Industrial Journal of Production Research 46 6 2008 1619 1643
19. Lemarechal, C.; Oustry, F. (1999). Semidefinite relaxations and lagrangian duality with application to combinatorial optimization. RR-3710. INRIA Rhones-Alpes, ZIRST-655 avenue de l'Europe, F-38330 Montbonnot Saint-Martin, June 1999.
20. B. Lovàsz, and A. Schrijver Cones of matrices and set-functions and 0-1 optimization SIAM Journal on Optimization 1 1991 166 190
21. S. Mhanna, and R. Jabr Application of semidefinite programming relaxation and selective pruning to the unit commitment problem Electric Power System Research 90 2012 85 92
22. Y. Pochet, and L.A. Wolsey Production planning by mixed integer programming 2006 Springer Science
23. S. Poljak, F. Rendl, and H. Wolkowicz A recipe for semidefinite relaxation of (0-1) quadratic programming Journal of Global Optimization 7 1995 51 73
24. J. Povh, and F. Rendl Copositive and semidefinite relaxations of the quadratic assignment problem Discrete Optimisation 6 2009 231 241
25. F. Rendl Semidefinite relaxations for partitioning, assignment and ordering problems 40R-Quaterly Journal of Operations Research 10 2012 321 346
26. F. Roupin From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems Journal of Combinatorial Optimization 8 2004 469 493
27. 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 European Journal of Operational Research 100 1997 494 513
28. H.D. Sherali, and W.P. Adams A hierarchy of relaxations between continuous and convex hull representations for zero-one programming problems SIAM Journal on Discrete Mathematics 3 3 1990 411 430
29. C. Silva, and J.M. Magalhaes Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry Computers & Industrial Engineering 50 2006 79 89
30. M. Skutella Convex quadratic and semidefinite programming relaxations in scheduling Journal of the ACM 48 2 2001 206 242
31. C.A. van Eijl, and C.P.M. van Hoesel On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs Operations Research Letters 20 1997 7 13
32. H.M. Wagner, and T.M. Whitin Dynamic version of the economic lot size model Management Science 5 1 1958 89 96
33. M. Yamashita, K. Fujisawa, M. Fukuda, K. Kobayashi, K. Nakata, and M. Nakata Latest developments in the SDPA family for solving large-scale SDPs Handbook on semidefinite, conic and polynomial optimization. International series in operations research and management science 2012 Springer 687 714
34. Q. Zhao, S.E. Kharisch, F. Rendl, and H. Wolkovicz Semidefinite programming relaxations for the quadratic assignment problem Journal of Combinatorial Optimization 2 1998 71 109