Abstract
A balance approach is presented to solve one-dimensional multiple stock size cutting stock problem with setup cost. The approach first utilizes a sequential pattern generation algorithm to generate a series of cutting plans based on each stock size, respectively. Then, a measure standard of cost balance utilization is used to select a current optimized cutting pattern from a cutting plan corresponding to each stock size. All item demands are dealt by the previous two steps to obtain many optimized cutting plans, and an ideal cutting plan is extracted according to the minimum sum of stock and setup costs at last. The approach is applied to two tests, and the computational results demonstrate that it possesses good cost adaptability and optimization performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture
Disclaimer: 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.