ABC<sub>β</sub> -- A Heuristic for Dynamic Capacitated Lot Sizing with Random Demand under a Fillrate Constraint - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Production Research Année : 2010

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.

Mots clés

Fichier principal
Vignette du fichier
PEER_stage2_10.1080%2F00207540903179782.pdf (350.62 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00606293 , version 1 (06-07-2011)

Identifiants

Citer

Horst Tempelmeier, Sascha Herpers. ABCβ -- A Heuristic for Dynamic Capacitated Lot Sizing with Random Demand under a Fillrate Constraint. International Journal of Production Research, 2010, 48 (17), pp.5181-5193. ⟨10.1080/00207540903179782⟩. ⟨hal-00606293⟩

Collections

PEER
48 Consultations
414 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More