The paper introduces a family of scheduling problems called fault-tolerant programs scheduling (FTPS). Since FTPS problems are, in general, computationally di cult, a challenge is to nd e ective 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 proces...

Although dynamic programming could ideally solve any combinatorial optimization problem, the curse of dimensionality of the search space seriously limits its application to large optimization problems. For example, only few papers in the literature have reported the application of dynamic programming to workforce scheduling problems. This paper investigates approximate dynamic programming to ta...

Planning and scheduling are areas attracting an unceasing attention of computer science community. However, despite of their similar character, planning and scheduling problems are usually handled independently using different methods and technologies. While Artificial Intelligence technology is more relevant for planning problems, Operations Research has a long tradition in studying scheduling...