Teixeira, Rodolfo Florence [UNESP]Faria Fernandes, Flavio CesarPereira, Neocles Alves2014-05-202014-05-202010-10-01Computers & Industrial Engineering. Oxford: Pergamon-Elsevier B.V. Ltd, v. 59, n. 3, p. 425-435, 2010.0360-8352http://hdl.handle.net/11449/8862This paper describes the development and solution of binary integer formulations for production scheduling problems in market-driven foundries. This industrial sector is comprised of small and mid-sized companies with little or no automation, working with diversified production, involving several different metal alloy specifications in small tailor-made product lots. The characteristics and constraints involved in a typical production environment at these industries challenge the formulation of mathematical programming models that can be computationally solved when considering real applications. However, despite the interest on the part of these industries in counting on effective methods for production scheduling, there are few studies available on the subject. The computational tests prove the robustness and feasibility of proposed models in situations analogous to those found in production scheduling at the analyzed industrial sector. (C) 2010 Elsevier Ltd. All rights reserved.425-435engBinary integer programmingProduction schedulingMarket-driven foundriesArtigo10.1016/j.cie.2010.05.015WOS:000281133200007Acesso restrito