A new network flow model for determining the assortment of roll types in packaging industry
Küçük Resim Yok
Tarih
2010
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
This 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 tradeoff 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. ©2010 IEEE.
Açıklama
2010 IEEE International Conference on Systems, Man and Cybernetics, SMC 2010 -- 10 October 2010 through 13 October 2010 -- Istanbul -- 83423
Anahtar Kelimeler
Assortment problem, Cutting stock, Dynamic programming, Packaging industry, Shortest path problem
Kaynak
Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
WoS Q Değeri
Scopus Q Değeri
N/A
