Approximation algorithms for deterministic continous-review inventory lot-sizing problems with time-varying demand - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2014

Approximation algorithms for deterministic continous-review inventory lot-sizing problems with time-varying demand

Résumé

This work deals with the continuous time lot-sizing inventory problem when demand and costs are time-dependent. We adapt a cost balancing technique developed for the periodic-review version of our problem to the continuous-review framework. We prove that the solution obtained costs at most twice the cost of an optimal solution. We study the numerical complexity of the algorithm and generalize the policy to several important extensions while preserving its performance guarantee of two. Finally, we propose a modified version of our algorithm for the lot-sizing model with some restricted settings that improves the worst-case bound.
Fichier principal
Vignette du fichier
TimeVaryingEOQ.pdf (180.4 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00947092 , version 1 (28-03-2024)

Identifiants

Citer

Guillaume Massonnet, Jean-Philippe Gayon, Christophe Rapine. Approximation algorithms for deterministic continous-review inventory lot-sizing problems with time-varying demand. European Journal of Operational Research, 2014, 234 (3), pp.641-649. ⟨10.1016/j.ejor.2013.09.037⟩. ⟨hal-00947092⟩
58 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More