On the development of a supervisory sequencing routine

This paper describes a self-scheduling routine which can be incorporated into the supervisory system of a computer. The problem of scheduling a number of tasks on an overloaded computer can be formulated as a linear programming problem and then solved by means of the transportation method. Priorities for both jobs and customers, as well as a nonlinear loss function for late completion, form the basis of the model.