A SIMPLE LOWER-BOUND TO THE DYNAMIC ASSEMBLY PROBLEM

doi:10.1016/0377-2217(94)90088-4

1994-06-01

PRE

ATKINS, DR *

DOI：10.1016/0377-2217(94)90088-4

原文链接

原文求助

摘要

En 中文

We consider the multi-stage assembly problem where many components are assembled to make a final product. Demand is dynamic but known over a finite horizon. Optimal solutions are available but only with considerable computations. To properly evaluate heuristic solutions, good lower bounds with relatively low computational requirements are needed. We describe a very simple bound and illustrate that despite its simplicity it compares reasonably with more sophisticated bounds. The bound readily admits of many improvements and generalisations.

Keyword:

MULTILEVEL LOTSIZING

DYNAMIC DETERMINISTIC DEMAND

LOWER BOUND