Abstract
A Two-level method is proposed to solve the one-dimensional cutting-stock problem during the production process in this paper. First, nested layer cycle is designed to enumerate all the feasible cutting patterns, then a integer linear programming model is established with quantity demands as the constraint. The best cutting scheme is obtained finally according to the branch and bound method. The effectiveness of the proposed method is proved through a real world example, the calculations demonstrate that scheme obviously improves the utilization rate of stock
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.
