Stochastic lot-sizing with backlogging: computational complexity analysis
From MaRDI portal
Publication:537961
DOI10.1007/s10898-010-9555-3zbMath1219.90112OpenAlexW2050901097MaRDI QIDQ537961
Publication date: 23 May 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9555-3
Related Items (3)
The stochastic lot-sizing problem with quantity discounts ⋮ Stochastic lot sizing problem with nervousness considerations ⋮ Single-item dynamic lot-sizing problems: an updated survey
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
- On stochastic lot-sizing problems with random lead times
- The Value of Multistage Stochastic Programming in Capacity Planning Under Uncertainty
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- A Dynamic Lot-Sizing Model with Demand Time Windows
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
- An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Computational Complexity of the Capacitated Lot Size Problem
- 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 Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- A branch and bound method for stochastic integer problems under probabilistic constraints
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
This page was built for publication: Stochastic lot-sizing with backlogging: computational complexity analysis
