Hybrid methods for lot sizing on parallel machines

Computers and Operations Research

Volumn 63, Issue , 2015, Pages 136-148

  Fiorotto, Diego Jacinto ^a   De Araujo, Silvio Alexandre ^a   Jans, Raf ^b  

^a SÃO PAULO STATE UNIVERSITY UNESP   (Brazil)

^b HEC MONTRÉAL   (Canada)

Author keywords

Dantzig Wolfe decomposition; Hybrid methods; Lagrangian relaxation; Lot sizing; Parallel machines; Reformulation

Indexed keywords

LAGRANGE MULTIPLIERS;

DANTZIG-WOLFE DECOMPOSITION; HYBRID METHOD; LAGRANGIAN RELAXATION; LOT SIZING; PARALLEL MACHINE; REFORMULATION;

PROBLEM SOLVING;

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

References (46)

1. A. Andriolo, D. Battini, A. Persona, D. Sgarbossa, and R.W Grubbström A century of evolution from Harris basic lot size model survey and research agenda Int J Prod Econ 155 2014 16 38
2. de Araujo SA, De Reyck B, Degraeve Z, Fragkos I, Jans R. Period decompositions for the capacity constrained lot size problem with setup times. INFORMS J Comput 2015, In press, 10.1287/ijoc.2014.0636.
3. H.C. Bahl Column generation based heuristic algorithm for multi-item scheduling IIE Trans 15 1983 136 141
4. C.E.L. Barnhart, G.L. Johnson, M.W.P. Nemhauser, and P.H. Vance Branch-and-price column generation for solving huge integer programs Oper Res 46 1998 316 329
5. G. Belvaux, and L.A. Wolsey Bc-prod a specialized branch-and-cut system for lot-sizing problems Manag Sci 46 2000 993 1007
6. H. ben Amor, J. Desrosiers, and J.M. Valrio de Carvalho Dual-optimal inequalities for stabilized column generation Oper Res 54 2007 454 463
7. G.R. Bitran, and H. Matsuo The multi-item capacitated lot size problem: error bounds of Mannes formulations Manag Sci 32 1986 350 359
8. R.E. Bixby, J.W. Gregory, I.J. Lustin, R.E. Marsten, and D.F. Shanno Very large-scale linear programming a case study in combining interior point and simplex methods Oper Res 40 1992 885 897
9. P.M. Camerini, L. Fratta, and F. Maffioli On improving relaxation methods by modified gradient techniques Math Program Study 3 1975 26 54
10. J.J. Carreno Economic lot scheduling for multiple products on parallel identical processors Manag Sci 36 1990 348 358
11. D. Cattrysse, J. Maes, and L.N. van Wassenhove Set partitioning and column generation heuristics for capacitated dynamic lotsizing Eur J Oper Res 46 1990 38 47
12. D.G. Cattrysse, M. Salomon, R. Kuik, and V.L.N. Wassenhove A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times Manag Sci 39 1993 447 486
13. G.B. Dantzig, and P. Wolfe Decomposition principles for linear programming Oper Res 8 1960 101 111
14. Z. Degraeve, and R. Jans A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times Oper Res 55 2007 909 920
15. R. de Matta, and M. Guignard Dynamic production scheduling for a process industry Oper Res 42 1994 492 503
16. R. de Matta, and M. Guignard The performance of rolling production schedules in a process industry IIE Trans 27 1995 564 573
17. B.P. Dzielinski, and R.E. Gomory Optimal programming of lot sizes inventory and labor allocations Manag Sci 11 1965 874 890
18. G.B. Eppen, and R.K. Martin Solving multi-item capacitated lot-sizing problems using variable redefinition Oper Res 6 1987 832 848
19. G. Fandel, and C. Stammen-Hegener Simultaneous lot sizing and scheduling for multi-product multi-level production Int J Prod Econ 104 2006 308 316
20. D.J. Fiorotto, and S.A. de Araujo Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines Ann Oper Res 217 2014 213 231
21. J. Gondzio, P.G. Brevis, and P. Munari New developments in the primal dual column generation technique Eur J Oper Res 224 2013 41 51
22. Haase K. Solving large-scale capacitated lot-sizing problems close to optimality. Working paper. Technische Universitt Dresden; 2005.
23. S. Helber, and F. Sahling A fix-and-optimize approach for the multi-level capacitated lot sizing problem J Prod Econ 123 2010 247 256
24. K.S. Hindi Computationally efficient solution of the multi-item, capacitated lot-sizing problem Comput Ind Eng 28 1995 709 719
25. K.S. Hindi Solving the CLSP by a tabu search heuristic Eur J Oper Res 47 1996 151 161
26. D. Huisman, R. Jans, M. Peeters, and A.P.M. Wagelmans Combining column generation and Lagrangian relexation G. Desaulniers, J. Desrosiers, M. Solomon, Column generation 2005 Springer New York 247 270
27. R. Jans Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints INFORMS J Comput 21 2009 123 136
28. R. Jans, and Z. Degraeve Improved lower bounds for capacitated lot sizing problem with setup time Oper Res Lett 32 2004 185 195
29. R. Jans, and Z. Degraeve An industrial extension of the discrete lot sizing and scheduling problem IIE Trans 36 2004 47 58
30. S. Kang, K. Malik, and L.J. Thomas Lotsizing and scheduling on parallel machines with sequence-dependent setup costs Manag Sci 45 1999 273 289
31. M. Lambrecht, and H. Vanderveken Heuristic procedures for the single operation, multi-item loading problem AIIE Trans 11 1979 319 326
32. L.S. Lasdon, and R.C. Terjung An efficient algorithm for multi-item scheduling Oper Res 19 1971 946 969
33. A.S. Manne Programming of economic lot sizes Manag Sci 4 1958 115 135
34. F. Marinelli, M.E. Nenni, and A. Sforza Capacitated lot sizing and scheduling with parallel machines and shared buffers: a case study in a packaging company Ann Oper Res 150 2007 177 192
35. Mergaux LP, van Wassenhove LN, Production planning with capacity constraints [Master thesis]. Dutch: Division of Industrial Management, Katholieke Universiteit Leuven; 1984.
36. H. Meyr Simultaneous lotsizing and scheduling on parallel machines Eur J Oper Res 139 2002 277 292
37. H. Meyr, and M. Mann A decomposition approach for the general lotszing and scheduling problem for parallel production lines Eur J Oper Res 229 2013 718 731
38. L. Ozdamar, and S.I. Birbil Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions Eur J Oper Res 110 1998 525 547
39. C.M.O. Pimentel, F.P. Alvelos, and J.M.V. Carvalho Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem Optim Methods Softw 25 2010 229 319
40. M. Salomon, L.G. Kroon, R. Kuik, and L.N. van Wassenhove Some extensions of the discrete lot-sizing and scheduling problem Manag Sci 37 1991 801 812
41. M. Salomon, R. Kuik, and L.N. van Wassenhove Statistical search methods for lotsizing problems Oper Res 41 1993 453 468
42. H. Stadtler Multilevel lot sizing with set up times and multiple constrained resources internally rolling schedules with lot-sizing windows Oper Res 51 2003 487 502
43. H. Tempelmeier, and L. Buschkuhl A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures OR Spectr 31 2009 385 404
44. F.M.B. Toledo, V.A. Armentano, and A. Lagrangian-Based Heuristic for the Capacitated Lot-Sizing Problem in Parallel Machines Eur J Oper Res 175 2006 1070 1083
45. W.W. Trigeiro, J. Thomas, and J.O. McClain Capacitated lot sizing with setup times Manag Sci 35 1989 353 366
46. H.M. Wagner, and T.M. Whitin Dynamic version of the economic lotsize model Manag Sci 5 1958 89 96