Scheduling of computer programs for optimal machine utilization

This paper discusses the problem of developing schedules for the execution of computer programs in a batch oriented multiprogramming environment. An approximate approach to the problem is developed by heuristically reducing the dimensionality of the problem to a sequential optimization problem. The superiority of this heuristic criterion over five other commonly used criteria is shown. A numerical example is given.This paper is based upon a dissertation for the doctoral degree at the University of Illinois, Urbana-Champaign.The author is indebted for support received by the Bell Telephone Laboratories, his employer at the time when this research was performed.