Research on the Algorithm of One Class of Fixed Job Scheduling Problem

For one class of fixed job scheduling problem,in which the available processors were limited,the processor matching-job had to be considered and minimized processor matching-job assigning cost were taken as objective.Firstly,based on the starting and completing time of the fixed job,this algorithm constructed a network time sequence figure.Secondly,the processor matching-job assigning were transformed into a netwok flow problem.Thirdly,the simulated annealing was used to design the scheduling problem algorithm.The solid example shows that the average CPU time is 32.9 seconds,the maximum error of total cost is 0.07%,the time complexity is O(M(m3+ mn)),and the space complexity is O(m2n).The results indicate that this algorithm is polynomial and feasible.