BIT Numerical Mathematics

, Volume 13, Issue 2, pp 206–216 | Cite as

Scheduling of computer programs for optimal machine utilization

  • Arne Thesen


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.


Computer Program Computational Mathematic Sequential Optimization Optimal Machine Approximate Approach 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    James Antill and Ronald Woodhead,Critical Path Methods in Construction Practice, Second Edition, Wiley & Son, 1970.Google Scholar
  2. 2.
    R. W. Conway, W. L. Maxwell and L. W. Miller,Theory of Scheduling, Addison-Wesley, 1967.Google Scholar
  3. 3.
    Peter J. Kolesar,A Branch and Bound Algorithm for the Knapsack Problem, Management Science, Vol. 13, No. 9, pp. 723–735, May 1967.Google Scholar
  4. 4.
    Arne Thesen,A Graph Theoretical Algorithm for the Solution of Certain Constrained Combinatorial Problems, Department of Industrial Engineering, University of Wisconsin, Madison Oct. 1972.Google Scholar
  5. 5.
    Arne Thesen,Determining the Effects of Core-fragmentation Through Simulation. Paper presented at the Computer Science Conference, Ohio State University, Feb. 20–22, 1972, Columbus, Ohio. Copies available from the author.Google Scholar

Copyright information

© BIT Foundations 1973

Authors and Affiliations

  • Arne Thesen
    • 1
  1. 1.Department of Industrial EngineeringUniversity of WisconsinMadisonUSA

Personalised recommendations