A genetic algorithm for task scheduling in network computing environment
Dongmei Liu, Yuanxiang Li, Mingzhao Yu · 2003
Huge task can be decomposed into some partially ordered computational sub-tasks, then resolved The general problem of task scheduling is known to be NP-hard, and genetic algorithms have received much attention as a class of robust stochastic search algorithms for task scheduling. While the construction of initial population has some limitations and most of the previous work only considers homogeneous systems, in this paper, an improved algorithm based on genetic algorithms is developed to solve the task scheduling problem in network computing environment. Finally we give the simulation results of our algorithm and conclusions.