Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 6754970, 18 pages
https://doi.org/10.1155/2017/6754970
Research Article

Alternative Mathematical Models and Solution Approaches for Lot-Sizing and Scheduling Problems in the Brewery Industry: Analyzing Two Different Situations

1Departamento de Engenharia de Produção, Universidade Federal de São Carlos, Via Washington Luiz, km. 235, 13565-905 São Carlos, SP, Brazil
2Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo, Av. Trabalhador São-Carlense 400, 13560-970 São Carlos, SP, Brazil
3INESC-TEC e Faculdade de Engenharia, Universidade do Porto, Rua Dr. Roberto Frias s/n, Porto 4200-465, Portugal

Correspondence should be addressed to Maristela O. Santos; rb.psu.cmci@iram

Received 24 January 2017; Accepted 7 June 2017; Published 10 August 2017

Academic Editor: Gen Q. Xu

Copyright © 2017 Tamara A. Baldo et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. 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,” Annals of Operations Research, vol. 150, pp. 177–192, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. T. Wu, L. Shi, and J. Song, “An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times,” Annals of Operations Research, vol. 196, pp. 635–650, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  3. B. Almada-Lobo, A. Clark, L. Guimarães, G. Figueira, and P. Amorim, “Industrial insights into lot sizing and schedulingmodeling,” Pesquisa Operacional, vol. 35, no. 3, pp. 439–464, 2015. View at Publisher · View at Google Scholar · View at Scopus
  4. K. Copil, M. Wörbelauer, H. Meyr, and H. Tempelmeier, “Simultaneous lotsizing and scheduling problems: a classification and review of models,” OR Spectrum, vol. 39, no. 1, pp. 1–64, 2017. View at Publisher · View at Google Scholar · View at MathSciNet
  5. B. Almada-Lobo, J. F. Oliveira, and M. A. Carravilla, “Production planning and scheduling in the glass container industry: a VNS approach,” International Journal of Production Economics, vol. 114, no. 1, pp. 363–375, 2008. View at Publisher · View at Google Scholar · View at Scopus
  6. A. R. Clark, R. Morabito, and E. A. V. Toso, “Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching,” Journal of Scheduling, vol. 13, no. 2, pp. 111–121, 2010. View at Publisher · View at Google Scholar · View at Scopus
  7. D. Ferreira, A. R. Clark, B. Almada-Lobo, and R. Morabito, “Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production,” International Journal of Production Economics, vol. 136, no. 2, pp. 255–265, 2012. View at Publisher · View at Google Scholar · View at Scopus
  8. L. Tiacci and S. Saetta, “Demand forecasting, lot sizing and scheduling on a rolling horizon basis,” International Journal of Production Economics, vol. 140, no. 2, pp. 803–814, 2012, Sixteenth international working seminar on production economics, Innsbruck, 2010. View at Publisher · View at Google Scholar · View at Scopus
  9. M. O. Santos and B. Almada-Lobo, “Integrated pulp and paper mill planning and scheduling,” Computers and Industrial Engineering, vol. 63, no. 1, pp. 1–12, 2012. View at Publisher · View at Google Scholar · View at Scopus
  10. C. Almeder, D. Klabjan, R. Traxler, and B. Almada-Lobo, “Lead time considerations for the multi-level capacitated lot-sizing problem,” European Journal of Operational Research, vol. 241, no. 3, pp. 727–738, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. H. Tempelmeier and K. Copil, “Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator,” OR Spectrum. Quantitative Approaches in Management, vol. 38, no. 4, pp. 819–847, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. S. Emde, “Scheduling the replenishment of just-in-time supermarkets in assembly plants,” OR Spectrum. Quantitative Approaches in Management, vol. 39, no. 1, pp. 321–345, 2017. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. H.-M. Cho and I.-J. Jeong, “A two-level method of production planning and scheduling for bi-objective reentrant hybrid flow shops,” Computers & Industrial Engineering, vol. 106, pp. 174–181, 2017. View at Google Scholar
  14. B. Fleischmann and H. Meyr, “The general lotsizing and scheduling problem,” OR Spektrum, vol. 19, no. 1, pp. 11–21, 1997. View at Publisher · View at Google Scholar · View at MathSciNet
  15. K. Haase, “Capacitated lot-sizing with sequence dependent setup costs,” OR Spektrum. Quantitative Approaches in Management, vol. 18, no. 1, pp. 51–59, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  16. G. D. Eppen and R. K. Martin, “Solving multi-item capacitated lot-sizing problems using variable redefinition,” Operations Research, vol. 35, no. 6, pp. 832–848, 1987. View at Publisher · View at Google Scholar · View at Scopus
  17. A. Johnson and C. Montgomery, Operations Research in Production Planning, Scheduling, And Inventory Control, John Wiley & Sons, New York, 1974.
  18. L. Guimarães, D. Klabjan, and B. Almada-Lobo, “Annual production budget in the beverage industry,” Engineering Applications of Artificial Intelligence, vol. 25, no. 2, pp. 229–241, 2012. View at Publisher · View at Google Scholar · View at Scopus
  19. T. A. Baldo, M. O. Santos, B. Almada-Lobo, and R. Morabito, “An optimization approach for the lot sizing and scheduling problem in the brewery industry,” Computers and Industrial Engineering, vol. 72, no. 1, pp. 58–71, 2014. View at Publisher · View at Google Scholar · View at Scopus
  20. K. Rosling, “Optimal Lot-Sizing for Dynamic Assembly Systems,” in Multi-Stage Production Planning and Inventory Control, S. Axsäter and C. Schneeweilj, Eds., vol. 266 of Lecture Notes in Economics and Mathematical Systems, pp. 119–131, Springer Berlin Heidelberg, Berlin, Heidelberg, 1986. View at Publisher · View at Google Scholar
  21. R. M. Karp, “A patching algorithm for the nonsymmetric traveling-salesman problem,” SIAM Journal on Computing, vol. 8, no. 4, pp. 561–573, 1979. View at Publisher · View at Google Scholar · View at MathSciNet
  22. C. E. Miller, A. W. Tucker, and R. A. Zemlin, “Integer programming formulation of traveling salesman problems,” Journal of the Association for Computing Machinery, vol. 7, pp. 326–329, 1960. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, 1999. View at MathSciNet
  24. E. D. Dolan and J. J. Moré, “Benchmarking optimization software with performance profiles,” Mathematical Programming, vol. 91, no. 2, pp. 201–213, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  25. G. B. Dantzig and P. Wolfe, “Decomposition principle for linear programs,” Operations Research, vol. 8, no. 1, pp. 101–111, 1960. View at Publisher · View at Google Scholar