Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems

DOI10.1287/opre.1070.0479zbMath1167.90329OpenAlexW2101913016MaRDI QIDQ3392239

Andrew J. Miller, Yongpei Guan

Publication date: 13 August 2009

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

Full work available at URL: https://doi.org/10.1287/opre.1070.0479

Mathematics Subject Classification ID

Stochastic programming (90C15) Inventory, storage, reservoirs (90B05)

Related Items (23)

Dynamic lot sizing with stochastic demand timing ⋮ The stochastic lot-sizing problem with quantity discounts ⋮ Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty ⋮ Two-stage stochastic lot-sizing problem under cost uncertainty ⋮ A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times ⋮ Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs ⋮ Stochastic lot-sizing problem with inventory-bounds and constant order-capacities ⋮ New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem ⋮ Comparison of different approaches to multistage lot sizing with uncertain demand ⋮ Dynamic capacitated lot sizing with random demand and dynamic safety stocks ⋮ A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging ⋮ Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ On a Multi-stage Stochastic Programming Model for Inventory Planning ⋮ A polyhedral study of the static probabilistic lot-sizing problem ⋮ Dynamic programming and heuristic for stochastic uncapacitated lot-sizing problems with incremental quantity discount ⋮ Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem ⋮ On stochastic lot-sizing problems with random lead times ⋮ Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy ⋮ Stochastic lot-sizing with backlogging: computational complexity analysis ⋮ Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics ⋮ Extended formulations for stochastic lot-sizing problems ⋮ Robust formulations for economic lot-sizing problem with remanufacturing

This page was built for publication: Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems