Two-stage stochastic lot-sizing problem under cost uncertainty
From MaRDI portal
Publication:383162
DOI10.1007/s10479-013-1333-4zbMath1277.90046MaRDI QIDQ383162
Publication date: 25 November 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1333-4
Related Items
Differential evolution to solve the lot size problem in stochastic supply chain management systems, Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints
Cites Work
- Unnamed Item
- Unnamed Item
- An \(O(N^2)\)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times
- Lot-sizing on a tree
- 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
- Dynamic capacity acquisition and assignment under uncertainty
- 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
- The Value of Multistage Stochastic Programming in Capacity Planning Under Uncertainty
- A multi-stage stochastic programming approach for production planning with uncertainty in the quality of raw materials and demand
- Uncapacitated lot-sizing: The convex hull of solutions
- Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Introduction to Stochastic Programming
- Note. Optimal Promotion Strategies: A Demand-Sided Characterization
- Production Planning by Mixed Integer Programming
