作者: Derek Atkins
DOI: 10.1007/BF02248583
关键词: Constant (mathematics) 、 Economics 、 Discrete time and continuous time 、 Bounding overwatch 、 Heuristics 、 Production inventory 、 Theory of computation 、 Mathematical optimization 、 Production (economics) 、 Upper and lower bounds
摘要: A review is undertaken of lower bounding methodologies for lot-sizing production/inventory models. This done both dynamic discrete time demand and continuous review, constant situations. The view taken that bounds are an essential ingredient in the evaluation heuristics when optima unknown or too computationally complex to comfortably evaluate. Several directions future research suggested.