ABCβ -- A Heuristic for Dynamic Capacitated Lot Sizing with Random Demand under a Fillrate Constraint
Résumé
This paper deals with the dynamic multi-item capacitated lot-sizing problem (CLSP) with random demands over a finite discrete time horizon. Unfilled demands are backordered. It is assumed that a fillrate 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 (1986) for the deterministic CLSP to the case of random demands.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...