An efficient algorithm for the capacitated single item dynamic lot size problem
type: Item
instance of: scholarly article
title: An efficient algorithm for the capacitated single item dynamic lot size problem
zbMATH Open document ID: 0685.90038
DOI: 10.1016/0377-2217(90)90152-2
published in: European Journal of Operational Research
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4123495
zbMATH Keywords: production scheduling
zbMATH Keywords: single item lot size problem
zbMATH Keywords: concave costs
zbMATH Keywords: worst case computational effort
zbMATH Keywords: computational results
author: ömer Kirca
MaRDI profile type: Publication
full work available at URL: 0377-2217(90)90152-2
OpenAlex ID: W2059041202
cites work: An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
cites work: Computational Complexity of the Capacitated Lot Size Problem
cites work: An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: Production planning with time-dependent capacity bounds
cites work: A capacity constrained singlefacility dynamic lot-size model
cites work: Operations Research and Capacity Expansion Problems: A Survey
cites work: Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
cites work: Dynamic version of the economic lot size model
description: scientific article; zbMATH DE number 4123495