Since many real-time scheduling algorithms with fault-tolerance, reported in literature, can only schedule tasks with fault-tolerant requirements, the authors present a model of hybrid real-time fault-tolerant scheduling, and proposes a hybrid scheduling algorithm for real-time tasks in this paper. The static scheduling algorithm, a part of hybrid model can schedule tasks with fault-tolerant requirements together with those without fault-tolerant requirements. An algorithm, which is used to find out the minimal number of processors needed for the real-time tasks, is also presented in this paper, so the performance of the static scheduling algorithm can be simulated and analyzed. In order to enhance the performance of the static real-time scheduling algorithm with fault-tolerance, a dynamic scheduling algorithm is studied. The performance simulation and analysis of the scheduling algorithms are presented, and experiment results show that the performance is related with the number of tasks, computation time, period and the number of processors.