Lot-sizing procedures and a standard data set. A reconciliation of the literature

The literature contains a number of heuristic procedures for the single-level uncapacitated dynamic lot-sizing problem. In particular, many papers have introduced a new heuristic procedure and reported computational results for a particular, well-known set of test problems. This paper attempts to reconcile the apparent inconsistencies in these results. In addition, two basic approaches, which account for the most effective procedures yet discovered, are shown to be equivalent.