A backward approach in list scheduling algorithms for multi-machine tardiness problems

List scheduling algorithms are commonly used for multi-machine scheduling problems, especially for those with precedence relationships among operations. In most list scheduling algorithms, operations are scheduled forward. This paper suggests a backward approach in which the operations are scheduled backward. It discusses some details that must be considered when applying the backward approach to problems with due dates and suggests several methods of defining parameters needed in the backward approach. Performance of this approach is tested on job shop problems and identical machine problems with several types of precedence constraints.