A new algorithm and a new heuristic for serial supply systems
From MaRDI portal
Publication:2488230
DOI10.1016/j.orl.2004.09.001zbMath1090.90001MaRDI QIDQ2488230
Publication date: 25 August 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.09.001
90C59: Approximation methods and heuristics in mathematical programming
91B70: Stochastic models in economics
90B05: Inventory, storage, reservoirs
Related Items
A typology and literature review on stochastic multi-echelon inventory models, A characterization of optimal base-stock levels for a multistage serial supply chain, Modified Echelon (r, Q) Policies with Guaranteed Performance Bounds for Stochastic Serial Inventory Systems, Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models, A HEURISTIC APPROACH FOR SOLVING SERIALLY DISTRIBUTED STORAGE DEPOTS UNDER GENERAL-INTEGER POLICY
Cites Work
- Unnamed Item
- Newsvendor Bounds and Heuristic for Optimal Policies in Serial Supply Chains
- Computational Issues in an Infinite-Horizon, Multiechelon Inventory Model
- Optimal Inventory Policies for Assembly Systems Under Random Demands
- The Distribution Free Newsboy Problem: Review and Extensions
- Lower Bounds for Multi-Echelon Stochastic Inventory Systems
- Sub-optimal Time-variable Feedback Control of Linear Dynamic Systems with Random Inputs†
- Customer-Order Information, Leadtimes, and Inventories