Newsvendor Bounds and Heuristic for Optimal Policies in Serial Supply Chains
From MaRDI portal
Publication:3114844
DOI10.1287/mnsc.49.5.618.15147zbMath1232.90090OpenAlexW2144878616MaRDI QIDQ3114844
No author found.
Publication date: 19 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9e97a026d2c05ce00b2c97333b253a8172362081
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items
A two-step gradient estimation approach for setting supply chain operating parameters ⋮ Robust newsvendor problem with autoregressive demand ⋮ Modified Echelon (r, Q) Policies with Guaranteed Performance Bounds for Stochastic Serial Inventory Systems ⋮ Ordering and pricing decisions in a two-echelon supply chain with asymmetric demand information ⋮ Heuristic approaches to determine base-stock levels in a serial supply chain with a single objective and with multiple objectives ⋮ Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models ⋮ Performance evaluation of stochastic multi-echelon inventory systems: a survey ⋮ A typology and literature review on stochastic multi-echelon inventory models ⋮ Determining near optimal base-stock levels in two-stage general inventory systems ⋮ A new algorithm and a new heuristic for serial supply systems ⋮ STEP-compliant process planning system for compound sheet metal machining ⋮ Joint Inventory and Cash Management for Multidivisional Supply Chains ⋮ A characterization of optimal base-stock levels for a multistage serial supply chain ⋮ Newsvendor bounds and heuristics for serial supply chains with regular and expedited shipping ⋮ A simple heuristic for echelon \((r,nQ,T)\) policies in serial supply chains ⋮ Optimal business hours of the newsvendor problem for retailers
