Skip to main content
Log in

An approach for solving the lot-sizing problem of a market-driven foundry

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

Foundries can be found all over Brazil and they are very important to its economy. In 2008, a mixed integer-programming model for small market-driven foundries was published, attempting to minimize delivery delays. We undertook a study of that model. Here, we present a new approach based on the decomposition of the problem into two sub-problems: production planning of alloys and production planning of items. Both sub-problems are solved using a Lagrangian heuristic based on transferences. An important aspect of the proposed heuristic is its ability to take into account a secondary practice objective solution: the furnace waste. Computational tests show that the approach proposed here is able to generate good quality solutions that outperform prior results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • ABIFA—Associação Brasileira de Fundição (2007). Relatório anual do setor de fundição, http://www.abifa.org.br (19/04/2007).

  • Araujo SA and Arenales MN (2003). Dimensionamento de lotes e programação de forno numa fundição automatizada de porte médio. Pesqui Opl 23: 403–420.

    Google Scholar 

  • Araujo SA, Arenales MN and Clark AR (2007). Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups. J Heuristics 13: 337–358.

    Article  Google Scholar 

  • Araujo SA, Arenales MN and Clark AR (2008). Lot-sizing and furnace scheduling in small foundries. Comput Opns Res 35: 916–932.

    Article  Google Scholar 

  • Duda J (2005). Lot-sizing in a foundry using genetic algorithm and repair functions. Lect Notes Comp Sci 3448: 101–111.

    Article  Google Scholar 

  • Duda J and Osyczka A (2005). Multiple criteria lot-sizing in a foundry using evolutionary algorithms. Lect Notes Comp Sci 3410: 651–663.

    Article  Google Scholar 

  • ILOG (2001). Ilog Cplex 7.5 User's Manual. ILOG: Gentilly, France. http://www.ilog.com .

  • Santos-Meza E, Santos MO and Arenales MN (2002). A lot-sizing problem in an automated foundry. Eur J Opl Res 139: 490–500.

    Article  Google Scholar 

  • Silva RJ and Morabito R (2004). Otimização da programação de cargas de forno em uma fábrica de fundição em aço-inox. Gestão Produção 11: 135–151.

    Article  Google Scholar 

  • Toledo FMB and Armentano VA (2006). A Lagrangean-based heuristic for the capacitated lot-sizing problem in parallel machines. Eur J Opl Res 175: 1070–1083.

    Article  Google Scholar 

  • Wagner HM and Whitin TM (1958). Dynamic version of the economic lot size model. Mngt Sci 5: 89–96.

    Article  Google Scholar 

  • Zangwill WI (1969). A backlogging model and a multi-echelon model of a dynamic economic lot size production system—A network approach. Mngt Sci 15: 506–527.

    Article  Google Scholar 

Download references

Acknowledgements

The authors thank the anonymous referees for their useful comments and suggestions. This research was partially funded by the Conselho Nacional de Desenvolvimento Cientifico e Tecnológico (CNPq) and Fundação de Amparo a Pesquisa do Estado de São Paulo (FAPESP).

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tonaki, V., Toledo, F. An approach for solving the lot-sizing problem of a market-driven foundry. J Oper Res Soc 61, 108–114 (2010). https://doi.org/10.1057/jors.2008.151

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.2008.151

Keywords

Navigation