RAIRO-Oper. Res.
Volume 53, Number 5, November-December 2019
Operations Research Applications in Industry
Page(s) 1551 - 1561
Published online 08 October 2019
  • S.A. Araujo and M.N. Arenales, Dimensionamento de lotes e programação do forno numa fundição automatizada de porte médio. Pesquisa Oper. 23 (2003) 403–420. [CrossRef] [Google Scholar]
  • S.A. Araujo, M.N. Arenales and A.R. Clark, Lot-sizing and furnace scheduling in small foundries. Comput. Oper. Res. 35 (2008) 916–932. [Google Scholar]
  • V.C.B. Camargo, Um algoritmo evolutivo para o problema de dimensionamento de lotes em fundições de mercado. Master’s thesis, Instituto de Ciências Matemáticas e de Computação – USP (2009). [Google Scholar]
  • V.C.B. Camargo, L. Mattiolli and F.M.B. Toledo, A knapsack problem as a tool to solve the production planning problem in small foundries. Comput. Oper. Res. 39 (2012) 86–92. [Google Scholar]
  • Z.L. Chen, Integrated production and outbound distribution scheduling: review and extensions. Oper. Res. 58 (2010) 130–148. [Google Scholar]
  • J. Duda, Lot-sizing in a foundry using genetic algorithm and repair functions. In: EvoCOP. Lecture Notes in Computer Science. Springer 2005 101–111. [CrossRef] [Google Scholar]
  • J. Duda and A. Osyczka, Multiple criteria lot-sizing in a foundry using evolutionary algorithms. In: Evolutionary Multi-Criterion Optimization. Lecture Notes in Computer Science. Springer Berlin/Heidelberg (2005) 651–663. [CrossRef] [Google Scholar]
  • J. Duda and A. Stawowy, Optimization methods for lot-sizing problem in an automated foundry. Arch. Metall. Mater. 58 (2013) 863–866. [CrossRef] [Google Scholar]
  • A. Federgruen, J. Meissner and M. Tzur, Progressive interval heuristics for multi-item capacitated lot sizing problem. Oper. Res. 55 (2007) 490–502. [Google Scholar]
  • D. Ferreira, R. Morabito and S. Rangel, Solution approaches for the soft drink integrated production lot sizing and scheduling problem. Eur. J. Oper. Res. 196 (2009) 697–706. [Google Scholar]
  • C. Mercé and G. Fontan, MIP-based heuristics for capacitated lotsizing problems. Int. J. Prod. Econ. 85 (2003) 97–111. [Google Scholar]
  • E. Santos-Meza, M.O. Santos and M.N. Arenales, A lot-sizing problem in an automated foundry. Eur. J. Oper. Res 139 (2002) 490–500. [Google Scholar]
  • H. Stadtler, Multilevel lot sizing with setup times and multiple constrained resources: internally rolling schedules with lot-sizing windows. Oper. Res. 51 (2003) 487–502. [Google Scholar]
  • A. Stawowy and J. Duda, Models and Algorithms for production planning and scheduling in foundries – current state and development perspectives. Arch. Foundry Eng. 12 (2012) 69–74. [CrossRef] [Google Scholar]
  • K.E. Stecke and X. Zhao, Production and transportation integration for a make-to-order manufacturing company with a commit-to-delivery business mode. Manuf. Ser. Oper. Manage. 9 (2007) 206–224. [CrossRef] [Google Scholar]
  • R.F. Teixeira Jr, F.C.F. Fernandes and N.A. Pereira, Binary integer programming formulations for scheduling in market-driven foundries. Comput. Ind. Eng. 59 (2010) 425–435. [Google Scholar]
  • V.S. Tonaki and F.M.B. Toledo, An approach to solve the lot-sizing and scheduling problem in market-driven foundries. J. Oper. Res. Soc. 61 (2010) 108–114. [Google Scholar]
  • E.A.V. Toso, R. Morabito and A. Clark, Lot sizing and sequencing optimization at an animal-feed plan. Comput. Ind. Eng. 57 (2009) 813–821. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.