Minimum total cost IT operation and maintenance personnel scheduling method and system based on neighborhood structure
A technology of personnel scheduling and total cost, applied in the field of personnel scheduling, can solve problems such as long calculation time, slow solution speed, excessive calculation time, etc., and achieve the effect of fast solution speed
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0096] The population size of genetic algorithm based on variable neighborhood is M, and the number of iterations is N. In this embodiment, the value of M is 50, and the value of N is 200.
[0097] Step 1: Obtain the urgency, importance, and deadline of each task, as well as the processing time for each IT operation and maintenance personnel to process each task.
[0098] Get a case of 3 employees, 8 tasks. After data preprocessing, the task deadline is D l ={10,6,10,9,7,8,5,6}, the urgency of the task is D l ={3,1,2,2,1,1,3,3}, the importance of the task is D l ={30,10,10,10,30,10,30,30}. The time taken by an employee to complete each task is represented as a matrix Among them, if the completion time of a certain task is 999, it means that the employee cannot complete this task.
[0099] Step 2: In this step, the number of individuals meeting the population size is generated as the contemporary population P 1 .
[0100] 50 individuals are generated here. figure 2 G...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


