On stochastic lot-sizing problems with random lead times
From MaRDI portal
Publication:943786
DOI10.1016/j.orl.2007.10.009zbMath1152.90546OpenAlexW2164063315MaRDI QIDQ943786
Publication date: 10 September 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2007.10.009
Related Items (15)
Dynamic lot sizing with stochastic demand timing ⋮ The stochastic lot-sizing problem with quantity discounts ⋮ 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 ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ On a Multi-stage Stochastic Programming Model for Inventory Planning ⋮ An \(O(N^2)\)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times ⋮ A polyhedral study of the static probabilistic lot-sizing problem ⋮ Dynamic programming and heuristic for stochastic uncapacitated lot-sizing problems with incremental quantity discount ⋮ Multi-echelon supply chains with lead times and uncertain demands. A lot-sizing formulation and solutions ⋮ Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy ⋮ Stochastic lot-sizing with backlogging: computational complexity analysis
Cites Work
- A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- Dynamic Version of the Economic Lot Size Model
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- The Dynamic Lot-Size Model with Stochastic Lead Times
- (s, S) Policies for a Dynamic Inventory Model with Stochastic Lead Times
- Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
- Optimal Lot-Sizing/Vehicle-Dispatching Policies Under Stochastic Lead Times and Stepwise Fixed Costs
- 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
- Improved Algorithms for Economic Lot Size Problems
- A Dynamic Inventory Model with Stochastic Lead Times
- Unnamed Item
- Unnamed Item
This page was built for publication: On stochastic lot-sizing problems with random lead times
