Deterministic Scheduling in Computer Systems: A Survey

Abstract

The progress of computer architecture has increased the necessity to desigrr efficient scheduling algorithms according te the types of computer systems, We survey recent results of optimtzation and approximation algorithms for deterministic models of computer seheduling,We deal with identical, uniform and unrelated parallel processor systems, and flowshop systems.Optimality criteria considered in this paper are schedule-length and mean (weighted) fiew-tirne, These are important measures for eyaluating schedules in computer systems. Results on practical algorithms such as list scheduling are emphasized.