A new dynamic programming algorithm for the single item capacitated dynamic lot size model
From MaRDI portal
Publication:1318270
DOI10.1007/BF01098363zbMath0812.90037OpenAlexW2067292166MaRDI QIDQ1318270
Hsin-Der Chen, Chung-Yee Lee, Donald W. Hearn
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/bf01098363
Related Items (20)
A dynamic programming algorithm for dynamic lot size models with piecewise linear costs ⋮ Dynamic programming approximation algorithms for the capacitated lot-sizing problem ⋮ Dual-mode production planning for manufacturing with emission constraints ⋮ Analysis of bounds for a capacitated single-item lot-sizing problem ⋮ Capacitated dynamic lot-sizing problem with delivery/production time windows ⋮ Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time ⋮ Modèle linéaire mixte et heuristique pour un réseau de distribution à deux échelons pour des produits périssables ⋮ Capacitated production planning with outsourcing in an OKP company ⋮ Improved algorithms for dynamic lot sizing problems with incremental discount ⋮ Improved exact algorithms to economic lot-sizing with piecewise linear production costs ⋮ Inventory replenishment model: lot sizing versus just-in-time delivery. ⋮ Decentralized supply chain coordination through auction markets: dynamic lot-sizing in distribution networks ⋮ An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem ⋮ Cross-facility management of production and transportation planning problem ⋮ A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment ⋮ Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost ⋮ Capacitated dynamic lot sizing problems in closed-loop supply chain ⋮ Single item lot sizing problems ⋮ A two-echelon inventory optimization model with demand time window considerations ⋮ A Lagrangian heuristic for capacitated single item lot sizing problems
Cites Work
- A capacity constrained singlefacility dynamic lot-size model
- An efficient algorithm for the capacitated single item dynamic lot size problem
- Facets and algorithms for capacitated lot sizing
- Extreme points of Leontief substitution systems
- Uncapacitated lot-sizing: The convex hull of solutions
- A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Deterministic Production Planning: Algorithms and Complexity
- 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
This page was built for publication: A new dynamic programming algorithm for the single item capacitated dynamic lot size model
