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
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
Cites work
- scientific article; zbMATH DE number 3843492 (Why is no real title available?)
- scientific article; zbMATH DE number 232493 (Why is no real title available?)
- scientific article; zbMATH DE number 3399006 (Why is no real title available?)
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
- An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
- An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost
- An effective algorithm for the capacitated single item lot size problem
- Approximation Formulations for the Single-Product Capacitated Lot Size Problem
- Computational Complexity of the Capacitated Lot Size Problem
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Dynamic version of the economic lot size model
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- Improved Algorithms for Economic Lot Size Problems
- Lot sizing and scheduling -- survey and extensions
- Primal-Dual Algorithms for Deterministic Inventory Problems
- Progress with single-item lot-sizing
- Single item lot sizing problems
- TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
- 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
- X-Y Band and Modified (s, S) Policy
Cited in
(17)- A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs
- 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
- A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters
- LQ optimal sliding mode control of periodic review perishable inventories with transportation losses
- An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost
- An efficient approach for solving the lot-sizing problem with time-varying storage capacities
- Solving a constrained economic lot size problem by ranking efficient production policies
- 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
- Efficient approximation schemes for economic lot-sizing in continuous time
- A polynomial time algorithm for convex cost lot-sizing problems
- Economic lot sizing with constant capacities and concave inventory costs
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)
