Unlock instant, AI-driven research and patent intelligence for your innovation.

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

Pending Publication Date: 2022-02-08
HUAZHONG UNIV OF SCI & TECH
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, this method has the following disadvantages: 1. The importance of the task is only divided into three fixed levels; 2. The standard genetic algorithm is used for calculation, the solution speed is slow, and the effect is poor
However, this method has the following disadvantages: 1. The importance of the task is still only divided into three fixed levels; 2. The swarm intelligence iterative process of the genetic algorithm consumes a lot of computing time. limited
However, this method has the following disadvantages: This method is designed for the scheduling problem of IT operation and maintenance personnel with release time, and its solution goal is to minimize the maximum delay time, which is quite different from the problem solved by this patent. This method is being used In solving this patent problem, there will be a phenomenon that the calculation time is long and the effect is poor

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Minimum total cost IT operation and maintenance personnel scheduling method and system based on neighborhood structure
  • Minimum total cost IT operation and maintenance personnel scheduling method and system based on neighborhood structure
  • Minimum total cost IT operation and maintenance personnel scheduling method and system based on neighborhood structure

Examples

Experimental program
Comparison scheme
Effect test

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...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a minimum total cost IT operation and maintenance personnel scheduling method and system based on a neighborhood structure, and belongs to the field of personnel scheduling. The method comprises the following steps: under a fault processing task execution constraint and an operation and maintenance personnel service skill level constraint, establishing an operation and maintenance personnel scheduling model with the goal of minimizing the total cost; acquiring deadline, importance degree, emergency degree, unit delay cost and standard execution time of each task, acquiring skill level and unit time cost of each operation and maintenance worker, solving by adopting a variable neighborhood genetic algorithm to obtain a combination scheme of an optimal worker and task, representing an individual by adopting two segments of chromosomes with the same length, wherein each gene bit of one segment of chromosome is a task number, and each gene bit of the other segment of chromosome is an operation and maintenance personnel number for processing the corresponding task. According to the method, a genetic algorithm operator designed for minimizing the total cost and a variable neighborhood algorithm neighborhood structure are used, a good result can still be obtained in a large-scale case, and the solving speed is high.

Description

technical field [0001] The invention belongs to the field of personnel scheduling, and more specifically relates to a method and system for scheduling IT operation and maintenance personnel based on a neighborhood structure to minimize total cost. Background technique [0002] With the continuous development of my country's social economy, the depth and breadth of IT system construction are gradually strengthening, and IT operation and maintenance services have become a matter of great concern to all walks of life. How to do a good job in IT operation and maintenance services, ensure the smooth, safe and fast operation of IT assets, and deal with them in a timely manner after failures occur, so as to minimize the impact of failures is a key concern of enterprises. [0003] The characteristics of this type of problem are that the operation and maintenance personnel are heterogeneous and the tasks have different degrees of importance, urgency, and deadlines. It can be simply ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q10/06G06Q10/00G06N3/12
CPCG06Q10/06311G06Q10/20G06N3/126
Inventor 刘振元陈芮莹刘恒岭展月
Owner HUAZHONG UNIV OF SCI & TECH