科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper deals with the dynamic multi-item capacitated lot-sizing problem (CLSP) with random demand over a finite discrete time horizon. Unfilled demands are backordered. It is assumed that a fill rate constraint is in effect. We propose a heuristic solution procedure called ABC that extends the A/B/C heuristic introduced by Maes and Van Wassenhove for the deterministic CLSP to the case of random demands.
- 出版日期2010
