Abstract
The problem of economically cutting a required bill of material out of standard size stock pieces is shared by the metal, leather, glass, electronic, shipbuilding, and lumber industries. One of the problems in this area is the assortment problem; that is, determining the best combination of stock sizes to keep in inventory to cut a single known (deterministic) bill of material. This problem includes determining the dimensions or the stock pieces as well as the number of unique sizes to stock. In this research a comparison is made between three common heuristic methods for solution of the assortment problem and the introduction of the application of optimization homotopy to the assortment problem, a method developed for the solution of stochastic problems. It is found that while utilizing a specific combination of nesting and sequencing algorithms, the three heuristic methods work very well for simpler problems, and as the complexity of the problem increases optimization homotopy becomes more advantageous.
Published Version
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.
