Computer network scheduling

This paper presents a method for solving the scheduling problem of a computer-network. There are three possible criteria for optimality: (1) Maximum number of jobs to be processed per given period. (2) Minimum idle time for each of the computers in the network, or in other words, maximum utilization. (3) Optimizing an objective function which combines 1 and 2 and which may consider additional factors.