Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
From MaRDI portal
Publication:613461
DOI10.1016/j.ejor.2010.07.003zbMath1206.90004OpenAlexW1979587070MaRDI QIDQ613461
Publication date: 20 December 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.07.003
Related Items (4)
Improving inventory system performance by selective purchasing of buyers' willingness to wait ⋮ Comparison of different approaches to multistage lot sizing with uncertain demand ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Capacitated lot sizing problems with inventory bounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial algorithm for the production/ordering planning problem with limited storage
- An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
- On stochastic lot-sizing problems with random lead times
- Four equivalent lot-sizing models
- An efficient algorithm for the capacitated single item dynamic lot size problem
- An effective algorithm for the capacitated single item lot size problem
- A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
- A dynamic analysis of the single-item periodic stochastic inventory system with order capacity
- A new characterization for the dynamic lot size problem with bounded inventory
- Remanufacturing planning for the reverse Wagner/Whitin models
- Economic lot sizing problem with inventory bounds
- Lot-sizing with non-stationary cumulative capacities
- Lot-sizing with production and delivery time windows
- 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
- The Value of Multistage Stochastic Programming in Capacity Planning Under Uncertainty
- A Dynamic Lot-Sizing Model with Demand Time Windows
- A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
- Storage-Space Capacitated Inventory System with (r, Q) Policies
- TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
- Using Stochastic Approximation Methods to Compute Optimal Base-Stock Levels in Inventory Control Problems
- Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
- Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- A simple proof for optimality of (s, S) policies in infinite-horizon inventory systems
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- An Efficient Algorithm for Computing an Optimal (r, Q) Policy in Continuous Review Stochastic Inventory Systems
- Bounded Production and Inventory Models with Piecewise Concave Costs
- Improved Algorithms for Economic Lot Size Problems
- X-Y Band and Modified (s, S) Policy
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Computing Optimal (s, S) Inventory Policies
- Minimum Concave Cost Flows in Certain Networks
This page was built for publication: Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
