Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs

DOI10.1016/j.orl.2010.05.007zbMath1202.90121OpenAlexW2002911931MaRDI QIDQ613341

Yongpei Guan, Zhili Zhou

Publication date: 20 December 2010

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

Full work available at URL: https://doi.org/10.1016/j.orl.2010.05.007

zbMATH Keywords

stochastic programminginteger programmingpolyhedral combinatoricslot-sizing

Mathematics Subject Classification ID

Stochastic programming (90C15) Production models (90B30)

Related Items (3)

Single-item dynamic lot-sizing problems: an updated survey ⋮ The setup carryover assignment problem ⋮ Extended formulations for stochastic lot-sizing problems

Cites Work

• Unnamed Item
• Unnamed Item
• On stochastic lot-sizing problems with random lead times
• Uncapacitated lot sizing with backlogging: the convex hull
• Lot-size models with backlogging: Strong reformulations and cutting planes
• A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
• Polyhedra for lot-sizing with Wagner-Whitin costs
• On formulations of the stochastic uncapacitated lot-sizing problem
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• Dynamic Version of the Economic Lot Size Model
• Uncapacitated lot-sizing: The convex hull of solutions
• Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
• Introduction to Stochastic Programming

This page was built for publication: Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs