Integer cutting stock procedures

Abstract

1he purpose of this study was to explore several methods for solving the one-dimensional. integer cutting stock problem and to synthesize a general integer cutting stock model for paper industry applications. Of the several integer programming and discrete alternative approaches that existed, the combinatorial programming procedure of Pierce was chosen as the most reliable and practical for cutting stock applications. Pierce’s procedure was programmed in FORTRAN IV and tested on the IBM 7040 with several typical problems. The method proved reliable for problems not in the class characterized by the fact that requirements for widths greater than half of the present stock width outweigh the requirements for widths less than half the stock width. A general cutting stock model was constructed to handle multiple stock widths, inventory considerations, and a restriction on the number of rolls a machine can cut from any particular stock roll.