A New Linear Programming Approach to the Cutting Stock Problem
Operations Research · 1981 · Volume 29 · Issue 6
Abstract
A new approach to the one-dimensional cutting stock problem is described and compared to the classical model for which Gilmore and Gomory have developed a special column-generation technique. The new model is characterized by a dynamic use of simply structured cutting patterns. Nevertheless, it enables the representation of complex combinations of cuts. It can be advantageous in practical applications where many different stock lengths or a relatively large number of order lengths have to be dealt with. The new approach is applied to a real problem where the “trim loss” is not valueless, since it can be used for further demands arising in later planning periods.
Keywords
582 general model with application to special problems, 635 two equivalent LP-models of different dimensions, 306 a cutting stock and inventory problem
Enable JavaScript for citation tools and additional paper interactions.