A fast microcomputer program for ordering using the Wagner-Whitin algorithm

The authors have developed a very fast microcomputer code (available to readers) for the Wagner-Whitin lot-sizing algorithm. Evan’s recent implementation of the same method does the same job in more time but with less storage required. Both codes demonstrate that the Wagner-Whitin algorithm, the basis against which approximate techniques are judged, is not too complex and can easily be incorporated into MRP systems.