Security-Driven Task Scheduling Based on Evolutionary Algorithm

For a class of real-time scheduling problems with the time constraints, both the time constraints and the security performance are considered in this paper. Firstly, a security-efficiency function is proposed, and a new security-driven task scheduling model is constructed based on the function. Secondly, a new selection operator is proposed, where some individuals not satisfying time constraints but having a high value of security efficiency are selected. In doing so, the diversity of the population is maintained. Thirdly, a new crossover operator and a local search operator are designed, which can enhance the exploration ability. Finally, a heuristic operator is introduced, and a new evolutionary algorithm is proposed based on all these operators. The simulation results show that the proposed algorithm is competitive in terms of success ratio, security efficiency value and overall system performance in comparison with the existing algorithms.