首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand
Authors:G Massonnet  J-P Gayon  C Rapine
Institution:1. Grenoble-INP/UJF-Grenoble 1/CNRS, G-SCOP UMR5272 Grenoble, F-38031, France;2. Université de Lorraine, Laboratoire LGIPM, île du Saulcy, 57045 Metz Cedex 1, France
Abstract: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.
Keywords:Inventory theory  Approximation algorithms  Continuous-review policy  Deterministic model
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号