Optimizing model of small-scale multi-process job schedule based on SPNs and applications in software process

摘要

Multi-process job schedule is a very difficult problem often faced by project managers. This study initially considers the problem of small-scale multi-process job schedule by using Stochastic Petri Nets (SPNs) technique. The SPNs model of multi-process job schedule is come up with in the paper, and then the basic steps of search algorithm for job schedule are put forward successively. On the bases of these works, the multi-process job schedule algorithm is given, and the schedule strategies are discussed at same time. For getting the optimal solution of the small-scale multi-process job schedule, the algorithm based on the random search strategy is proposed and the analysis of result believing rate is also discussed. The example of how using the search algorithm to plan the job based on SPNs is given at the last of paper.