| Article ID: | iaor1990560 |
| Country: | United Kingdom |
| Volume: | 17 |
| Start Page Number: | 1 |
| End Page Number: | 7 |
| Publication Date: | Apr 1990 |
| Journal: | Computers and Operations Research |
| Authors: | Cheng T.C.E. . |
In many single-machine sequencing problems the optimal job sequence is shown to be in the shortest processing time (SPT) order. This note offers a constructive proof of SPT optimality for these problems via solution of the transportation problem.