Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand
From MaRDI portal
Publication:2514765
DOI10.1016/j.ejor.2013.09.037zbMath1304.90018OpenAlexW2081112309MaRDI QIDQ2514765
G. Massonnet, Christophe Rapine, Jean-Philippe Gayon
Publication date: 3 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.09.037
Related Items (3)
Profit maximization in an inventory system with time-varying demand, partial backordering and discrete inventory cycle ⋮ Inventory decisions for a finite horizon problem with product substitution options and time varying demand ⋮ Lot-sizing for production planning in a recovery system with returns
Cites Work
- Unnamed Item
- Worst case performance for lot sizing heuristics
- Lot-sizing heuristics for continuous time-varying demand and shortages
- The production-inventory problem of a product with time varying demand, production and deterioration rates
- Review of inventory systems with deterioration since 2001
- Dynamic Version of the Economic Lot Size Model
- Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics
- Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
- Inventory Replenishment Policy for Cyclic Demand
- On a Class of Optimization Problems for Finite Time Horizon Inventory Models
- Inventory Replenishment Policy for Increasing Demand
- On a General Solution of the Deterministic Lot Size Problem with Time-Proportional Demand
- Inventory Replenishment Policy for a Linear Trend in Demand—An Analytical Solution
- Deterministic Inventory Lot Size Models—A General Root Law
- A Simple Inventory Replenishment Decision Rule for a Linear Trend in Demand
- Improved Algorithms for Economic Lot Size Problems
- The Inventory Lot-Sizing Problem with Continuous Time-Varying Demand and Shortages
- Recent trends in modeling of deteriorating inventory
This page was built for publication: Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand
