You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/70313
Title: 
Lot sizing and furnace scheduling in small foundries
Author(s): 
Institution: 
  • Universidade Estadual Paulista (UNESP)
  • Universidade de São Paulo (USP)
  • University of the West of England
ISSN: 
0305-0548
Abstract: 
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.
Issue Date: 
1-Mar-2008
Citation: 
Computers and Operations Research, v. 35, n. 3, p. 916-932, 2008.
Time Duration: 
916-932
Keywords: 
  • Lot sizing and scheduling
  • Meta-heuristics
  • Mixed integer programming
  • Heuristic algorithms
  • Integer programming
  • Metadata
  • Problem solving
  • Tabu search
  • Metaheuristics
  • Scheduling
Source: 
http://dx.doi.org/10.1016/j.cor.2006.05.010
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/70313
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.