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.
ASJC Scopus subject areas
- Computer Science(all)
- Modelling and Simulation
- Management Science and Operations Research