S,M,L,XL的组合-T恤的最佳拟合交付
The combinatorics of S, M, L, XL - The best fitting delivery of T-shirts
摘要:
我们考虑的问题近似的分支机构和大小依赖的需求的时装折扣店与许多分支机构的分销过程是基于分支机构的交付限制到整数倍的批次从一个小的可用的批量类型。我们提出了一个正式的模型,它产生于与行业合作伙伴的实际合作。除了整数线性规划制定,我们提供了一个适当的原始启发式这个问题。
英文摘要:
We consider the problem of approximating the branch and size dependent demand of a fashion discounter with many branches by a distributing process being based on the branch delivery restricted to integral multiples of lots from a small set of available lot-types. We propose a formalized model which arises from a practical cooperation with an industry partner. Besides an integer linear programming formulation we provide an appropriate primal heuristic for this problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。