dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorUniversidade de São Paulo (USP)
dc.contributorUniversity of the West of England
dc.date.accessioned2014-05-27T11:22:48Z
dc.date.accessioned2022-10-05T18:11:30Z
dc.date.available2014-05-27T11:22:48Z
dc.date.available2022-10-05T18:11:30Z
dc.date.created2014-05-27T11:22:48Z
dc.date.issued2008-03-01
dc.identifierComputers and Operations Research, v. 35, n. 3, p. 916-932, 2008.
dc.identifier0305-0548
dc.identifierhttp://hdl.handle.net/11449/70313
dc.identifier10.1016/j.cor.2006.05.010
dc.identifierWOS:000250256100022
dc.identifier2-s2.0-34548453509
dc.identifier0000-0002-4762-2048
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3919631
dc.description.abstractA 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.languageeng
dc.relationComputers and Operations Research
dc.relation2.962
dc.relation1,916
dc.rightsAcesso restrito
dc.sourceScopus
dc.subjectLot sizing and scheduling
dc.subjectMeta-heuristics
dc.subjectMixed integer programming
dc.subjectHeuristic algorithms
dc.subjectInteger programming
dc.subjectMetadata
dc.subjectProblem solving
dc.subjectTabu search
dc.subjectMetaheuristics
dc.subjectScheduling
dc.titleLot sizing and furnace scheduling in small foundries
dc.typeArtigo


Este ítem pertenece a la siguiente institución