A new algorithm and a new heuristic for serial supply systems
From MaRDI portal
Recommendations
- Note: A Simple Heuristic for Serial Inventory Systems with Fixed Order Costs
- Newsvendor bounds and heuristic for optimal policies in serial supply chains
- A new algorithm for a multi-item periodic review inventory system
- Near-optimal echelon-stock (R,nQ) policies in multistage serial systems
- Probabilistic solution and bounds for serial inventory systems with discounted and average costs
Cites work
- Computational Issues in an Infinite-Horizon, Multiechelon Inventory Model
- Customer-Order Information, Leadtimes, and Inventories
- Foundations of inventory management
- Lower Bounds for Multi-Echelon Stochastic Inventory Systems
- Newsvendor bounds and heuristic for optimal policies in serial supply chains
- Optimal Inventory Policies for Assembly Systems Under Random Demands
- Sub-optimal Time-variable Feedback Control of Linear Dynamic Systems with Random Inputs†
- The Distribution Free Newsboy Problem: Review and Extensions
Cited in
(7)- A typology and literature review on stochastic multi-echelon inventory models
- Supply chain models for an assembly system with preprocessing of raw materials: a simple and better algorithm
- 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
- Optimal policy for two-stage Brownian inventory systems under the long-run average cost criterion
This page was built for publication: A new algorithm and a new heuristic for serial supply systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2488230)