A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
From MaRDI portal
Publication:1327429
DOI10.1007/BF01099265zbMath0812.90038OpenAlexW2032730604MaRDI QIDQ1327429
Chung-Yee Lee, Donald W. Hearn, Hsin-Der Chen
Publication date: 15 May 1995
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01099265
Related Items (11)
Dynamic programming approximation algorithms for the capacitated lot-sizing problem ⋮ Minimizing the error bound for the dynamic lot size model ⋮ Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time ⋮ Combined replenishment and warehousing with contract commitments and flexibilities ⋮ Economic lot sizing: the capacity reservation model ⋮ Improved algorithms for dynamic lot sizing problems with incremental discount ⋮ Improved exact algorithms to economic lot-sizing with piecewise linear production costs ⋮ Joint optimization of dynamic lot and warehouse sizing problems ⋮ A single-item economic lot-sizing problem with a non-uniform resource: Approximation ⋮ Feasible Sequential Decisions and a Flexible Lagrangean‐Based Heuristic for Dynamic Multi‐Level Lot Sizing ⋮ A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
Cites Work
- Unnamed Item
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
- Production planning with time-dependent capacity bounds
- A capacity constrained singlefacility dynamic lot-size model
- An efficient algorithm for the capacitated single item dynamic lot size problem
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model
- Finite-production-rate inventory models with first-and second-shift setups
- A Dynamic Lot-Size Model with Make-or-Buy Decisions
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Deterministic Production Planning: Algorithms and Complexity
- Multiple Finite Production Rate Dynamic Lot Size Inventory Models
- An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
- 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
- Bounded Production and Inventory Models with Piecewise Concave Costs
- A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- Optimal Inventory Policy with Multiple Set-Up Costs
This page was built for publication: A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
