Moore has suggested an optimizing algorithm for minimizing the number of tardy jobs in single machine scheduling. This article explores the possibility of modifying the Moore's algorithm so that total tardiness is minimized while keeping the number of tardy jobs minimum. A heuristic procedure based on the Moore's original algorithm is presented and its performance is evaluated. A simple extension of the algorithm to parallel machine scheduling is also provided. © 1992.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below