Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups

dc.contributorUniversidade Estadual Paulista (UNESP)
dc.creatorde Araujo, Silvio A.
dc.creatorArenales, Marcos N.
dc.creatorClark, Alistair R.
dc.date2014-05-20T15:24:43Z
dc.date2016-10-25T17:59:02Z
dc.date2014-05-20T15:24:43Z
dc.date2016-10-25T17:59:02Z
dc.date2007-08-01
dc.date.accessioned2017-04-05T23:48:49Z
dc.date.available2017-04-05T23:48:49Z
dc.identifierJournal of Heuristics. Dordrecht: Springer, v. 13, n. 4, p. 337-358, 2007.
dc.identifier1381-1231
dc.identifierhttp://hdl.handle.net/11449/35279
dc.identifierhttp://acervodigital.unesp.br/handle/11449/35279
dc.identifier10.1007/s10732-007-9011-9
dc.identifierWOS:000248116400002
dc.identifier0000-0002-4762-2048
dc.identifierhttp://dx.doi.org/10.1007/s10732-007-9011-9
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/879041
dc.descriptionA 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.languageeng
dc.publisherSpringer
dc.relationJournal of Heuristics
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectlot-sizing
dc.subjectscheduling
dc.subjectsequence-dependent setup costs and times
dc.subjectfix-and-relax
dc.subjectlocal search
dc.titleJoint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups
dc.typeOtro


Este ítem pertenece a la siguiente institución