Research On Algorithm Based On Batch Job Scheduling

Batch scheduling problem is an important research project scheduling processing. Batch job scheduling refers to the process operation in accordance with operation urgent priority degree to sequential execution which has the job assignment. As demand for batch job scheduling in various fields added, scheduling itself was gradually expanded, scheduling scheme which can be selected will be rapid growth to geometric rate.In order to improve the scheduling execution efficiency of random jobs. In this paper, a new scheduling mode, integrated scheduling mode, is constructed. And the minimum job execution tolerance algorithm is used in the model to define the job priority.The model includes the implementation of the final scheduling from the initial dispatch request to the job. The integrated scheduling mode can be divided into three parts from the architecture, which are job initialization and storage module, scheduling operation set generation module, job scheduling module.The starting point of the integrated scheduling mode design is the maximum of the force acting on the scheduling theory, and it can provide a powerful support and help for the real dispatch system.This thesis takes the banking industry batch job scheduling system as the research background, through the research of algorithm on the priority of the job redefined, and the use of specific experimental data will be scheduling algorithm scheduling algorithm and the improved traditional ratio analysis, verification of the improved algorithm with adjustable degree of. Finally the efforts were very satisfactory.