The one-dimensional cutting stock problem with usable leftover - A heuristic approach

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.