A contiuum of time-sharing scheduling algorithms

The study of time-sharing scheduling algorithms has now reached a certain maturity. One need merely look at a recent survey by McKinney in which he traces the field from the first published paper in 1964 to a succession of many papers during these past six years. Research which is currently taking place within the field is of the nature whereby many of the important theoretical questions will be sufficiently well answered in the very near future so as to question the justification for continuing extensive research much longer without first studying the overall system behavior.