A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Operations Research Letters Année : 2014

A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows

Fichier non déposé

Dates et versions

hal-01105419 , version 1 (20-01-2015)

Identifiants

Citer

Bertrand Hellion, Fabien Mangione, Bernard Penz. A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows. Operations Research Letters, 2014, 42, pp.500-504. ⟨10.1016/j.orl.2014.08.010⟩. ⟨hal-01105419⟩
54 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More