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.004zbMath1152.90639OpenAlexW2029937213MaRDI QIDQ943783
Simge Küçükyavuz, Atamtürk, Alper
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
Related Items (21)
Lot sizing with storage losses under demand uncertainty ⋮ Polynomial-Time Solvability of Dynamic Lot Size Problems ⋮ Dynamic lot-sizing model under perishability, substitution, and limited storage capacity ⋮ Integrated production and transportation scheduling with order-dependent inventory holding costs ⋮ Stochastic lot-sizing problem with inventory-bounds and constant order-capacities ⋮ Combined replenishment and warehousing with contract commitments and flexibilities ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Multiechelon Lot Sizing: New Complexities and Inequalities ⋮ Capacitated lot sizing problems with inventory bounds ⋮ Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds ⋮ Joint optimization of dynamic lot and warehouse sizing problems ⋮ Two-level lot-sizing with inventory bounds ⋮ Multi-item uncapacitated lot sizing problem with inventory bounds ⋮ Stochastic lot-sizing with backlogging: computational complexity analysis ⋮ A branch-and-cut algorithm for an assembly routing problem ⋮ Four equivalent lot-sizing models ⋮ The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity ⋮ Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory ⋮ On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid ⋮ On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration ⋮ Minimum concave cost flow over a grid network
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
- Bounded Production and Inventory Models with Piecewise Concave Costs
- Improved Algorithms for Economic Lot Size Problems
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
This page was built for publication: An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
