Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines

Annals of Operations Research

Volumn 217, Issue 1, 2014, Pages 213-231

  Fiorotto, Diego Jacinto ^a   de Araujo, Silvio Alexandre ^a  

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

Author keywords

Lagrangian heuristic; Lot sizing; Parallel machines; Reformulations

Indexed keywords

EID: 84901988806     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-014-1570-1     Document Type: Article

References (37)

1. Alfieri, A., Brandimarte, P., & D'Orazio, S. (2002). LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm. International Journal of Production Research, 40, 441-458.
2. Belvaux, G., & Wolsey, L. A. (2000). Bc-prod: A specialized branch-and- cut system for lot-sizing problems. Management Science, 46, 993-1007.
3. Camerini, P. M., Fratta, L., & Maffioli, F. (1975). On improving relaxation methods by modified gradient techniques. Mathematical Programming Study, 3, 26-54.
4. Carreno, J. J. (1990). Economic lot scheduling for multiple products on parallel identical processors. Management Science, 36, 348-358.
5. Chen, W. H., & Thizy, J. M. (1990). Analysis of relaxation for the multi-item capacitated lot-sizing problem. Annals of Operations Research, 26, 29-72.
6. Degraeve, Z., & Jans, R. (2007). A new dantzig-wolfe reformulation and branch-and-price algorithm for the capacited lot-sizing problem with setup times. Operational Research, 55, 909-920.
7. De Matta, R., & Guignard, M. (1994). Dynamic production scheduling for a process industry. Operational Research, 42, 492-503.
8. De Matta, R., & Guignard, M. (1995). The performance of rolling production schedules in a process industry. IIE Transactions, 27, 564-573.
9. Denizel, M., & Süral, H. (2006). On alternative mixed integer programming formulations and LP based heuristics for lot-sizing with setup times. Journal of the Operational Research Society, 57, 389-399.
10. Denizel, M., Altekin, F. T., Süral, H., & Stadtler, H. (2008). Equivalence of the lp relaxation of two strong formulation for the capacitated lot-sizing problem with setup times. OR spectrum, 30, 773-785.
11. Diaby, M., Bahl, H., Karwan, M. H., & Ziont, S. (1992). Capacitated lot-sizing and scheduling by lagrangean relaxation. European Journal of Operational Research, 59, 444-458.
12. Eppen, G. B., & Martin, R. K. (1987). Solving multi-item capacitated lot-sizing problems using variable redefinition. Operations Research, 6, 832-848.
13. Fandel, G., & Stammen-Hegener, C. (2006). Simultaneous lot sizing and scheduling for multi-product multi-level production. International Journal of Production Economics, 104, 308-316.
14. Feyten, P., & Lietaert, F. (1983). Production planning for a packaging departament. Master's thesis, Division of Industrial Management, Katholiek Universiteit Leuven, Dutch.
15. Helber, S., & Sahling, F. (2010). A fix-and-optimize approach for the multi-level capacitated lot sizing problem. Journal Production Economics, 123, 247-256.
16. Jans, R. (2009). Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints. INFORMS Journal on Computing, 21, 123-136.
17. Jans, R., & Degraeve, Z. (2004a). Improved lower bounds for capacitated lot sizing problem with setup time. Operation Research Letters, 32, 185-195.
18. Jans, R., & Degraeve, Z. (2004b). An industrial extension of the discrete lot sizing and scheduling problem. IIE Transactions, 36, 47-58.
19. Kang, S., Malik, K., & Thomas, L. J. (1999). Lotsizing and scheduling on parallel machines with sequence-dependent setup costs. Management Science, 45, 273-289.
20. Krarup, J., & Bilde, O. (1977). Plant location, set covering and economic lot size: An O(mn)-algorithm for structured problems. In Numerische Methoden bei Optimierungsaufgaben, Bang 3: Optimierung bei Graphentheoritischen Ganzzahligen Problemen, pp. 155-186.
21. Lasdon, L. S., & Terjung, R. C. (1971). An efficient algorithm for multi-item scheduling. Operations Research, 19, 946-969.
22. Marinelli, F., Nenni, M. E., & Sforza, A. (2007). Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company. Annals of Operations Research, 150, 177-192.
23. Mergaux, L. P., & van Wassenhove, L. N. (1984). Production planning with capacity constraints, Master thesis, Division of Industrial Management, Katholieke Universiteit Leuven, Dutch.
24. Meyr, H. (2002). Simultaneous lotsizing and scheduling on parallel machines. European Journal of Operational Research, 139, 277-292.
25. Nemhauser, G. L., & Wolsey, L. A. (1988). Integer and combinatorial optmization. New York: Wiley.
26. Ozdamar, L., & Birbil, S. I. (1998). Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions. European Journal of Operational Research, 110, 525-547.
27. Pimentel, C. M. O., Alvelos, F. P., & Carvalho, J. M. V. (2010). Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem. Optimization Methods and Software, 25, 229-319.
28. Pochet, Y., & van Vyve, M. (2004). A generic heuristic for production planning problems. INFORMS Journal of Computing. 16, 316-327.
29. Salomon, M., Kroon, L. G., Kuik, R., & van Wassenhove, L. N. (1991). Some extensions of the discrete lot-sizing and scheduling problem. Management Science, 37, 801-812.
30. Stadtler, H. (2003). Multilevel lot sizing with set up times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Operations Research, 51, 487-502.
31. Sung, C. S. (1986). A single-product parallel-facilities production-planning model. International Journal of Systems Science, 17, 983-989.
32. Süral, H., Denizel, M., & van Wassenhove, L. N. (2009). Lagrangean relaxation based heuristic for lot sizing with setup times. European Journal of Operational Research, 195, 51-63.
33. Tempelmeier, H., & Buschkuhl, L. (2009). A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures. Or Spectrum, 31, 385-404.
34. Thizy, J. M., & Wassenhove, L. N. V. (1985). Lagrangean relaxation for the multi-item capacitated lot-sizing problem: A heuristic implementation. AIIE Transactions, 17, 64-74.
35. Toledo, F. M. B. (1998). Dimensionamento de Lotes em Máquinas Paralelas. Tese (Doutorado), Faculdade de Engenharia Elétrica e Computação, Universidade Estadual de Campinas, Campinas.
36. Toledo, F. M. B., & Armentano, V. A. (2006). A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines. European Journal of Operational Research, 175, 1070-1083.
37. Trigeiro, W. W., Thomas, J., & McClain, J. O. (1989). Capacitated lot sizing with setup times. Management Science, 35, 353-366.