Dynamic scheduling of maintenance tasks under competence constraints in a distributed environment

In this article, we study the dynamic scheduling problem of maintenance tasks in a distributed environment. This environment is presented as a center of competence related to several sites. The human resources have not the same qualification, and then, the assignment decision has to take care of several parameters principally with particular competences. Our contribution concerns the optimal insertion of a new task in an existing scheduling. The proposed method is based on a combination of a local decent algorithm and the Kangaroo methodology. The objective function is to minimize the following criteria: the total weighted tardiness, the standard deviation between resources and the number of task which could have a new assignment (assigned to a new resource). The main of the algorithm is to disturb as less as possible the existing scheduling. The obtained results are validated and compared to the results obtained by static scheduling.