A New Network Flow Model for Determining the Assortment of Roll Types in Packaging Industry
Küçük Resim Yok
Tarih
2010
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
IEEE
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 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.
Açıklama
IEEE International Conference on Systems, Man and Cybernetics -- OCT 10-13, 2010 -- Istanbul, TURKEY
Anahtar Kelimeler
assortment problem, cutting stock, packaging industry, shortest path problem, dynamic programming
Kaynak
IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2010)
WoS Q Değeri
N/A
