Extended formulations for stochastic lot-sizing problems

DOI10.1016/j.orl.2014.04.003zbMath1408.90030OpenAlexW1986755029MaRDI QIDQ1785234

Yongpei Guan, Chaoyue Zhao

Publication date: 28 September 2018

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

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

zbMATH Keywords

stochastic programmingintegral solutionlot-sizing

Mathematics Subject Classification ID

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

Related Items (3)

Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty ⋮ Comparison of different approaches to multistage lot sizing with uncertain demand ⋮ Planning production and workforce in a discrete-time financial model using scenarios modeling

Cites Work

• Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs
• A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
• Polyhedra for lot-sizing with Wagner-Whitin costs
• 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
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case

This page was built for publication: Extended formulations for stochastic lot-sizing problems