Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
From MaRDI portal
Publication:613461
DOI10.1016/J.EJOR.2010.07.003zbMATH Open1206.90004OpenAlexW1979587070MaRDI QIDQ613461FDOQ613461
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
Recommendations
- Linear programming models for a stochastic dynamic capacitated lot sizing problem
- On stochastic lot-sizing problems with random lead times
- Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs
- Approximation algorithms for the stochastic lot-sizing problem with order lead times
- Capacitated lot sizing problems with inventory bounds
Cites Work
- Title not available (Why is that?)
- Dynamic version of the economic lot size model
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- 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 integer programming approach for capacity expansion under uncertainty
- 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
- Computing Optimal (s, S) Inventory Policies
- Title not available (Why is that?)
- A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Economic lot sizing problem with inventory bounds
- Lot-sizing with production and delivery time windows
- Storage-Space Capacitated Inventory System with (r, Q) Policies
- Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy
- 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
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Minimum Concave Cost Flows in Certain Networks
- 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
- A polynomial algorithm for the production/ordering planning problem with limited storage
- A Dynamic Lot-Sizing Model with Demand Time Windows
- Using Stochastic Approximation Methods to Compute Optimal Base-Stock Levels in Inventory Control Problems
- On formulations of the stochastic uncapacitated lot-sizing problem
- Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
- On stochastic lot-sizing problems with random lead times
- An efficient algorithm for the capacitated single item dynamic lot size problem
- TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
- X-Y Band and Modified (s, S) Policy
- An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
- Four equivalent lot-sizing models
- A simple proof for optimality of (s, S) policies in infinite-horizon inventory systems
- An effective algorithm for the capacitated single item lot size problem
- Lot-sizing with non-stationary cumulative capacities
- Title not available (Why is that?)
Cited In (12)
- On stochastic lot-sizing problems with random lead times
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Single-item dynamic lot-sizing problems: an updated survey
- On the cutting stock problem under stochastic demand
- Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure
- A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand
- Comparison of different approaches to multistage lot sizing with uncertain demand
- Improving inventory system performance by selective purchasing of buyers' willingness to wait
- The stochastic lot-sizing problem with quantity discounts
- Capacitated lot sizing problems with inventory bounds
- An \(O(N^2)\)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times
- Technical Note—The Stochastic Discrete Dynamic Lot Size Problem: An Open-Loop Solution
This page was built for publication: Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613461)
