An efficient algorithm for the capacitated single item dynamic lot size problem

DOI10.1016/0377-2217(90)90152-2zbMath0685.90038OpenAlexW2059041202MaRDI QIDQ1262197

ömer Kirca

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90152-2

zbMATH Keywords

production schedulingcomputational resultsconcave costssingle item lot size problemworst case computational effort

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items

A dynamic programming algorithm for dynamic lot size models with piecewise linear costs ⋮ A new heuristic approach for the multi-item dynamic lot sizing problem ⋮ An effective algorithm for the capacitated single item lot size problem ⋮ Decision horizons for the capacitated lot size model with inventory bounds and stockouts ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Stochastic lot-sizing problem with inventory-bounds and constant order-capacities ⋮ A single-item economic lot-sizing problem with a non-uniform resource: Approximation ⋮ Lot sizing with bounded inventory and lost sales ⋮ A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure ⋮ A new dynamic programming algorithm for the single item capacitated dynamic lot size model

Cites Work

• Production planning with time-dependent capacity bounds
• A capacity constrained singlefacility dynamic lot-size model
• Dynamic Version of the Economic Lot Size Model
• An O(T²) 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
• Operations Research and Capacity Expansion Problems: A Survey
• Computational Complexity of the Capacitated Lot Size Problem
• Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
• Deterministic Production Planning with Concave Costs and Capacity Constraints