Tombus, OnderErtek, GurdalAtay, CerenKokten, GizemTombus, Ayse Cilaci2024-07-122024-07-122010978-1-4244-6588-01062-922Xhttps://hdl.handle.net/20.500.12415/8965IEEE International Conference on Systems, Man and Cybernetics -- OCT 10-13, 2010 -- Istanbul, TURKEYThis paper reports work motivated by a real world assortment problem in packaging industry. A novel network flow model has been developed to solve the problem of selecting the optimal set of roll types for use in production. The model can incorporate fixed costs that depend on the number of elements in the assortment as well as the selected roll types. While the trade-off between inventory cost and cost of waste is resolved optimally through the model, graphical understanding of the trade-off can bring insights into the decision making process. This graphical analysis has been demonstrated on a computational example.eninfo:eu-repo/semantics/closedAccessassortment problemcutting stockpackaging industryshortest path problemdynamic programmingConference ObjectWOS:000295015300036N/A