Meta-heuristics for the one-dimensional cutting stock problem with usable leftover

This work considers the one-dimensional cutting stock problem in which the non-used material in the cutting patterns may be used in the future, if large enough. We show that a multiobjective criteria to classify the solutions could be more accurate than previous classifications attempts, also we give a heuristic algorithm and two meta-heuristic approaches to the problem and we use them to solve practical and randomly generated instances from the literature. The results obtained by the computational experiments are quite good for all the tested instances.