Abstract
Due to the diversification of customer’ demands, cutting and packing enterprises need to arrange production plans flexibly. This paper proposes a heuristic algorithm to help enterprises make cutting or packing plans. With this algorithm, a class of different customer demands are considered, such as orientation of items and cutting style. The idea of this heuristic algorithm is from the dynamic programming idea by aggregating states to avoid the explosion of the number of states. The advantages of this algorithm are its flexibility, competitive computation time, and performance with respect to metaheuristics.
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 callMore From: The International Journal of Advanced Manufacturing Technology
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.
