Lot sizing and furnace scheduling in small foundries


Autoria(s): ARAUJO, Silvio A. de; ARENALES, Marcos N.; CLARK, Alistair R.
Contribuinte(s)

UNIVERSIDADE DE SÃO PAULO

Data(s)

20/10/2012

20/10/2012

2008

Resumo

A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (I the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots. A mixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing time for non-small instances. As a result, a faster relax-and-fix (RF) approach is developed that can also be used on a rolling horizon basis where only immediate-term schedules are implemented. As well as a MIP method to solve the basic RF approach, three variants of a local search method are also developed and tested using instances based on the literature. Finally, foundry-based tests with a real-order book resulted in a very substantial reduction of delivery delays and finished inventory, better use of capacity, and much faster schedule definition compared to the foundry`s own practice. (c) 2006 Elsevier Ltd. All rights reserved.

Identificador

COMPUTERS & OPERATIONS RESEARCH, v.35, n.3, p.916-932, 2008

0305-0548

http://producao.usp.br/handle/BDPI/28975

10.1016/j.cor.2006.05.010

http://dx.doi.org/10.1016/j.cor.2006.05.010

Idioma(s)

eng

Publicador

PERGAMON-ELSEVIER SCIENCE LTD

Relação

Computers & Operations Research

Direitos

restrictedAccess

Copyright PERGAMON-ELSEVIER SCIENCE LTD

Palavras-Chave #lot sizing and scheduling #meta-heuristics #mixed integer programming #DEPENDENT SETUP COSTS #GENETIC ALGORITHM #STEEL PRODUCTION #LOCAL SEARCH #HEURISTICS #SYSTEMS #SIZES #MODEL #TIMES #REQUIREMENTS #Computer Science, Interdisciplinary Applications #Engineering, Industrial #Operations Research & Management Science
Tipo

article

original article

publishedVersion