| Article ID: | iaor19982717 |
| Country: | United Kingdom |
| Volume: | 25 |
| Issue: | 2 |
| Start Page Number: | 235 |
| End Page Number: | 239 |
| Publication Date: | Apr 1997 |
| Journal: | OMEGA |
| Authors: | Koulamas Christos P. |
This paper shows that all polynomially solvable cases of the single machine total tardiness problem center around or are direct extensions of three well known results for that problem. A new polynomially solvable case for the problem is developed as well. It is also shown that two of these well known results for the single machine total tardiness problem are valid for the parallel machine total tardiness problem as well.