NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2017

NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract

Fichier non déposé

Dates et versions

hal-02336559 , version 1 (29-10-2019)

Identifiants

Citer

Ayse Akbalik, Atidel Hadj-Alouane, Nathalie Sauer, Houcem Ghribi. NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract. European Journal of Operational Research, 2017, 257 (2), pp.483-493. ⟨10.1016/j.ejor.2016.07.028⟩. ⟨hal-02336559⟩
44 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More