Lot sizing and furnace scheduling in small foundries
Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
---|---|
Data(s) |
27/05/2014
27/05/2014
01/03/2008
|
Resumo |
A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (1) 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. © 2006 Elsevier Ltd. All rights reserved. |
Formato |
916-932 |
Identificador |
http://dx.doi.org/10.1016/j.cor.2006.05.010 Computers and Operations Research, v. 35, n. 3, p. 916-932, 2008. 0305-0548 http://hdl.handle.net/11449/70313 10.1016/j.cor.2006.05.010 WOS:000250256100022 2-s2.0-34548453509 |
Idioma(s) |
eng |
Relação |
Computers and Operations Research |
Direitos |
closedAccess |
Palavras-Chave | #Lot sizing and scheduling #Meta-heuristics #Mixed integer programming #Heuristic algorithms #Integer programming #Metadata #Problem solving #Tabu search #Metaheuristics #Scheduling |
Tipo |
info:eu-repo/semantics/article |