A comparative analysis of job scheduling algorithm

Abstract

For complexity, randomness and dynamic characteristics, job scheduling problem is well known as NP-hard, and a lot of research about scheduling algorithms was conducted in the past. In this paper, the definition and classification of job scheduling problem are firstly given, and then a systematic and complete comparative analysis of job scheduling algorithms is carried out from the aspects of origin, characteristics, computation and application. Finally, some development trends and characteristics of job scheduling algorithms are proposed.