An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
From MaRDI portal
Publication:3821896
DOI10.1287/mnsc.34.3.420zbMath0668.90015OpenAlexW2133836480MaRDI QIDQ3821896
Chia-Shin Chung, Chien-Hua Mike Lin
Publication date: 1988
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.34.3.420
Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)
Related Items (31)
A dynamic programming algorithm for dynamic lot size models with piecewise linear costs ⋮ An effective algorithm for the capacitated single item lot size problem ⋮ Decision horizons for the capacitated lot size model with inventory bounds and stockouts ⋮ Subcontracting and lot-sizing with constant capacities ⋮ Single item lot-sizing with non-decreasing capacities ⋮ Dual-mode production planning for manufacturing with emission constraints ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount ⋮ 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 ⋮ An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities ⋮ Economic lot sizing: the capacity reservation model ⋮ Capacitated production planning with outsourcing in an OKP company ⋮ An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost ⋮ Single item lot-sizing problem for a warm/cold process with immediate lost sales ⋮ A linear-time algorithm for finding optimal vehicle refueling policies ⋮ A single-item economic lot-sizing problem with a non-uniform resource: Approximation ⋮ A solution approach to the inventory routing problem in a three-level distribution system ⋮ Inventory replenishment model: lot sizing versus just-in-time delivery. ⋮ Forecasting errors and the value of information sharing in a supply chain ⋮ An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem ⋮ The value of information sharing in the presence of supply uncertainty and demand volatility ⋮ Improving the supply chain performance: Use of forecasting models versus early order commitments ⋮ Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost ⋮ An efficient algorithm for the capacitated single item dynamic lot size problem ⋮ A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure ⋮ Single item lot sizing problems ⋮ The impact of forecasting model selection on the value of information sharing in a supply chain ⋮ A two-echelon inventory optimization model with demand time window considerations ⋮ A new dynamic programming algorithm for the single item capacitated dynamic lot size model ⋮ A new characterization for the dynamic lot size problem with bounded inventory
This page was built for publication: An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
