2026-07-23T04:53:21Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2171 2024-03-06T11:08:51Z ddc:004 open_access

The Combinatorics of (S,M,L,XL) or the best fitting delivery of T-shirts Gaul, Constantin Kurz, Sascha Rambau, Jörg Supply chain management fashion retailer integer linear programming demand forecasting A fashion discounter supplies its branches with apparel in various sizes. Apparel is ordered in pre-packs three months in advance from overseas: replenishment impossible. Thus, the supply in each size and branch must be consistent with the demand right away. We present new ILP-models for the resulting lot-type design problem: For each branch, find lot types and delivery volumes so that the demand is met best. Our vision is an integrated price-and-size optimization model that takes the mark-down process into account when placing the orders. The results are applied by a german fashion discounter with over 1000 branches. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Constantin Gaul and Sascha Kurz and Jörg Rambau 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09261.29 urn:nbn:de:0030-drops-21718 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.29 eng https://creativecommons.org/licenses/by/4.0/legalcode