Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants

Computers and Operations Research

Volumn 37, Issue 4, 2010, Pages 684-691

  Ferreira, Deisemara ^a   Morabito, Reinaldo ^a   Rangel, Socorro ^b  

^a FEDERAL UNIVERSITY OF SÃO CARLOS   (Brazil)

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

Author keywords

Mixed integer programming; Production lot scheduling models; Relax and fix heuristics; Soft drink industry

Indexed keywords

CAPACITY CONSTRAINTS; COMPUTATIONAL PERFORMANCE; LOT SIZING; LOT-SCHEDULING; MIXED INTEGER MODELS; MIXED INTEGER PROGRAMMING; ONE-MACHINE; OPTIMIZATION SOFTWARE; PROBLEM INSTANCES; PRODUCTION BOTTLENECKS; PRODUCTION LINE; PRODUCTION PLANNING; PRODUCTION PROCESS; RELAX AND FIX HEURISTICS; SCHEDULING DECISIONS; SEQUENCE-DEPENDENT SETUP TIME; SOFT DRINK INDUSTRY; SOFT DRINKS;

DYNAMIC PROGRAMMING; HEURISTIC METHODS; INTEGER PROGRAMMING; PLANNING; PROBLEM SOLVING; PRODUCTION CONTROL; PRODUCTION ENGINEERING; SCHEDULING;

BEVERAGES;

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

References (38)

1. ABIR, Dados de Mercado, Associação Brasileira das Indústrias de Refrigerantes e de Bebidas Não Alcoólicas. Available in: 〈http://www.abir.gov.br〉 (last visit in 20/05/2009).
2. AFREBRAS, Dados de Mercado, Associação dos Fabricantes de Refrigerantes do Brasil; Available in: 〈http://www.afrebras.org.br/associados.htm〉 (last visit in 24/03/2007).
3. Toledo CFM, Kimms A, França PM, Morabito R. A mathematical model for the synchronized and integrated two-level lot sizing and scheduling problem. Asia Pacific Journal of Operational Research, 2008, under review.
4. Ferreira D., Morabito R., and Rangel S. Solution approaches for the soft drink integrated production lot sizing and scheduling problem. European Journal of Operational Research 196 2 (2009) 697-706
5. Toso EAV, Morabito R, Clark AR. Lot-sizing and sequencing optimisation at an animal-feed plant. Computers and Industrial Engineering 2009, doi:10.1016/j.cie.2009.02.011.
6. Araujo S.A., Arenales M.N., and Clark A.R. Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups. Journal of Heuristics 13 (2007) 337-358
7. Araujo S.A., Arenales M.N., and Clark A.R. Lot sizing and furnace scheduling in small foundries. Computers & Operations Research 3 35 (2008) 916-932
8. Luche JR, Morabito R, Pureza V. Combining process selection and lot sizing models for the production scheduling of electrofused grains. Asia-Pacific Journal of Operational Research 2008, to appear.
9. Fleischmann B. The discrete lot-sizing and scheduling problem. European Journal of Operational Research 44 (1990) 337-348
10. Pinedo M. Scheduling-theory, algorithms and systems (1995), Prentice-Hall, London
11. Drexl A., and Kimms A. Lot sizing and scheduling-survey and extensions. European Journal of Operational Research 99 (1997) 221-235
12. França P.M., Armentano V.A., and Toledo F.M.B. A network flow model for capacitated lot sizing problem. Omega International Journal of Management Science 27 2 (1999) 275-284
13. Meyr H. Simultaneous lot sizing and scheduling by combining local search with dual reutilization. European Journal of Operational Research 120 (2000) 311-326
14. Karimi B., Ghomi S.M.T.F., and Wilson J.M. The capacitated lot-sizing problem: a review of models and algorithms. Omega International Journal of Management Science 31 5 (2003) 365-378
15. Toledo F.M.B., and Armentano V.A. A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines. European Journal of Operational Research 175 (2006) 1070-1083
16. Sadegheih A. Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance. Applied Mathematical Modeling 30 2 (2006) 147-154
17. Lee W.C., and Wu C.C. Multi-machine scheduling with deteriorating jobs and scheduled maintenance. Applied Mathematical Modelling 32 3 (2008) 362-373
18. Bitran G.R., and Yanasse H.H. Computational complexity of the lot size problem. Management Science 28 10 (1982) 1174-1186
19. Meyr H. Simultaneous lot sizing and scheduling on parallel production lines. European Journal of Operational Research 39 (2002) 277-292
20. Clark A.R. Hybrid heuristics for planning lot setups and sizes. Computers & Industrial Engineering 45 (2003) 545-562
21. Toledo C.F.M., França P.M., Morabito R., and Kimms A. Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem. International Journal of Production Research 47 11 (2009) 3097-3119
22. Ferreira D., Morabito R., and Rangel S. Um modelo de otimização inteira mista e heurísticas relax and fix para a programação da produção de fábricas de refrigerantes de pequeno porte. Produção 18 (2008) 76-88
23. Fleischmann B., and Meyr H. The general lot sizing and scheduling problem. OR Spectrum 19 (1997) 11-21
24. ILOG-ILOG CPLEX, Mathematical programming optimizers, version 10.0; 2006.
25. Dolan E.D., and Moré J.J. Benchmarking optimization software with performance profiles. Mathematical Programming A 91 (2002) 201-213
26. Wolsey L.A. Integer programming (1998), Wiley, London
27. Dillenberger C., Escudero L.F., and Wu Zhang A.W. On practical resource allocation for production planning and scheduling with period overlapping setups. European Journal of Operational Research 75 (1994) 275-286
28. Escudero L.F., and Salmeron J. On a fix-and-relax framework for a class of project scheduling problems. Annals of Operations Research 140 (2005) 163-188
29. Beraldi P., Ghiani G., Grieco A., and Guerriero E. Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs. Computers & Operations Research 35 (2008) 3644-3656
30. Toledo CFM. Problema conjunto de dimensionamento de lotes e programação da produção. PhD thesis, Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e Computação, Brazil; 2005.
31. Pedroso J.P., and Kubo M. Hybrid tabu search for lot sizing problems. In: Balsa M., Blum C., Roil A., and Samples M. (Eds). Lecture Notes in Computer Science vol. 3636 (2005), Springer, Berlin/Heidelberg 66-77
32. Federgruen A., Meissner J., and Tzur M. Progressive interval heuristics for multi-item capacitated lot-sizing problems. Operations Research 55 3 (2007) 490-502
33. Danna E., Rothberg E., and Le Pape C. Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming A 102 (2005) 71-90
34. Fischetti M., and Lodi A. Local branching. Mathematical Programming B 98 (2003) 23-47
35. Ferreira D. Abordagens para o problema integrado de dimensionamento e sequenciamento de lotes da produção de bebidas. PhD dissertation, Production Engineering Department, Federal University of Sao Carlos; 2006.
36. Fourer R., Gay M.D., and Kernighan B.W. AMPL-a modeling language for mathematical programming (1993), The Scientific Press, Danvers Massachusetts
37. Hansen P., Mladenovic N., and Urosevic D. Variable neighborhood search and local branching. Computers & Operations Research 33 (2006) 3034-3045
38. Clark AR, Toso EAV, Morabito R. Multi-period Production Setup-sequencing and Lot-sizing through ATSP Subtour Elimination and Patching. Proceedings of the 25th Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG 2006), December 14-15, 2006, University of Nottingham, p. 80-87, ISSN 1368-5708, submitted for publication.