Abstract
This paper is about the solution of certain classes of the cutting stock problem to optimality. The work is based on enumerating the possible cutting patterns, and solving the associated integer program by a combination of cutting planes and branch and bound. The resulting program was initially implemented in February 1985 for a one-dimensional cutting stock problem in a large board mill in the UK, where it has generated average savings of 2.5% of production compared to the best of two previous computer programs. The solutions obtained by the program are usually optimal in trim loss terms. Subsequent, post-solution optimisation minimises cutting patterns and reduces knife setups.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
