Technician Scheduling in IT maintenance Service Considering Task Release Time

How to make full use of the skills of each employee in IT maintenance service, allocate limited human resources, deal quickly and effectively with the failures, this paper establishes a model of technician scheduling considering task release time in IT maintenance service. In order to solve this problem, four greedy algorithm rules are used to solve, and four neighborhood structures are designed based on the characteristics of the problem to form a variable neighborhood search algorithm. In addition, the variable neighborhood search is integrated into the genetic algorithm to solve the problem. Based on the actual case, a comparative experiment is carried out. It is concluded that incorporating the variable neighborhood search into the genetic algorithm can make the results better.