dc.contributor | Univ W England | |
dc.contributor | Universidade Estadual Paulista (Unesp) | |
dc.contributor | Universidade de São Paulo (USP) | |
dc.date.accessioned | 2014-05-20T15:24:43Z | |
dc.date.available | 2014-05-20T15:24:43Z | |
dc.date.created | 2014-05-20T15:24:43Z | |
dc.date.issued | 2007-08-01 | |
dc.identifier | Journal of Heuristics. Dordrecht: Springer, v. 13, n. 4, p. 337-358, 2007. | |
dc.identifier | 1381-1231 | |
dc.identifier | http://hdl.handle.net/11449/35279 | |
dc.identifier | 10.1007/s10732-007-9011-9 | |
dc.identifier | WOS:000248116400002 | |
dc.identifier | 0000-0002-4762-2048 | |
dc.description.abstract | A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally tested against a high-performance MIP solver. Three variants of local search are also developed to improve the RF method and tested. Finally the solutions are compared with those currently practiced at the foundry. | |
dc.language | eng | |
dc.publisher | Springer | |
dc.relation | Journal of Heuristics | |
dc.relation | 1.129 | |
dc.relation | 1,008 | |
dc.rights | Acesso restrito | |
dc.source | Web of Science | |
dc.subject | lot-sizing | |
dc.subject | scheduling | |
dc.subject | sequence-dependent setup costs and times | |
dc.subject | fix-and-relax | |
dc.subject | local search | |
dc.title | Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups | |
dc.type | Artículos de revistas | |