An O(n^2) algorithm for lot sizing with inventory bounds and fixed costs
From MaRDI portal
Publication:943783
DOI10.1016/J.ORL.2007.08.004zbMATH Open1152.90639OpenAlexW2029937213MaRDI QIDQ943783FDOQ943783
Authors: Simge Küçükyavuz, Alper Atamtürk 
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.08.004
Recommendations
- Improved algorithms for a lot-sizing problem with inventory bounds and backlogging
- 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
- A note on ``The economic lot sizing problem with inventory bounds
- Economic lot sizing with constant capacities and concave inventory costs
Cites Work
- 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
- 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
- Bounded Production and Inventory Models with Piecewise Concave Costs
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
Cited In (24)
- A note on ``The economic lot sizing problem with inventory bounds
- Stochastic lot-sizing with backlogging: computational complexity analysis
- Multi-item uncapacitated lot sizing problem with inventory bounds
- Integrated production and transportation scheduling with order-dependent inventory holding costs
- Single-item dynamic lot-sizing problems: an updated survey
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Multiechelon Lot Sizing: New Complexities and Inequalities
- Lot sizing with storage losses under demand uncertainty
- On robust lot sizing problems with storage deterioration, with applications to heat and power cogeneration
- Combined replenishment and warehousing with contract commitments and flexibilities
- The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity
- Polynomial-time solvability of dynamic lot size problems
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
- A branch-and-cut algorithm for an assembly routing problem
- Two-level lot-sizing with inventory bounds
- Capacitated lot sizing problems with inventory bounds
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
- Improved algorithms for a lot-sizing problem with inventory bounds and backlogging
- Dynamic lot-sizing model under perishability, substitution, and limited storage capacity
- Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds
- Minimum concave cost flow over a grid network
- Four equivalent lot-sizing models
- Joint optimization of dynamic lot and warehouse sizing problems
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
This page was built for publication: An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943783)
