Worst case performance for lot sizing heuristics
type: Item
instance of: scholarly article
title: Worst case performance for lot sizing heuristics
zbMATH Open document ID: 0477.90024
DOI: 10.1016/0377-2217(82)90176-X
author: Sven Axsäter
published in: European Journal of Operational Research
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3750650
zbMATH Keywords: dynamic lot size problem
zbMATH Keywords: worst case performance
zbMATH Keywords: Silver-Meal algorithm
zbMATH Keywords: no backlogging
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: comparison of algorithms
MaRDI profile type: Publication
cites work: Worst-Case Analysis of Heuristic Algorithms
cites work: Performance Guarantees for Scheduling Algorithms
cites work: Dynamic version of the economic lot size model
full work available at URL: 0377-2217(82)90176-x
OpenAlex ID: W2089450981
description: scientific article; zbMATH DE number 3750650