dc.contributor | Universidade Estadual Paulista (Unesp) | |
dc.contributor | Universidade de São Paulo (USP) | |
dc.contributor | University of the West of England | |
dc.date.accessioned | 2014-05-27T11:22:48Z | |
dc.date.accessioned | 2022-10-05T18:11:30Z | |
dc.date.available | 2014-05-27T11:22:48Z | |
dc.date.available | 2022-10-05T18:11:30Z | |
dc.date.created | 2014-05-27T11:22:48Z | |
dc.date.issued | 2008-03-01 | |
dc.identifier | Computers and Operations Research, v. 35, n. 3, p. 916-932, 2008. | |
dc.identifier | 0305-0548 | |
dc.identifier | http://hdl.handle.net/11449/70313 | |
dc.identifier | 10.1016/j.cor.2006.05.010 | |
dc.identifier | WOS:000250256100022 | |
dc.identifier | 2-s2.0-34548453509 | |
dc.identifier | 0000-0002-4762-2048 | |
dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/3919631 | |
dc.description.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. | |
dc.language | eng | |
dc.relation | Computers and Operations Research | |
dc.relation | 2.962 | |
dc.relation | 1,916 | |
dc.rights | Acesso restrito | |
dc.source | Scopus | |
dc.subject | Lot sizing and scheduling | |
dc.subject | Meta-heuristics | |
dc.subject | Mixed integer programming | |
dc.subject | Heuristic algorithms | |
dc.subject | Integer programming | |
dc.subject | Metadata | |
dc.subject | Problem solving | |
dc.subject | Tabu search | |
dc.subject | Metaheuristics | |
dc.subject | Scheduling | |
dc.title | Lot sizing and furnace scheduling in small foundries | |
dc.type | Artigo | |