A new network flow model for determining the assortment of roll types in packaging industry
dc.authorid | 0000-0002-0556-7482 | en_US |
dc.contributor.author | Tombuş Ö. | |
dc.contributor.author | Ertek G. | |
dc.contributor.author | Atay C. | |
dc.contributor.author | Kökten G. | |
dc.contributor.author | Tombuş A.C. | |
dc.date.accessioned | 2024-07-12T22:02:02Z | |
dc.date.available | 2024-07-12T22:02:02Z | |
dc.date.issued | 2010 | en_US |
dc.department | Maltepe Üniversitesi, Rektörlük | en_US |
dc.description | 2010 IEEE International Conference on Systems, Man and Cybernetics, SMC 2010 -- 10 October 2010 through 13 October 2010 -- Istanbul -- 83423 | en_US |
dc.description.abstract | 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. | en_US |
dc.identifier.doi | 10.1109/ICSMC.2010.5642413 | |
dc.identifier.endpage | 1235 | en_US |
dc.identifier.isbn | 9.78142E+12 | |
dc.identifier.issn | 1062922X | |
dc.identifier.scopus | 2-s2.0-78751519885 | en_US |
dc.identifier.scopusquality | N/A | en_US |
dc.identifier.startpage | 1231 | en_US |
dc.identifier.uri | https://dx.doi.org/10.1109/ICSMC.2010.5642413 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12415/9076 | |
dc.indekslendigikaynak | Scopus | |
dc.language.iso | en | en_US |
dc.relation.ispartof | Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.snmz | KY07263 | |
dc.subject | Assortment problem | en_US |
dc.subject | Cutting stock | en_US |
dc.subject | Dynamic programming | en_US |
dc.subject | Packaging industry | en_US |
dc.subject | Shortest path problem | en_US |
dc.title | A new network flow model for determining the assortment of roll types in packaging industry | en_US |
dc.type | Conference Object | |
dspace.entity.type | Publication |