Schedule—constrained job scheduling in a multiprogrammed computer system

• Authors: Thomas Murray Cook
• Venue: WSC '74 Proceedings of the 7th conference on Winter simulation - Volume 2
• Year: 1974

The schedule-constrained job scheduling problem is defined as the problem of deciding what jobs should co-exist in the memory of a multiprogrammed computer to insure satisfactory schedule performance and adequate resource utilization. At the present time, the job scheduling function in many multiprogrammed computer systems is being accomplished in a suboptimal manner. In computer installations that must pay strict attention to schedule performance, the scheduling module of the operating system, because it does not consider schedule constraints, cannot be allowed to schedule jobs as they beome available for processing. Instead, human judgment must override the operating system by deciding which jobs should be input to the computer. To solve the schedule-constrained job scheduling problem, the author has developed and tested seven scheduling algorithms using a digital simulation model.