de Araujo, Silvio A.Arenales, Marcos N.Clark, Alistair R.2014-05-202014-05-202007-08-01Journal of Heuristics. Dordrecht: Springer, v. 13, n. 4, p. 337-358, 2007.1381-1231http://hdl.handle.net/11449/35279A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally tested against a high-performance MIP solver. Three variants of local search are also developed to improve the RF method and tested. Finally the solutions are compared with those currently practiced at the foundry.337-358englot-sizingschedulingsequence-dependent setup costs and timesfix-and-relaxlocal searchArtigo10.1007/s10732-007-9011-9WOS:000248116400002Acesso restrito0000-0002-4762-2048