Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in O(N N) time
From MaRDI portal
Publication:613509
DOI10.1016/J.COR.2010.08.009zbMATH Open1202.90011OpenAlexW2153518835MaRDI QIDQ613509FDOQ613509
Bing Lin, Arun Kumar, Yi Feng, Shaoxiang Chen
Publication date: 20 December 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.08.009
Recommendations
- An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost
- Economic lot sizing with constant capacities and concave inventory costs
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs
- An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
Dynamic programming (90C39) Stochastic programming (90C15) Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05)
Cites Work
- Primal-Dual Algorithms for Deterministic Inventory Problems
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
- 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
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- Lot sizing and scheduling -- survey and extensions
- Single item lot sizing problems
- Title not available (Why is that?)
- 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
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- Computational Complexity of the Capacitated Lot Size Problem
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Title not available (Why is that?)
- Progress with single-item lot-sizing
- The Infinite Horizon Periodic Review Problem with Setup Costs and Capacity Constraints: A Partial Characterization of the Optimal Policy
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
- An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
- TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
- X-Y Band and Modified (s, S) Policy
- An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
- An effective algorithm for the capacitated single item lot size problem
- A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility
- Approximation Formulations for the Single-Product Capacitated Lot Size Problem
- Title not available (Why is that?)
- An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost
Cited In (9)
- The Single-Product Lot-Sizing Problem with Constant Parameters and Backlogging: Exact Results, a New Solution, and All Parameter Stability Regions
- Single-item dynamic lot-sizing problems: an updated survey
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- LQ optimal sliding mode control of periodic review perishable inventories with transportation losses
- An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
- Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount
- A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale
- A polynomial time algorithm for convex cost lot-sizing problems
This page was built for publication: Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613509)
