%0 Journal Article
%@holdercode {isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S}
%@nexthigherunit 8JMKD3MGPCW/3ESGTTP
%@archivingpolicy denypublisher denyfinaldraft36
%@usergroup administrator
%@usergroup simone
%3 the one dimensionarl.pdf
%X In this work we consider a one-dimensional cutting stock problem in which the non-used material in the cutting patterns may be used in the future, if large enough. This feature introduces difficulties in comparing solutions of the cutting problem, for example, up to what extent a minimum leftover solution is the most interesting one when the leftover may be used. Some desirable characteristics of good solutions are defined and classical heuristic methods are modified, so that cutting patterns with undesirable leftover (not large enough to be used, nor too small to be acceptable waste) are redesigned. The performance of the modified heuristics is observed by solving instances from the literature, practical instances and randomly generated instances.
%8 Aug.
%N 3
%T The one-dimensional cutting stock problem with usable leftover - A heuristic approach
%@secondarytype PRE PI
%K Cutting stock problems, Usable leftover.
%@group
%@group
%@group LAC-CTE-INPE-MCT-BR
%@secondarykey INPE--PRE/
%@issn  0377-2217
%2 sid.inpe.br/mtc-m18@80/2008/11.21.18.50.57
%@affiliation Universidade de São Paulo
%@affiliation Universidade de São Paulo
%@affiliation Instituto Nacional de Pesquisas Espaciais - INPE
%B European Journal of Operational Research
%P 897-908
%4 sid.inpe.br/mtc-m18@80/2008/11.21.18.50
%D 2009
%V 196
%@doi 10.1016/j.ejor.2008.04.039
%A Cherri, A. C.,
%A Arenales, M. N.,
%A Yanasse, Horácio Hideki,
%@dissemination WEBSCI; PORTALCAPES.
%@area COMP