The paper introduces a family fo scheduling problems called fault-tolerant programs scheduling. SInce FTPS problems are, in general, cimputationally difficult, a chalenge is to find effective scheduling procedures. Three evolution-based algorithms solving three basic kinds of FTPS problems have been proposed. The problems involve scheduling multiple variant tasks on multiple identical processors under time constraints. To validate the algorithms computational experiment has been carried. Experiment results show that evolution based algorithms poduce satisfactory to good solutions in reasonable time.
展开▼
