Genetic algorithm for rotating workforce scheduling problem

In this paper a genetic algorithm based method for solving the rotating workforce scheduling problem is presented. Rotating workforce scheduling is a typical constraint satisfaction problem which appears in a broad range of workplaces (e.g. industrial plants). Solving this problem is of a high practical relevance. We propose a basic genetic algorithm for solving this problem. One mutation operator and three methods for crossover are presented. Finally we give computational results on benchmark examples from literature