Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times

DOI10.1287/opre.2013.1162zbMath1273.90014OpenAlexW2001608256MaRDI QIDQ2846418

Retsef Levi, Cong Shi

Publication date: 5 September 2013

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/87771

zbMATH Keywords

inventoryapproximation algorithmsstochastic lot-sizingrandomized cost balancing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (11)

Approximation Algorithms for Perishable Inventory Systems ⋮ Dynamic lot sizing with stochastic demand timing ⋮ Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories ⋮ Knowledge You Can Act on: Optimal Policies for Assembly Systems with Expediting and Advance Demand Information ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models ⋮ Confidence Intervals for Data-Driven Inventory Policies with Demand Censoring ⋮ Technical Note—Approximation Algorithms for Perishable Inventory Systems with Setup Costs ⋮ Process quality adjusted lot sizing and marketing interface in JIT environment ⋮ Queuing with future information ⋮ Approximation Algorithm for the Stochastic Multiperiod Inventory Problem via a Look-Ahead Optimization Approach

This page was built for publication: Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times