The usable leftover one-dimensional cutting stock problem-a priority-in-use heuristic

dc.contributorUniversidade Estadual Paulista (UNESP)
dc.creatorCherri, Adriana Cristina
dc.creatorArenales, Marcos Nereu
dc.creatorYanasse, Horacio Hideki
dc.date2014-05-27T11:28:35Z
dc.date2016-10-25T18:45:05Z
dc.date2014-05-27T11:28:35Z
dc.date2016-10-25T18:45:05Z
dc.date2013-03-01
dc.date.accessioned2017-04-06T02:15:33Z
dc.date.available2017-04-06T02:15:33Z
dc.identifierInternational Transactions in Operational Research, v. 20, n. 2, p. 189-199, 2013.
dc.identifier0969-6016
dc.identifier1475-3995
dc.identifierhttp://hdl.handle.net/11449/74720
dc.identifierhttp://acervodigital.unesp.br/handle/11449/74720
dc.identifier10.1111/j.1475-3995.2012.00868.x
dc.identifierWOS:000314177200002
dc.identifier2-s2.0-84873843606
dc.identifier0000-0003-1934-4682
dc.identifierhttp://dx.doi.org/10.1111/j.1475-3995.2012.00868.x
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/895480
dc.descriptionWe consider a one-dimensional cutting stock problem in which the material not used in the cutting patterns, if large enough, is kept for use in the future. Moreover, it is assumed that leftovers should not remain in stock for a long time, hence, such leftovers have priority-in-use compared to standard objects (objects bought by the industry) in stock. A heuristic procedure is proposed for this problem, and its performance is analyzed by solving randomly generated dynamic instances where successive problems are solved in a time horizon. For each period, new demands arise and a new problem is solved on the basis of the information about the stock of the previous periods (remaining standard objects in the stock) and usable leftovers generated during those previous periods. The computational experiments show that the solutions presented by the proposed heuristic are better than the solutions obtained by other heuristics from the literature. © 2012 The Authors. International Transactions in Operational Research © 2012 International Federation of Operational Research Societies.
dc.languageeng
dc.relationInternational Transactions in Operational Research
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectCutting stock problems
dc.subjectUsable leftovers
dc.subjectComputational experiment
dc.subjectCutting patterns
dc.subjectCutting stock
dc.subjectCutting stock problem
dc.subjectHeuristic procedures
dc.subjectOne-dimensional cutting stock problem
dc.subjectTime horizons
dc.subjectUsable leftover
dc.subjectHeuristic methods
dc.subjectOne dimensional
dc.subjectInteger programming
dc.titleThe usable leftover one-dimensional cutting stock problem-a priority-in-use heuristic
dc.typeOtro


Este ítem pertenece a la siguiente institución