Gaul, Constantin ;
Kurz, Sascha ;
Rambau, Jörg
The Combinatorics of (S,M,L,XL) or the best fitting delivery of T-shirts
Abstract
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.
BibTeX - Entry
@InProceedings{gaul_et_al:DagSemProc.09261.29,
author = {Gaul, Constantin and Kurz, Sascha and Rambau, J\"{o}rg},
title = {{The Combinatorics of (S,M,L,XL) or the best fitting delivery of T-shirts}},
booktitle = {Models and Algorithms for Optimization in Logistics},
pages = {1--5},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9261},
editor = {Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2009/2171},
URN = {urn:nbn:de:0030-drops-21718},
doi = {10.4230/DagSemProc.09261.29},
annote = {Keywords: Supply chain management, fashion retailer, integer linear programming, demand forecasting}
}
|
Keywords: |
|
Supply chain management, fashion retailer, integer linear programming, demand forecasting |
|
Seminar: |
|
09261 - Models and Algorithms for Optimization in Logistics
|
|
Issue date: |
|
2009 |
|
Date of publication: |
|
02.10.2009 |
02.10.2009
