License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-21718
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2171/

Gaul, Constantin ; Kurz, Sascha ; Rambau, Jrg

The Combinatorics of (S,M,L,XL) or the best fitting delivery of T-shirts

pdf-format:
Dokument 1.pdf (162 KB)


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:DSP:2009:2171,
  author =	{Constantin Gaul and Sascha Kurz and J{\"o}rg Rambau},
  title =	{The Combinatorics of (S,M,L,XL) or the best fitting delivery of T-shirts},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  year =	{2009},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M{\"o}hring},
  number =	{09261},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2171},
  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


DROPS-Home | Fulltext Search | Imprint Published by LZI