WO2022100449A1 - 一种信息处理方法、设备及存储介质 - Google Patents

一种信息处理方法、设备及存储介质 Download PDF

Info

Publication number
WO2022100449A1
WO2022100449A1 PCT/CN2021/127125 CN2021127125W WO2022100449A1 WO 2022100449 A1 WO2022100449 A1 WO 2022100449A1 CN 2021127125 W CN2021127125 W CN 2021127125W WO 2022100449 A1 WO2022100449 A1 WO 2022100449A1
Authority
WO
WIPO (PCT)
Prior art keywords
identification information
target
information
duty
pieces
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2021/127125
Other languages
English (en)
French (fr)
Inventor
陈鉴镔
杨军
卢道和
陈刚
程志峰
朱嘉伟
罗海湾
李勋棋
汪晓雪
周琪
郭英亚
李兴龙
胡仲臣
周佳振
文玉茹
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
WeBank Co Ltd
Original Assignee
WeBank Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by WeBank Co Ltd filed Critical WeBank Co Ltd
Publication of WO2022100449A1 publication Critical patent/WO2022100449A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316—Sequencing of tasks or work
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23—Updating
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"

Definitions

  • the present application relates to the technical field of computer applications, and in particular, to an information processing method, device and storage medium.
  • the embodiments of the present application expect to provide an information processing method, equipment and storage medium, which solve the problem of low reliability of the current scheduling method, realize intelligent scheduling, and effectively improve the scheduling results. reliability and ensure the efficiency of scheduling.
  • an information processing method includes:
  • n pieces of identification information to be arranged wherein, each of the identification information to be arranged is used to identify a corresponding object to be arranged, and n is an integer greater than or equal to 1;
  • n target values are obtained; wherein each of the target values is used to represent the comprehensive business capability of the corresponding object to be arranged;
  • shift scheduling is performed on the n pieces of identification information to be arranged to obtain shift scheduling information.
  • an information processing device the device includes a memory, a processor, and a communication bus; wherein:
  • the memory for storing executable instructions
  • the communication bus for realizing the communication connection between the processor and the memory
  • the processor is configured to execute the information processing program stored in the memory to implement the steps of the information processing method described in any one of the above.
  • a storage medium stores an information processing program, and when the information processing program is executed by a processor, implements the steps of the information processing method according to any one of the above.
  • the information processing device after determining n pieces of identification information to be arranged, obtains a set of business parameters corresponding to each piece of identification information to be arranged to obtain n sets of business parameters, and then obtains n sets of business parameters based on the sets of n business parameters The target value is obtained, and the scheduling configuration parameters are obtained. Finally, based on the scheduling configuration parameters and the n target values, the n pieces of identification information to be arranged are arranged and combined to obtain the scheduling information. In this way, the information processing device determines the scheduling information of the objects to be arranged according to the scheduling configuration parameters set by the user scenario and the set of business parameters used to represent the business capabilities of the objects to be arranged, which solves the problem of low reliability of the current scheduling method. It realizes intelligent scheduling, effectively improves the reliability of scheduling results, and ensures the efficiency of scheduling.
  • FIG. 1 is a schematic flowchart 1 of an information processing method provided by an embodiment of the present application.
  • FIG. 2 is a second schematic flowchart of an information processing method provided by an embodiment of the present application.
  • FIG. 3 is a third schematic flowchart of an information processing method provided by an embodiment of the present application.
  • FIG. 4 is a fourth schematic flowchart of an information processing method provided by an embodiment of the present application.
  • FIG. 5 is a fifth schematic flowchart of an information processing method provided by an embodiment of the present application.
  • FIG. 6 is a sixth schematic flowchart of an information processing method provided by an embodiment of the present application.
  • FIG. 7 is a radar chart of capability labels of operation and maintenance personnel according to an embodiment of the present application.
  • FIG. 8 is a seventh schematic flowchart of an information processing method provided by an embodiment of the present application.
  • FIG. 9 is a schematic flowchart eight of an information processing method provided by an embodiment of the present application.
  • FIG. 10 is a ninth schematic flowchart of an information processing method provided by an embodiment of the present application.
  • FIG. 11 is a schematic flowchart tenth of an information processing method provided by an embodiment of the present application.
  • FIG. 12 is a schematic structural diagram of an information processing device provided by an embodiment of the present application.
  • An embodiment of the present application provides an information processing method. Referring to FIG. 1 , the method is applied to an information processing device, and the method includes the following steps:
  • Step 101 Determine n pieces of identification information to be arranged.
  • each to-be-arranged identification information is used to identify a corresponding to-be-arranged object, and n is an integer greater than or equal to 1.
  • the identification information to be arranged may be identification information used to uniquely identify the objects to be arranged, for example, the number, ID number, and name of the objects to be arranged.
  • the information processing device may be a server or a computer that has computing capabilities and communicates with other devices.
  • Step 102 Acquire a service parameter set corresponding to each identification information to be arranged, and obtain n service parameter sets.
  • each service parameter set is used to represent the service capability of the corresponding to-be-arranged object.
  • the service parameter set includes at least one set element, and each set element in the service parameter set is an aspect factor used to evaluate the service capability of the objects to be arranged, that is, the total service capability of the objects to be arranged can be determined by The set elements in the business parameter set are evaluated.
  • Step 103 Obtain n target values based on the n service parameter sets.
  • each target value is used to represent the comprehensive service capability of the corresponding object to be arranged.
  • a set of business parameters of each object to be arranged is analyzed, and a target value for representing the comprehensive business capability of each object to be arranged is determined. That is to say, assuming that n is 3, that is, there are 3 service parameter sets, namely, the service parameter set 1 corresponding to the first arrangement object, the business parameter set 2 corresponding to the second arrangement object, and the business parameter set 3 corresponding to the third arrangement object. , analyze the business parameter set 1 to obtain the target value 1 corresponding to the first arrangement object, analyze the business parameter set 2 to obtain the target value 2 corresponding to the second arrangement object, and analyze the business parameter set 3 to obtain the first The target value 3 corresponding to the three array objects.
  • Step 104 Obtain shift scheduling configuration parameters.
  • the shift scheduling configuration parameters may be pre-set by the user, or may be obtained by modification according to the current actual situation.
  • the shift configuration parameter is used to indicate the conditional requirements for the shift combination.
  • the shift configuration parameter includes at least one of the following: duty cycle, duty duration, and duty personnel requirements.
  • Step 105 Based on the shift scheduling configuration parameters and the n target values, perform a shift arrangement combination on the n pieces of identification information to be arranged to obtain shift arrangement information.
  • the n target values are analyzed to realize the shift arrangement combination of the n pieces of identification information to be arranged, and the shift arrangement information is obtained.
  • the information processing device can synthesize the objects to be arranged.
  • the target value of the business ability is used to schedule the objects to be arranged, and the business ability of the objects to be arranged is effectively and objectively considered in the process of scheduling, so that the obtained scheduling information is more reliable.
  • the information processing device after determining n pieces of identification information to be arranged, obtains a set of business parameters corresponding to each piece of identification information to be arranged to obtain n sets of business parameters, and then obtains n sets of business parameters based on the sets of n business parameters The target value is obtained, and the scheduling configuration parameters are obtained. Finally, based on the scheduling configuration parameters and the n target values, the n pieces of identification information to be arranged are arranged and combined to obtain the scheduling information. In this way, the information processing device determines the scheduling information of the objects to be arranged according to the scheduling configuration parameters set by the user scenario and the set of business parameters used to represent the business capabilities of the objects to be arranged, which solves the problem of low reliability of the current scheduling method. It realizes intelligent scheduling, effectively improves the reliability of scheduling results, and ensures the efficiency of scheduling.
  • the embodiments of the present application provide an information processing method.
  • the method is applied to an information processing device, and the method includes the following steps:
  • Step 201 Determine n pieces of identification information to be arranged.
  • each to-be-arranged identification information is used to identify a corresponding to-be-arranged object, and n is an integer greater than or equal to 1.
  • the information processing device may determine from the database the to-be-arranged identification information of the to-be-arranged objects to be arranged.
  • the identification information to be arranged in the database is continuously updated, including when new objects to be arranged are added, new identification information to be arranged will be added, or when the objects to be arranged leave, the information to be arranged in the database corresponds to will be deleted, that is, the real-time update in the database effectively ensures the accuracy of the objects to be arranged.
  • Other information other than the identification information to be arranged can also be stored in the database, such as the duty times corresponding to each identification information to be arranged, and the content of the service parameter set corresponding to the identification information to be arranged.
  • Step 202 Acquire a service parameter set corresponding to each identification information to be arranged, and obtain n service parameter sets.
  • each service parameter set is used to represent the service capability of the corresponding to-be-arranged object.
  • the information processing device may obtain a service parameter set corresponding to each identification information to be arranged from a database, and the service parameter set corresponding to each identification information to be arranged may be the corresponding object to be arranged at the initial time. , and enter the corresponding information according to the content of the business parameter set.
  • some parameter contents in the service parameter set can be continuously updated along with the work of the objects to be arranged.
  • the set elements in the business parameter set corresponding to each identification information to be arranged include at least one of the following aspects: , code capabilities, network capabilities, troubleshooting capabilities, etc.
  • Step 203 Obtain the trained target classifier.
  • the trained target classifier may be obtained by performing model training on a Support Vector Machine (SVM) algorithm.
  • SVM Support Vector Machine
  • Step 204 Predict each service parameter set separately through the target classifier to obtain n target values.
  • the target classifier is used to predict the n service parameter sets respectively, to obtain the target value corresponding to each service parameter set, thereby obtaining n target values corresponding to each of the n objects to be arranged.
  • Step 205 Obtain shift scheduling configuration parameters.
  • the shift scheduling configuration parameters may be set by default, but in special cases, a special person may temporarily change them according to actual needs.
  • a special person makes a temporary change, the identity of the special person needs to be verified to prevent everyone from being able to make changes, leading to the problem of confusion in the scheduling process, and effectively improving the interaction process between the scheduling process and the user.
  • Step 206 Determine the target duty time information and the preset duty number p required for each shift from the shift scheduling configuration parameters.
  • p is an integer greater than or equal to 1.
  • the target duty time information refers to the time information of the next duty cycle, for example, the target duty time information may be the entire month of August.
  • step 204 may be implemented through steps a11 to a12:
  • Step a11 Predict the target labels of each set element of each service parameter set through the target classifier, and obtain m target labels corresponding to each service parameter set.
  • each service parameter set includes m set elements, where m is an integer greater than or equal to 1.
  • the target label may be a rating for rating the aspect of the business capability of the object to be arranged represented by the set element Label.
  • Step a12 Determine n target values based on m target tags corresponding to each service parameter set.
  • each business parameter set includes m set elements, it means that the business capabilities of the objects to be arranged can be comprehensively evaluated from m directions. The larger m is, the better the evaluation of the business capabilities of the objects to be arranged. comprehensive.
  • Different target tags can represent different values, or different values can be obtained through different tags, and then the values corresponding to the m target tags corresponding to each service parameter set are scored to obtain the corresponding target value.
  • step a12 may be implemented through steps a121 to a122:
  • Step a121 Obtain the first reference value of each target tag among the m target tags corresponding to each service parameter set, and obtain m first reference values corresponding to each service parameter set.
  • the first reference value of each target tag may be directly represented by the level of the target tag, or may be represented by the relationship between different tags corresponding to different first reference values, such as a relationship list, or Expressed by calculation formula.
  • the first reference value may be a scoring value of the business capability of a certain aspect of the object to be ranked.
  • Step a122 Determine the accumulated value of m first reference values corresponding to each service parameter set to obtain n target values.
  • the method for calculating the accumulated value of m first reference values corresponding to each service parameter set may be implemented by a simple summation calculation method, or a weighted summation calculation method.
  • the target value may correspond to the comprehensive score of the business capability of the objects to be arranged.
  • each service parameter set may be recorded as (release capability, code capability, network capability, and troubleshooting capability), that is, each service parameter set includes 4 set elements.
  • the publishing ability of the first object to be arranged is (0.95, 0.94, 8, undergraduate)
  • the target classifier is used to predict the publishing ability (0.95, 0.94, 8, undergraduate) of the first object to be arranged, and the release ability is obtained.
  • the target label of the version capability is a 4-level label.
  • the target label of the coding ability is a 2-level label
  • the target label of the network capability is a 3-level label
  • the target label of the troubleshooting ability is a 4-level label.
  • the first reference value corresponding to the level 5 label is 5
  • the first reference value corresponding to the 2-level label is 2
  • the first reference value corresponding to the 1-level label is 1, so that the four first reference values of the first to-be-arranged object are obtained according to the order of the set elements in the set. 2, 3 and 3.
  • the 4 first reference values of the other n-1 objects to be arranged are accumulated to obtain the target values corresponding to the other n-1 objects to be arranged, thereby obtaining n target values.
  • the information processing device may choose to execute steps 207 to 209 or steps 210 to 214; wherein, if the target duty time information is the first type of time information, And if the remainder of n and p is zero, choose to execute steps 207 to 209. If the target duty time information is the first type of time information, and the remainder of n and p is i, choose to execute steps 210 to 214:
  • Step 207 If the target duty time information is the first type of time information, and the remainder of n and p is zero, sort the n pieces of identification information to be arranged according to the sorting order of the n target values from large to small, and group them on average to obtain: The identification information of the p groups to be arranged.
  • the first type of time information refers to time information without special requirements, that is, in the first type of time information, the on-duty requirements for personnel on duty are relatively low.
  • the remainder of n and p being zero indicates that the current n pieces of identification information to be arranged can just be divided into p groups.
  • Step 208 Obtain one piece of identification information to be arranged from each group of identification information to be arranged in the p groups of identification information to be arranged in sequence, and combine them to obtain a first preset number of identification information to be arranged in group q1.
  • q1 is the quotient of n and p.
  • the target values of different groups of identification information to be arranged in the P groups of identification information to be arranged are at different scoring stages, therefore, from each group of identification information to be arranged in each p groups of identification information to be arranged Obtaining a piece of identification information to be arranged in the information and combining it, the identification information to be arranged in p different score stages can be obtained, so that q1 groups of p identification information to be arranged can be obtained, q1 is the quotient of n and p, which refers to n The quotient obtained by dividing by p is q1.
  • each group of p pieces of identification information to be arranged includes the arrangement objects corresponding to the identification information to be arranged at different score stages, it is realized that people with different scores can arrange shifts and combinations, so as to facilitate the people with higher scores in the actual process. With the score as low as the person, improve the intelligence of scheduling.
  • Step 209 randomly assign each group of the first preset number of identification information to be arranged in the q1 group to each duty time period of the target duty time information, until the first preset number of the identification information to be arranged in the q1 group. After the preset number of identification information to be arranged is allocated, shift scheduling information is obtained.
  • the obtained shift scheduling information can be from 8 On duty between 8:00 and 20:00 from 1st August to 15th August.
  • Step 210 if the target duty time information is the first type of time information, and the remainder of n and p is i, the n identification information to be arranged is divided into the difference between n and i identification information to be arranged and i identification information to be arranged. information.
  • i is an integer greater than or equal to 1.
  • n and p are i, indicating that when n people are divided into p groups on average, there are still extra i people, that is, this i person is not enough for a group, and cannot be arranged for shift scheduling.
  • i is an integer greater than or equal to 1 and less than p.
  • the i pieces of identification information to be arranged may be the identification information to be arranged corresponding to the first i value with the largest value among the n target values, or may be the last i value corresponding to the smallest value among the n target values. Identification information to be arranged.
  • Step 211 Use the reference identifier to identify the i pieces of identification information to be arranged.
  • the i pieces of identification information to be arranged that have not been scheduled are marked with reference marks, so that in the next scheduling process, the objects to be arranged corresponding to the i pieces of identification information to be arranged are preferentially arranged to be on duty, That is, in the shift scheduling information obtained in the next shift scheduling process, there must be the i pieces of identification information to be arranged.
  • Step 212 sort and averagely group the target values of the difference between n and i in descending order, to obtain p groups of identification information to be arranged.
  • Step 213 Obtain one piece of identification information to be arranged from each group of identification information to be arranged in the p groups of identification information to be arranged in sequence, and combine them to obtain a first preset number of identification information to be arranged in q2 groups.
  • q2 is the quotient of the difference between n and i and p.
  • q2 is the quotient of the difference between n and i and p, which means that the quotient of the difference between n and i divided by p is q2.
  • Step 214 Randomly assign each group of the first preset number of identification information to be arranged in the q2 group to each duty time period of the target duty time information, indicating that the first preset number of identification information in the q2 group is the first to be arranged. After the preset number of identification information to be arranged is allocated, shift scheduling information is obtained.
  • steps 215 to 218 or steps 219 to 222 may also be performed:
  • Step 215 If the target duty time information is the second type of time information, determine x third reference values greater than or equal to a preset value from the n target values.
  • x is an integer greater than or equal to 1 and less than or equal to n.
  • the second type of time information refers to that in the time information, the requirements for the on-duty objects are relatively high, and the on-duty personnel are required to have strong business processing capabilities.
  • the preset value may be an experience value obtained according to a large number of experiments, or may be an experience value set by the user. Since the larger the target value is, the stronger the business capability of the arrangement objects is. Therefore, a target value greater than or equal to a preset value can be determined from the n target values, and x third reference values can be obtained.
  • Step 216 If the remainder of x and p is zero, randomly and equally group the x pieces of identification information to be arranged corresponding to the x third reference values to obtain p to-be-arranged identification information.
  • Step 217 Obtain one piece of identification information to be arranged from each group of identification information to be arranged in the p groups of identification information to be arranged in sequence, and combine them to obtain a first preset number of identification information to be arranged in q3 groups.
  • q3 is the quotient of x and p.
  • q3 is the quotient of x and p, which means that the quotient of dividing x by p is q3.
  • Step 218 randomly assign each group of the first preset number of identification information to be arranged in the q3 groups to each duty time period of the target duty time information, indicating that the first preset number of identification information in the q3 group is the first to be arranged. After the preset number of identification information to be arranged is allocated, shift scheduling information is obtained.
  • Step 219 if the remainder j of x and p is not zero, sort the x third reference values in descending order of values to obtain the sorted x third reference values.
  • Step 220 select the first x and j difference third reference values from the sorted x third reference values, and identify the x and j difference values corresponding to the x and j difference third reference values to be arranged.
  • the information is randomly and equally grouped to obtain p groups of identification information to be arranged.
  • Step 221 Obtain one piece of identification information to be arranged from each group of identification information to be arranged in the p groups of identification information to be arranged in sequence, and combine them to obtain a first preset number of identification information to be arranged in q4 groups.
  • q4 is the quotient of the difference between x and j and p.
  • q4 is the quotient of the difference between x and j and p, which means that the quotient of the difference between x and j divided by p is q4.
  • Step 222 Randomly assign each group of the first preset number of identification information to be arranged in the q4 groups to each duty time period of the target duty time information in turn, indicating that the first preset number of identification information in the q4 group is the first to be arranged. After the preset number of identification information to be arranged is allocated, shift scheduling information is obtained.
  • the duty cycle of the target duty time information can also be determined, taking days as the duty unit as an example for illustration, and looking at the target duty time belonging to the second type of time information It takes a few days for the information, assuming that it takes 3 days, and the corresponding number of people on duty per day is 2, the corresponding total of 6 people is required to arrange shifts, then when x is greater than 6, from the sorted x third reference value Select the first 6 third reference values, and randomly group the identification information to be arranged corresponding to the first 6 third reference values into 3 groups, and randomly arrange these 3 groups to be on duty in these 3 days.
  • x is less than 6, the x individuals can be scheduled for repeated cycles.
  • step 201 may be implemented by the following steps: if the user identification information includes target user identification information with a reference identification, determine that the user identification information and the target user identification information are determined to be n Identification information to be arranged.
  • step 210 can be realized by the following steps: if the target duty time information is the first type time information, and the remainder of n and p is i, randomly select i user identification information from the user identification information as i to be arranged. identification information, and use the target user identification information and the user identification information except the i pieces of identification information to be arranged in the target user identification information as the difference between n and i pieces of identification information to be arranged.
  • the determined n pieces of identification information to be arranged include identification information to be arranged that was not arranged and combined in the previous cycle, that is to say, in the process of this shift arrangement, some of the n pieces of identification information to be arranged
  • the identification information to be arranged appears twice. Exemplarily, assuming that the identification information to be arranged A was not on duty in the last scheduling process and was marked with a reference mark, then in the n identification information to be arranged determined this time, the identification information to be arranged appears twice, that is, in the n identification information to be arranged. During this scheduling process, A may need to be on duty twice.
  • the information processing device performs steps 201 to 209 , or after steps 201 to 206 and 210 to 214 , is also used to perform steps 223 to 227 , or Referring to FIG. 5 , the information processing device performs steps 201 to 206 and 215 to 218, or steps 201 to 206 and 219 to 222, and is also used to perform steps 223 to 227:
  • Step 223 Send the scheduling information to the user terminal through the target application.
  • the target application is used for notifying the shift scheduling information to the corresponding objects to be arranged.
  • the target application may be an instant communication tool, that is, the information processing device may send the generated shift scheduling information to a chat group where n identification information to be arranged exists, so that the n user terminals are all The identification information to be arranged may be received, or the shift scheduling information may be sent to the user terminals corresponding to the n identification information to be arranged, respectively, in the form of an email.
  • Step 224 Based on the shift scheduling information, determine the on-duty user identification information of the next on-duty time period adjacent to the current on-duty time period.
  • Step 225 Send prompt information to the user terminal corresponding to the on-duty user identification information through the target application program.
  • the prompt information is used to prompt the on-duty object in the next on-duty time period to be on-duty in the next on-duty time period.
  • the information processing device will send prompt information separately according to the shift information to remind the on-duty personnel in the next on-duty time period to be on duty in the next on-duty time period, which can prevent the on-duty personnel on duty in the next on-duty time period from forgetting will be on duty.
  • step 225 after the information processing device performs step 225, it may choose to perform step 226 or step 227. If the confirmation information sent by the user terminal corresponding to the on-duty user identification information is received, step 226 is selected to be executed; if the confirmation information sent by the user terminal corresponding to the on-duty user identification information is not received, step 227 is selected to be executed:
  • Step 226 If the confirmation information sent by the user terminal corresponding to the on-duty user identification information is received, based on the confirmation information, count the on-duty times of the on-duty object corresponding to the on-duty user identification information.
  • the confirmation information is used to indicate that the on-duty object has determined to be on duty in the next on-duty time period.
  • Step 227 if the confirmation information sent by the user terminal corresponding to the on-duty user identification information is not received, continue to send prompt information to the user terminal corresponding to the on-duty user identification information through the target application program.
  • the on-duty object on duty in the next on-duty time period after receiving the prompt information, the on-duty object on duty in the next on-duty time period must send confirmation information to the information processing device, otherwise the information processing device will keep sending prompt information, which can ensure the next on-duty time period.
  • the on-duty object on duty sees the prompt message and knows that it will be on duty in the next on-duty time period.
  • the information processing device may further perform steps a13 to a15:
  • Step a13 If a display instruction sent by the display device for instructing to display the radar map of the tag corresponding to the target identification information is received, the m target tags corresponding to the target identification information are acquired in response to the display instruction.
  • Step a14 Based on the m target labels corresponding to the target identification information, generate a target label radar map corresponding to the target identification information.
  • Step a15 sending the target tag radar image to the display device.
  • the target tag radar chart is used to display at the display area of the display device.
  • the label radar chart is used to visually display the business capabilities of the objects to be arranged corresponding to the target identification information.
  • an embodiment of the present application provides a flowchart of an information processing method, as shown in FIG. 6 , which specifically includes the following steps:
  • Step b11 Receive the relevant indicators of the operation and maintenance personnel input by the front end.
  • the relevant indicators of the operation and maintenance personnel inputted by the front end may be business quality indicators, that is, the aforementioned business parameter set, which may at least include the following aspects: a) Release capability: release success rate, database (DateBase, DB) operation Success rate, relevant working years, education. b) Code capability: working years, number of projects in charge, DB pressure measurement capability. c) Network ability: working years, network certificate. d) Troubleshooting ability: fault level and corresponding recovery time, working years.
  • step b12 the trained linear classifier is used to predict the relevant indicators of the operation and maintenance personnel, and the capability labels of the relevant indicators of the operation and maintenance personnel are obtained.
  • the historical sample data is obtained, the model training is performed on the SVM algorithm, and the trained linear classifier is obtained.
  • the historical sample data includes historical related indicators and corresponding labels.
  • the specific process of acquiring historical sample data may include: acquiring historical related indicators, normalizing the historical related indicators, and manually processing the normalized historical related indicators.
  • the indicators are labeled, or unsupervised clustering is performed according to the K clustering algorithm, and the result of the clustering is used as the label.
  • different numbers can be used to express, for example, primary school education is 1, secondary school education is 2, technical secondary school education is 3, high school education is 4, college education is 5, university education is 6, and master degree is 6. 7. The doctoral degree is 8. In this way, the normalization of the education index can be realized.
  • the relevant indicators of each operation and maintenance personnel are manually labeled, for example, according to Each relevant indicator is divided into four levels from high to bottom.
  • the release ability of an operation and maintenance personnel the success rate of release is 0.95
  • the success rate of DB operation is 0.94
  • the operation and maintenance work life is 8 years
  • the degree is undergraduate
  • the manual labeling is marked as level 4, for another
  • the ability of operation and maintenance personnel to release version the success rate of version release is 0.5
  • the success rate of DB operation is 0.7
  • the operation and maintenance work life is 1 year.
  • the accuracy of manual labeling is relatively high, but it is more labor-intensive.
  • the K clustering algorithm can be used to perform cluster analysis on the normalized historical related indicators, where the value of K is 4 , four clustering results can be obtained. Among them, obtaining labels through the K clustering algorithm can save a lot of manpower and quickly obtain label results.
  • the radar chart of the ability label of the operation and maintenance personnel can be displayed on the front-end display page.
  • the capability label radar chart of a certain operation and maintenance personnel may be shown in FIG. 7 , wherein, as shown in FIG. 7 , the negative half-axis of the horizontal axis in the radar chart is used to represent the network capability label level of the operation and maintenance personnel.
  • the positive half-axis of the horizontal axis is used to indicate the label level of the operation and maintenance personnel's release ability
  • the negative half-axis of the vertical axis is used to indicate the label level of the operation and maintenance personnel's troubleshooting ability
  • the negative half-axis of the vertical axis is used to indicate the operation and maintenance personnel.
  • the code competency tag level of the person is only a schematic illustration, and does not make any limitation, and the capability label level of the operation and maintenance personnel can also be identified with reference to other radar charts.
  • the front end may be the aforementioned display device, or may be a user terminal.
  • the display device and the user terminal may be the same.
  • Step b13 Obtain the ability score of the operation and maintenance personnel according to the ability labels of the relevant indicators of the operation and maintenance personnel.
  • each operation and maintenance personnel can obtain multiple capability labels.
  • the capability labels of a certain operation and maintenance personnel include: the release capability label is 3, the code capability label is 2, and the network capability label is 3 , the ability label for troubleshooting problems is 4, so that the value of the ability label of the operation and maintenance personnel is simply accumulated to obtain 12, and 12 is determined as the ability score of the operation and maintenance personnel.
  • the formula can also be used To calculate the ability score z of the operation and maintenance personnel, which is converted into a percentage system.
  • a is used to identify the release capability label
  • b is used to identify the code capability label
  • c is used to identify the network capability label
  • d is used to identify the troubleshooting capability label
  • len(a+b+c+d) is used to indicate each
  • Step b14 according to the ability score of the operation and maintenance personnel, and according to the duty requirements, schedule the operation and maintenance personnel to obtain a duty list.
  • the duty requirement can be two people on duty each time.
  • the duty personnel are divided into two groups E group and F group according to the level of ability score.
  • the competency scores were all higher than those of the duty officers in Group F.
  • Step b15 Send the duty schedule to the instant chat software group in advance.
  • the staff on duty are included in the instant chat software group.
  • the obtained duty list can be made into a picture, and converted into base64 format, so as to be sent by the robot of the instant chat tool.
  • the form of pictures is better than the form of text, which is intuitive and easy to read.
  • the on-duty list is regularly sent to the WeChat group one day in advance for reminders, the on-duty information for the next day can be sent to the instant chat group in the form of text, and the on-duty personnel are required to confirm.
  • each person can be coded, for example, from 0 to N, and the code, name, phone number, position, responsible system, quality label, quality score, whether the value has been recorded in the database class information.
  • the above-mentioned values such as the success rate of release and DB operation can be recorded in the application to be maintained. In this way, when the above-mentioned values of the success rate of release and DB operation are required, they can be directly obtained from the application to be maintained. obtained from the program. After the ability label and ability score of each operation and maintenance personnel are calculated, they can be stored in the MySQL database. At the same time, the quality index can be updated after each shift, for example, the ability label and ability score can be updated again. calculate. When a new employee joins or an old employee leaves, the data stored in the MySQL database is updated through the front-end interface or instant chatbot.
  • the information processing device after determining n pieces of identification information to be arranged, obtains a set of business parameters corresponding to each piece of identification information to be arranged to obtain n sets of business parameters, and then obtains n sets of business parameters based on the sets of n business parameters The target value is obtained, and the scheduling configuration parameters are obtained. Finally, based on the scheduling configuration parameters and the n target values, the n pieces of identification information to be arranged are arranged and combined to obtain the scheduling information. In this way, the information processing device determines the scheduling information of the objects to be arranged according to the scheduling configuration parameters set by the user scenario and the set of business parameters used to represent the business capabilities of the objects to be arranged, which solves the problem of low reliability of the current scheduling method.
  • Predicting the set of business parameters through the trained target classifier that is, predicting the set of business parameters through self-learning ability, ensures the accuracy of the obtained target value, and effectively realizes the ability of people with strong ability in each shift process.
  • a shift scheduling plan for people with weak abilities and can realize intelligent special duty arrangements according to special scenarios, effectively ensuring the duty requirements in special scenarios.
  • the embodiments of the present application provide an information processing method, which is applied to an information processing device.
  • the method includes the following steps:
  • Step 301 Determine n pieces of identification information to be arranged.
  • each to-be-arranged identification information is used to identify a corresponding to-be-arranged object, and n is an integer greater than or equal to 1.
  • Step 302 Acquire a service parameter set corresponding to each identification information to be arranged, and obtain n service parameter sets.
  • each service parameter set is used to represent the service capability of the corresponding to-be-arranged object.
  • the acquired service parameter set corresponding to each to-be-arranged identification information may be a set of values obtained by quantizing the parameter used to represent the capability of the to-be-arranged object.
  • n sets of business parameters are obtained. That is, each set element in the n service parameter sets is a quantized value.
  • Step 303 Determine the second reference value of each set element in each service parameter set, and obtain m second reference values corresponding to each service parameter set.
  • each service parameter set includes m set elements, where m is an integer greater than or equal to 1.
  • Step 304 Determine m weight coefficients corresponding to each of the m set elements.
  • Step 305 Perform weighted summation processing on m weight coefficients and m second reference values corresponding to each service parameter set to obtain n target values.
  • Step 306 Obtain shift scheduling configuration parameters.
  • Step 307 Determine the target duty time information and the preset duty number p required for each shift from the shift scheduling configuration parameters.
  • p is an integer greater than or equal to 1.
  • step 303 may be implemented by steps c11 to c12:
  • Step c11 Determine the product value of the hyperbolic tangent value of each set element in each service parameter set and each corresponding set element.
  • the hyperbolic tangent value of each set element can be calculated by the formula to be calculated.
  • Step c12 Determine the product of the product value and the preset score value to obtain m second reference values corresponding to each service parameter set.
  • the second reference value can be calculated by the formula to calculate, where x1 is each set element in each service parameter set, each corresponding set element here is a numerical value, and 100 is a preset score value, that is, the corresponding full score when the preset score system is a percentage system value, when the default score is 10, you can replace 100 with a full score of 10.
  • the information processing device may choose to execute steps 308 to 310 or steps 311 to 315; wherein, if the target duty time information is the first type of time information, And if the remainder of n and p is zero, choose to execute steps 308 to 310. If the target duty time information is the first type of time information, and the remainder of n and p is i, choose to execute steps 311 to 315:
  • Step 308 If the target duty time information is the first type of time information, and the remainder of n and p is zero, sort the n pieces of identification information to be arranged in descending order of the n target values and group them on average to obtain: The identification information of the p groups to be arranged.
  • Step 309 Obtain one piece of identification information to be arranged from each group of identification information to be arranged in the p groups of identification information to be arranged, and combine them to obtain a first preset number of identification information to be arranged in group q1.
  • q1 is the quotient of n and p.
  • Step 310 Randomly assign each group of the first preset number of identification information to be arranged in the q1 group to each duty time period of the target duty time information, until the first preset number of the identification information to be arranged in the q1 group. After the preset number of identification information to be arranged is allocated, shift scheduling information is obtained.
  • Step 311 if the target duty time information is the first type of time information, and the remainder of n and p is i, the n identification information to be arranged is divided into the difference between n and i identification information to be arranged and i identification information to be arranged. information.
  • i is an integer greater than or equal to 1.
  • Step 312 Use the reference identifier to identify the i pieces of identification information to be arranged.
  • Step 313 Sort and averagely group the target values according to the difference between n and i in descending order to obtain p groups of identification information to be arranged.
  • Step 314 Obtain one piece of identification information to be arranged from each group of identification information to be arranged in the p groups of identification information to be arranged in sequence, and combine them to obtain a first preset number of identification information to be arranged in q2 groups.
  • q2 is the quotient of the difference between n and i and p.
  • Step 315 randomly assign each group of the first preset number of identification information to be arranged in the q2 group to each duty time period of the target duty time information, indicating that the first preset number of identification information in the q2 group is the first to be arranged. After the preset number of identification information to be arranged is allocated, shift scheduling information is obtained.
  • steps 316 to 319 or steps 320 to 323 may also be performed:
  • Step 316 If the target duty time information is the second type of time information, determine x third reference values greater than or equal to a preset value from the n target values.
  • x is an integer greater than or equal to 1 and less than or equal to n.
  • Step 317 If the remainder of x and p is zero, randomly and equally group the x pieces of identification information to be arranged corresponding to the x third reference values to obtain p to-be-arranged identification information.
  • Step 318 Obtain one piece of identification information to be arranged from each group of identification information to be arranged in the p groups of identification information to be arranged in sequence, and combine them to obtain a first preset number of identification information to be arranged in q3 groups.
  • q3 is the quotient of x and p.
  • Step 319 randomly assign each group of the first preset number of identification information to be arranged in the q3 groups to each duty time period of the target duty time information, indicating that the first preset number of identification information in the q3 group is the first to be arranged. After the preset number of identification information to be arranged is allocated, shift scheduling information is obtained.
  • Step 320 If the remainder j of x and p is not zero, sort the x third reference values in descending order of value, and obtain the sorted x third reference values.
  • Step 321 select the first x and j difference third reference values from the sorted x third reference values, and identify the x and j difference values corresponding to the x and j difference third reference values to be arranged.
  • the information is randomly and equally grouped to obtain p groups of identification information to be arranged.
  • Step 322 Obtain one piece of identification information to be arranged from each group of identification information to be arranged in the p groups of identification information to be arranged in sequence, and combine them to obtain a first preset number of identification information to be arranged in q4 groups.
  • q4 is the quotient of the difference between x and j and p.
  • Step 323 randomly assigning each group of the first preset number of identification information to be arranged in the q4 group of identification information to be arranged to each duty time period of the target duty time information in turn, indicating that the first preset number of identification information in the q4 group is the first to be arranged. After the preset number of identification information to be arranged is allocated, shift scheduling information is obtained.
  • step 301 may be implemented by the following steps: if the user identification information includes target user identification information with a reference identification, determine that the user identification information and the target user identification information are determined to be n Identification information to be arranged.
  • step 311 can be realized by the following steps: if the target duty time information is the first type time information, and the remainder of n and p is i, randomly select i user identification information from the user identification information as i to be arranged. identification information, and use the target user identification information and the user identification information except the i pieces of identification information to be arranged in the target user identification information as the difference between n and i pieces of identification information to be arranged.
  • the information processing device after the information processing device performs steps 301 to 310 , steps 301 to 307 , and steps 311 to 315 , it is also used to perform steps 324 to 328 ; or refer to As shown in FIG. 11 , the information processing device is also used to perform steps 324 to 328 after steps 301 to 307 and 316 to 319, or after steps 301 to 307 and 320 to 323:
  • Step 324 Send the scheduling information to the user terminal through the target application.
  • the target application is used for notifying the shift scheduling information to the corresponding objects to be arranged.
  • Step 325 Based on the shift scheduling information, determine the on-duty user identification information of the next on-duty time period adjacent to the current on-duty time period.
  • Step 326 Send prompt information to the user terminal corresponding to the on-duty user identification information through the target application program.
  • the prompt information is used to prompt the on-duty object in the next on-duty time period to be on-duty in the next on-duty time period.
  • step 326 after the information processing device performs step 326, it may choose to perform step 327 or step 328. If the confirmation information sent by the user terminal corresponding to the on-duty user identification information is received, step 327 is selected to be executed; if the confirmation information sent by the user terminal corresponding to the on-duty user identification information is not received, step 328 is selected to be executed:
  • Step 327 If the confirmation information sent by the user terminal corresponding to the on-duty user identification information is received, based on the confirmation information, count the on-duty times of the on-duty object corresponding to the on-duty user identification information.
  • the confirmation information is used to indicate that the on-duty object has determined to be on duty in the next on-duty time period.
  • Step 328 If the confirmation information sent by the user terminal corresponding to the user identification information on duty is not received, continue to send the prompt information to the user terminal corresponding to the user identification information on duty through the target application program.
  • the embodiment of the present application provides an application embodiment, obtaining relevant indicators of the operation and maintenance personnel through step b11, and normalizing the relevant indicators of the operation and maintenance personnel by using the corresponding normalization method at step b12. Then, obtain the reference score of each sub-indicator in each relevant indicator through the formula in step c12, and then perform a weighted average on each sub-indicator in each relevant indicator to obtain the total score of the relevant indicator, and finally evaluate each sub-indicator for each relevant indicator.
  • the total scores of the relevant indicators are summed and calculated to obtain the total ability score of the operation and maintenance personnel, and then the execution steps after obtaining the total ability score of the operation and maintenance personnel may refer to steps b14 and b15, which will not be described in detail here.
  • the information processing device after determining n pieces of identification information to be arranged, obtains a set of business parameters corresponding to each piece of identification information to be arranged to obtain n sets of business parameters, and then obtains n sets of business parameters based on the sets of n business parameters The target value is obtained, and the scheduling configuration parameters are obtained. Finally, based on the scheduling configuration parameters and the n target values, the n pieces of identification information to be arranged are arranged and combined to obtain the scheduling information. In this way, the information processing device determines the scheduling information of the objects to be arranged according to the scheduling configuration parameters set by the user scenario and the set of business parameters used to represent the business capabilities of the objects to be arranged, which solves the problem of low reliability of the current scheduling method.
  • the embodiments of the present application provide an information processing device.
  • the information processing device 4 may include: a processor 41, a memory 42, and a communication bus 43, wherein:
  • memory 42 for storing executable instructions
  • a communication bus 43 used to realize the communication connection between the processor 41 and the memory 42;
  • the processor 41 is used for executing the information processing program stored in the memory 42 to realize the following steps:
  • each identification information to be arranged is used to identify a corresponding object to be arranged, and n is an integer greater than or equal to 1;
  • each set of business parameters is used to represent the business capability of the corresponding object to be arranged;
  • n target values are obtained; wherein, each target value is used to represent the comprehensive business capability of the corresponding object to be arranged;
  • the n pieces of identification information to be arranged are arranged and combined to obtain the scheduling information.
  • the processor when configured to perform the steps based on n service parameter sets to obtain n target values, the following steps may be used to achieve:
  • each business parameter set is predicted separately, and n target values are obtained.
  • the processor when the processor is configured to perform the step of predicting each service parameter set separately through the target classifier, and obtaining n target values, the following steps can be used to achieve:
  • each service parameter set includes m set elements, and m is greater than or equal to or an integer equal to 1;
  • n target values are determined.
  • the processor is configured to perform the step of predicting the target label of each set element of each service parameter set through the target classifier, and after obtaining m target labels corresponding to each service parameter set, further use To perform the following steps:
  • a radar map of the target label corresponding to the target identification information is generated;
  • the target tag radar image is used to display at the display area of the display device.
  • the processor when the processor is configured to perform the steps to determine n target values based on m target tags corresponding to each service parameter set, the following steps may be used to achieve:
  • the accumulated value of m first reference values corresponding to each service parameter set is determined to obtain n target values.
  • the processor is configured to perform the following steps when obtaining n target values based on n service parameter sets:
  • each service parameter set includes m set elements, and m is greater than or equal to an integer of 1;
  • a weighted summation process is performed on the m weighting coefficients and the m second reference values corresponding to each service parameter set to obtain n target values.
  • the processor when the processor is configured to perform the step of determining the second reference value of each set element in each service parameter set, and obtain m second reference values corresponding to each service parameter set, the processor is configured to perform the following steps: step:
  • the product of the product value and the preset score value is determined to obtain m second reference values corresponding to each service parameter set.
  • the processor is configured to perform the step of arranging and combining n pieces of identification information to be arranged based on the scheduling configuration parameters and n target values, and obtaining the scheduling information can be achieved by the following steps:
  • the target duty time information is the first type of time information, and the remainder of n and p is zero, sort the n pieces of identification information to be arranged in descending order of the n target values, and group them equally to obtain p groups to be arranged.
  • the processor is further configured to perform the following steps:
  • the n pieces of identification information to be arranged are divided into the difference of n and i pieces of identification information to be arranged and i pieces of identification information to be arranged; wherein , i is an integer greater than or equal to 1;
  • the i pieces of identification information to be arranged are identified by using the reference identification;
  • the target values are sorted in descending order and averagely grouped to obtain p groups of identification information to be arranged;
  • the processor is further configured to perform the following steps:
  • the target duty time information is the second type of time information, determine x third reference values greater than or equal to the preset value from the n target values; wherein, x is an integer greater than or equal to 1 and less than or equal to n;
  • the x pieces of identification information to be arranged corresponding to the x third reference values are randomly and equally grouped to obtain p to-be-arranged identification information;
  • the processor is further configured to perform the following steps:
  • the processor when the processor is configured to execute the steps to determine the n pieces of identification information to be arranged, the following steps may be used to implement:
  • the user identification information includes target user identification information with a reference identification, it is determined that the user identification information and the target user identification information are n pieces of identification information to be arranged;
  • the target duty time information is the first type of time information
  • the remainder of n and p is i
  • the n pieces of identification information to be arranged are divided into the difference between n and i, the identification information to be arranged and the identification information to be arranged i. information, including:
  • the target duty time information is the first type of time information
  • the remainder of n and p is i
  • the user identification information other than the i pieces of identification information to be arranged in the information is used as the difference between n and i pieces of identification information to be arranged.
  • the processor execution step is based on the shift scheduling configuration parameters and n target values, performs shift arrangement and combination on the n pieces of identification information to be arranged, and after obtaining the shift arrangement information, is also used to perform the following steps:
  • the shift scheduling information is sent to the user terminal through the target application program; wherein, the target application program is used for notifying the shift scheduling information to the corresponding objects to be arranged.
  • the processor is further configured to execute the following steps:
  • the confirmation information sent by the user terminal corresponding to the on-duty user identification information is received, based on the confirmation information, count the on-duty times of the on-duty object corresponding to the on-duty user identification information; wherein, the confirmation information is used to indicate that the on-duty object has determined to be on duty in the next on-duty time period ;
  • the target application program continues to send prompt information to the user terminal corresponding to the on-duty user identification information.
  • the information processing device after determining n pieces of identification information to be arranged, obtains a set of business parameters corresponding to each piece of identification information to be arranged to obtain n sets of business parameters, and then obtains n sets of business parameters based on the sets of n business parameters The target value is obtained, and the scheduling configuration parameters are obtained. Finally, based on the scheduling configuration parameters and the n target values, the n pieces of identification information to be arranged are arranged and combined to obtain the scheduling information. In this way, the information processing device determines the scheduling information of the objects to be arranged according to the scheduling configuration parameters set by the user scenario and the set of business parameters used to represent the business capabilities of the objects to be arranged, which solves the problem of low reliability of the current scheduling method.
  • the embodiments of the present application provide a computer-readable storage medium, referred to as a storage medium for short, and the computer-readable storage medium stores one or more programs, and the one or more programs can be stored by one or more programs.
  • the processor executes to implement the implementation process of the information processing method provided by the embodiments corresponding to FIGS. 1 to 6 and FIGS. 8 to 11 , which will not be repeated here.
  • Embodiments of the present application provide an information processing method, device, and storage medium.
  • the method includes: determining n pieces of identification information to be arranged; wherein each of the identification information to be arranged is used to identify a corresponding object to be arranged, and n is an integer greater than or equal to 1; obtain a service parameter set corresponding to each of the to-be-arranged identification information, and obtain n service parameter sets; wherein, each of the service parameter sets is used to represent the corresponding service of the to-be-arranged object capability; based on the n sets of the business parameters, obtain n target values; wherein, each of the target values is used to represent the comprehensive business capability of the corresponding object to be arranged; obtain shift configuration parameters; based on the shift configuration The parameters and n of the target values are arranged and combined on the n pieces of the identification information to be arranged to obtain the scheduling information.
  • the scheduling configuration parameters set by the information processing device according to the user scene and the parameters used to represent the objects to be arranged are obtained.
  • the set of business parameters of the business capability is used to determine the scheduling information of the objects to be arranged, which solves the problem of low reliability of the current scheduling method, realizes the intelligent scheduling, effectively improves the reliability of the scheduling results, and ensures the reliability of the scheduling. Scheduling efficiency.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • General Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Educational Administration (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

一种信息处理方法，该方法包括：确定n个待排列标识信息（101）；其中，每一所述待排列标识信息用于标识对应的一个待排列对象，n为大于或等于1的整数；获取每一所述待排列标识信息对应的业务参数集合，得到n个业务参数集合（102）；其中，每一所述业务参数集合用于表示对应的所述待排列对象的业务能力；基于n个所述业务参数集合，得到n个目标值（103）；其中，每一所述目标值用于表示对应的待排列对象的综合业务能力；获取排班配置参数（104）；基于所述排班配置参数和n个所述目标值，对n个所述待排列标识信息进行排班组合，得到排班信息（105）。还公开了一种信息处理设备和存储介质。

Description

一种信息处理方法、设备及存储介质
相关申请的交叉引用
本申请基于申请号为202011270938.7、申请日为2020年11月13日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本申请涉及计算机应用技术领域，尤其涉及一种信息处理方法、设备及存储介质。
背景技术
随着计算机技术的飞速发展，越来越多的技术应用在金融领域，传统金融业正在逐步向金融科技(Fintech)转变，但由于金融行业的安全性和实时性要求，也对技术提出了更高的要求。随着各行各业的发展需求，大部分岗位均需要值班需求。目前常用的排班方式主要是通过专人根据自己的经验或者随意对待值班人员进行排班安排，得到排班表，或者是通过随机算法对待值班人员进行排班，得到排班表。
但是目前常用的排班方式中，由于不能确定每一值班人员的技能水平，因此不可以客观地根据值班人员的技能水平对进行排班，导致通过目前的排班方式得到的排班结果的可靠性较低，排班方式效率较低，造成排班过程智能化程度较低的问题。
发明内容
为解决上述技术问题，本申请实施例期望提供一种信息处理方法、设备及存储介质，解决了目前的排班方式可靠性较低的问题，实现了智能化排班，有效提高了排班结果的可靠性，并保证了排班效率。
本申请的技术方案是这样实现的：
第一方面，一种信息处理方法，所述方法包括：
确定n个待排列标识信息；其中，每一所述待排列标识信息用于标识对应的一个待排列对象，n为大于或等于1的整数；
获取每一所述待排列标识信息对应的业务参数集合，得到n个业务参数集合；其中，每一所述业务参数集合用于表示对应的所述待排列对象的业务能力；
基于n个所述业务参数集合，得到n个目标值；其中，每一所述目标值用于表示对应的待排列对象的综合业务能力；
获取排班配置参数；
基于所述排班配置参数和n个所述目标值，对n个所述待排列标识信息进行排班组合，得到排班信息。
第二方面，一种信息处理设备，所述设备包括存储器、处理器和通信总线；其中：
所述存储器，用于存储可执行指令；
所述通信总线，用于实现所述处理器和所述存储器之间的通信连接；
所述处理器，用于执行所述存储器中存储的信息处理程序，实现如上述任一项所述的信息处理方法的步骤。
第三方面，一种存储介质，所述存储介质上存储有信息处理程序，所述信息处理程序被处理器执行时实现如上述任一项所述的信息处理方法的步骤。
本申请实施例中，信息处理设备通过确定n个待排列标识信息后，获取每一待排列标识信息对应的业务参数集合，得到n个业务参数集合，然后基于n个业务参数集合，得到n个目标值，并获取排班配置参数，最后基于排班配置参数和n个目标值，对n个待排列标识信息进行排班组合，得到排班信息。这样，信息处理设备根据用户场景设置的排班配置参数和用于表示待排列对象的业务能力的业务参数集合来确定对待排列对象的排班信息，解决了目前的排班方式可靠性较低的问题，实现了智能化排班，有效提高了排班结果的可靠性，并保证了排班效率。
附图说明
图1为本申请实施例提供的信息处理方法的流程示意图一；
图2为本申请实施例提供的信息处理方法的流程示意图二；
图3为本申请实施例提供的信息处理方法的流程示意图三；
图4为本申请实施例提供的信息处理方法的流程示意图四；
图5为本申请实施例提供的信息处理方法的流程示意图五；
图6为本申请实施例提供的信息处理方法的流程示意图六；
图7为本申请实施例提供的一种运维人员的能力标签雷达图；
图8为本申请实施例提供的信息处理方法的流程示意图七；
图9为本申请实施例提供的信息处理方法的流程示意图八；
图10为本申请实施例提供的信息处理方法的流程示意图九；
图11为本申请实施例提供的信息处理方法的流程示意图十；
图12为本申请实施例提供的一种信息处理设备的结构示意图。
具体实施方式
为了使本申请的目的、技术方案和优点更加清楚，下面将结合附图对本申请作进一步地详细描述，所描述的实施例不应视为对本申请的限制，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其它实施例，都属于本申请保护的范围。
除非另有定义，本文所使用的所有的技术和科学术语与属于本申请的技术领域的技术人员通常理解的含义相同。本文中所使用的术语只是为了描述本申请实施例的目的，不是旨在限制本申请。
本申请的实施例提供一种信息处理方法，参照图1所示，方法应用于信息处理设备，该方法包括以下步骤：
步骤101、确定n个待排列标识信息。
其中，每一待排列标识信息用于标识对应的一个待排列对象，n为大于或等于1的整数。
在本申请实施例中，待排列标识信息可以是用于唯一标识待排列对象的标识信息，例如可以是待排列对象的编号、身份证号码、姓名等。信息处理设备可以是服务器或计算机等具备计算能力和与其他设备进行通信的设备。
步骤102、获取每一待排列标识信息对应的业务参数集合，得到n个业务参数集合。
其中，每一业务参数集合用于表示对应的待排列对象的业务能力。
在本申请实施例中，业务参数集合包括至少一个集合元素，业务参数集合中的每一集合元素是用于评价待排列对象的业务能力的一个方面因素，即待排列对象的总业务能力可以通过业务参数集合中的集合元素来评价。
步骤103、基于n个业务参数集合，得到n个目标值。
其中，每一目标值用于表示对应的待排列对象的综合业务能力。
在本申请实施例中，对每一待排列对象的业务参数集合进行分析，确定用于表示每一待排列对象综合业务能力的目标值。也就是说，假设n为3，即有3个业务参数集合分别为第一排列对象对应的业务参数集合1、第二排列对象对应的业务参数集合2和第三排列对象对应的业务参数集合3时，对业务参数集合1进行分析，得到第一排列对象对应的目标值1，对业务参数集合2进行分析，得到第二排列对象对应的目标值2，对业务参数集合3进行分析，得到第三排列对象对应的目标值3。
步骤104、获取排班配置参数。
在本申请实施例中，排班配置参数可以是预先用户设置的，也可以是根据当前实际情况进行修改得到的。排班配置参数用于表示对排班组合的条件要求，例如排班配置参数至少包括以下之一：值班周期、值班时长、值班人员要求等。
步骤105、基于排班配置参数和n个目标值，对n个待排列标识信息进行排班组合，得到排班信息。
在本申请实施例中，根据排班配置参数，对n个目标值进行分析来实现对n个待排列标识信息的排班组合，得到排班信息，这样，信息处理设备可以待排列对象的综合业务能力的目标值来对待排列对象进行排班，有效客观地在排班过程中考虑了待排列对象的业务能力，使得到的排班信息比较可靠。
本申请实施例中，信息处理设备通过确定n个待排列标识信息后，获取每一待排列标识信息对应的业务参数集合，得到n个业务参数集合，然后基于n个业务参数集合，得到n个目标值，并获取排班配置参数，最后基于排班配置参数和n个目标值，对n个待排列标识信息进行排班组合，得到排班信息。这样，信息处理设备根据用户场景设置的排班配置参数和用于表示待排列对象的业务能力的业务参数集 合来确定对待排列对象的排班信息，解决了目前的排班方式可靠性较低的问题，实现了智能化排班，有效提高了排班结果的可靠性，并保证了排班效率。
基于前述实施例，本申请的实施例提供一种信息处理方法，参照图2所示，方法应用于信息处理设备，该方法包括以下步骤：
步骤201、确定n个待排列标识信息。
其中，每一待排列标识信息用于标识对应的一个待排列对象，n为大于或等于1的整数。
在本申请实施例中，信息处理设备可以从数据库中确定将要进行排班的待排列对象的待排列标识信息。其中，数据库中的待排列标识信息是不断进行更新得到的，包括当有新的待排列对象加入时，会增加新的待排列标识信息，或有待排列对象离开时，数据库中的待排列信息对应的会进行删除，即数据库中的实时更新有效地保证了待排列对象的准确性。在数据库中还可以存储除待排列标识信息外的其他信息，例如每一待排列标识信息对应的值班次数、以及待排列标识信息对应的业务参数集合内容等。
步骤202、获取每一待排列标识信息对应的业务参数集合，得到n个业务参数集合。
其中，每一业务参数集合用于表示对应的待排列对象的业务能力。
在本申请实施例中，信息处理设备可以是从数据库中获取每一待排列标识信息对应的业务参数集合的，每一待排列标识信息对应的业务参数集合可以是对应的待排列对象在初始时，根据业务参数集合内容自己输入相应的信息。其中，业务参数集合中的一些参数内容可以随着待排列对象的工作进行不断的更新。以信息处理设备进行排班时，针对的是运维人员排班应用场景为例进行说明时，每一待排列标识信息对应的业务参数集合中的集合元素至少包括以下方面之一：发版能力、代码能力、网络能力、排查问题能力等。
步骤203、获取已训练好的目标分类器。
在本申请实施例中，已训练好的目标分类器可以是通过对支持向量机(Support Vector Machine，SVM)算法进行模型训练得到的。
步骤204、通过目标分类器，对每一业务参数集合分别进行预测，得到n个目标值。
在本申请实施例中，通过目标分类器对n个业务参数集合分别进行预测，得到每一业务参数集合对应的目标值，从而得到n个待排列对象各自对应的n个目标值。
步骤205、获取排班配置参数。
在本申请实施例中，排班配置参数可以是默认设置好的，但在特殊情况下，可以根据实际需求，由专人进行暂时的改动。在专人进行暂时的改动时，需要对专人 的身份进行验证，以防止所有人均可改动，导致排班过程混乱的问题，有效提高了排班过程与用户之间的交互过程。
步骤206、从排班配置参数中确定目标值班时间信息和每次值班需要的预设值班人数p。
其中，p为大于或等于1的整数。
在本申请实施例中，目标值班时间信息指的是下一值班周期所在的时间信息，例如目标值班时间信息可以为8月一整月。
基于前述实施例，在本申请其他实施例中，步骤204可以通过步骤a11～a12来实现：
步骤a11、通过目标分类器，分别预测每一业务参数集合的每一集合元素的目标标签，得到每一业务参数集合对应的m个目标标签。
其中，每一业务参数集合包括m个集合元素，m为大于或等于1的整数。
在本申请实施例中，由于每一集合元素代表的是待排列对象的业务能力的一方面，因此，目标标签可以是对该集合元素所代表的待排列对象的业务能力的方面进行评级的评级标签。这样，对每一业务参数集合中的每一集合元素均通过目标分类器进行预测后，得到每一业务参数集合中每一集合元素的目标标签。
步骤a12、基于每一业务参数集合对应的m个目标标签，确定n个目标值。
在本申请实施例中，由于每一业务参数集合包括m个集合元素，表示可以从m个方向来对待排列对象的业务能力进行综合评价，m越大，表明对待排列对象的业务能力的评价更全面。不同的目标标签可以代表不同的值，或者可以通过不同的标签得到不同的值，然后对每一业务参数集合对应的m个目标标签对应的值进行分值，得到对应的目标值。
在本申请其他实施例中，步骤a12可以通过步骤a121～a122来实现：
步骤a121、获取每一业务参数集合对应的m个目标标签中每一目标标签的第一参考值，得到每一业务参数集合对应的m个第一参考值。
在本申请实施例中，每一目标标签的第一参考值可以直接用目标标签的等级来表示，或者可以通过不同标签对应不同的第一参考值的关系例如是关系列表来表示，或者还可以通过计算公式来表示。第一参考值可以是对待排列对象的某一方面的业务能力的打分分值。
步骤a122、确定每一业务参数集合对应的m个第一参考值的累加值，得到n个目标值。
在本申请实施例中，计算每一业务参数集合对应的m个第一参考值的累加值的方法可以采用简单的求和计算方法来实现，也可以采用加权求和计算方法来实现。目标值对应的可以是待排列对象的业务能力的综合分值。
示例性的，每一业务参数集合可以记为(发版能力，代码能力，网络能力，排查问题能力)，即每一业务参数集合包括4个集合元素。假设第一待排列对象的发版能力为(0.95，0.94，8，本科)，通过目标分类器，对第一待排列对象的发版能力(0.95，0.94，8，本科)进行预测，得到发版能力的目标标签为4级标签，同理，假设得到代码能力的目标标签为2级标签，得到网络能力的目标标签为3级标签，得到排查问题能力的目标标签为4级标签。假设不同等级标签对应的第一参考值与标签等级对应，5级标签对应的第一参考值为5，4级标签对应的第一参考值为4，3级标签对应的第一参考值为3，2级标签对应的第一参考值为2，1级标签对应的第一参考值为1，这样得到第一待排列对象的4个第一参考值根据集合中集合元素的顺序依次为4、2、3和3。将第一待排列对象的4个第一参考值进行累加，记为4+2+3+3＝12。同理，对其他n-1个待排列对象的4个第一参考值进行累加，得到其他n-1个待排列对象各自对应的目标值，从而得到n个目标值。
基于前述实施例，在本申请其他实施例中，信息处理设备执行步骤201～206之后，可以选择执行步骤207～209或者步骤210～214；其中，若目标值班时间信息为第一类型时间信息，且n与p的余数为零，选择执行步骤207～209，若目标值班时间信息为第一类型时间信息，且n与p的余数为i，选择执行步骤210～214：
步骤207、若目标值班时间信息为第一类型时间信息，且n与p的余数为零，将n个待排列标识信息按照n个目标值从大到小的排序顺序进行排序并平均分组，得到p组待排列标识信息。
在本申请实施例中，第一类型时间信息指的是没有特殊要求的时间信息，即在第一类型时间信息内的对值班的人员的值班要求较低。n与p的余数为零表明当前的n个待排列标识信息刚好可以分成p组。将n个目标值按照从大到小的排序顺序进行排序后，根据目标值的排序顺序对n个待排列标识信息进行排序，然后对排序后的n个待排列标识信息进行平均分组，得到p组待排列标识信息。
步骤208、依次分别从p组待排列标识信息中的每一组待排列标识信息中获取一个待排列标识信息进行组合，得到q1组第一预设数量个待排列标识信息。
其中，q1为n与p的商值。
在本申请实施例中，由于P组待排列标识信息中不同组待排列标识信息的目标值在不同的分值阶段，因此，从每一p组待排列标识信息中的每一组待排列标识信息中获取一个待排列标识信息进行组合，可以得到p个不同分值阶段的待排列标识信息，从而可以得到q1组p个待排列标识信息,q1为n与p的商值，指的是n除以p得到的商为q1。这样，由于每一组p个待排列标识信息中包括不同分值阶段的待排列标识信息对应的排列对象，实现了分值不同的人进行排班组合，以便于实际过程中分值高的人带分值低到人，提高排班的智能性。
步骤209、依次随机分配q1组第一预设数量个待排列标识信息中的每一组第一预设数量个待排列标识信息至目标值班时间信息的每一值班时间段，直至q1组第一预设数量个待排列标识信息分配完毕，得到排班信息。
在本申请实施例中，假设目标指标时间信息为8月时，对应的每一值班时间段为每天的8:00至20:00时，q1为15，则得到的排班信息可以是从8月1日至8月15日的8:00至20:00之间的值班情况。
步骤210、若目标值班时间信息为第一类型时间信息，且n与p的余数为i，将n个待排列标识信息分为n与i的差值个待排列标识信息和i个待排列标识信息。
其中，i为大于或等于1的整数。
在本申请实施例中，n与p的余数为i表明将n个人平均分成p组时，还有多余的i个人，即这i个人又不够一组人，不能安排进行排班。其中，i为大于或等于1，且小于p的整数。
需说明的是，这i个待排列标识信息可以是n个目标值中值最大的前i个值对应的待排列标识信息，或者可以是n个目标值中值最小的后i个值对应的待排列标识信息。
步骤211、采用参考标识对i个待排列标识信息进行标识。
在本申请实施例中，将未进行排班的i个待排列标识信息采用参考标识进行标识，以在下一次排班过程中，优先安排这i个待排列标识信息对应的待排列对象进行值班，即在下一次排班过程得到的排班信息中，必须有这i个待排列标识信息。
步骤212、按照n与i的差值个目标值从大到小的排序顺序进行排序并平均分组，得到p组待排列标识信息。
步骤213、依次分别从p组待排列标识信息中的每一组待排列标识信息中获取一个待排列标识信息进行组合，得到q2组第一预设数量个待排列标识信息。
其中，q2为n与i的差值与p的商值。
在本申请实施例中，q2为n与i的差值与p的商值指的是n与i的差值除以p的商为q2。
步骤214、依次随机分配q2组第一预设数量个待排列标识信息中的每一组第一预设数量个待排列标识信息至目标值班时间信息的每一值班时间段，指示q2组第一预设数量个待排列标识信息分配完毕，得到排班信息。
基于前述实施例，在本申请其他实施例中，在信息处理设备执行步骤201～206之后，参照图3所示，还可以执行步骤215～218或者步骤219～222：
步骤215、若目标值班时间信息为第二类型时间信息，从n个目标值中确定大于或等于预设值的x个第三参考值。
其中，x为大于或等于1，且小于或等于n的整数。
在本申请实施例中，第二类型时间信息指的是在该时间信息内，对值班对象的要求较高，需要值班人员的业务处理能力较强。预设值可以是一个根据大量实验得到的经验值，也可以是用户自己设定的一个经验值。由于目标值越大，表明排列对象的业务能力越强，因此可以从n个目标值中确定大于或等于预设值的目标值，得到x个第三参考值。
步骤216、若x与p的余数为零，将x个第三参考值对应的x个待排列标识信息随机平均分组，得到p待排列标识信息。
步骤217、依次分别从p组待排列标识信息中的每一组待排列标识信息中获取一个待排列标识信息进行组合，得到q3组第一预设数量个待排列标识信息。
其中，q3为x与p的商值。
在本申请实施例中，q3为x与p的商值指的是x除以p的商为q3。
步骤218、依次随机分配q3组第一预设数量个待排列标识信息中的每一组第一预设数量个待排列标识信息至目标值班时间信息的每一值班时间段，指示q3组第一预设数量个待排列标识信息分配完毕，得到排班信息。
步骤219、若x与p的余数j不为零，对x个第三参考值按照值从大到小的顺序进行排序，得到排序后的x个第三参考值。
步骤220、从排序后的x个第三参考值中选取前x与j差值个第三参考值，并将x与j差值个第三参考值对应的x与j差值个待排列标识信息随机平均分组，得到p组待排列标识信息。
步骤221、依次分别从p组待排列标识信息中的每一组待排列标识信息中获取一个待排列标识信息进行组合，得到q4组第一预设数量个待排列标识信息。
其中，q4为x与j差值与p的商值。
在本申请实施例中，q4为x与j差值与p的商值指的是x与j差值除以p的商为q4。
步骤222、依次随机分配q4组第一预设数量个待排列标识信息中的每一组第一预设数量个待排列标识信息至目标值班时间信息的每一值班时间段，指示q4组第一预设数量个待排列标识信息分配完毕，得到排班信息。
在本申请实施例中，若x与p的余数j不为零，还可以确定目标值班时间信息的值班周期，以天为值班单位为例进行说明，看属于第二类型时间信息的目标值班时间信息需要几天，假设需要3天，对应的每天的值班人数为2人时，对应的总共需要6人进行排班即可，那么在x大于6时，从排序后的x个第三参考值中选取前6个第三参考值，并对这前6个第三参考值对应的待排列标识信息进行随机分组为3组，并随机将这3组安排在这3天进行值班即可。在x小于6时，可以将这个x个人进行重复循环排班。
基于前述实施例，在本申请其他实施例中，步骤201可以由以下步骤来实现：若用户标识信息中包括具有参考标识的目标用户标识信息，确定用户标识信息和目标用户标识信息确定为n个待排列标识信息。
对应的，步骤210可以由以下步骤来实现：若目标值班时间信息为第一类型时间信息，且n与p的余数为i，从用户标识信息中随机选取i个用户标识信息作为i个待排列标识信息，并将目标用户标识信息和用户标识信息中除i个待排列标识信息外的用户标识信息作为n与i的差值个待排列标识信息。
在本申请实施例中，确定的n个待排列标识信息中包括上一周期未排列组合到的待排列标识信息，也就是说在此次排班过程中，n个待排列标识信息中某些待排列标识信息会出现两次。示例性的，假设A待排列标识信息在上次排班过程中未值班，被标识有参考标识，则在此次确定的n个待排列标识信息中A待排列标识信息出现两次，即在此次排班过程中，A可能需要值两次班。
基于前述实施例，在本申请其他实施例中，参照图4所示，信息处理设备执行步骤201～209，或者步骤201～206和步骤210～214之后，还用于执行步骤223～227，或者参照图5所示，信息处理设备执行步骤201～206和步骤215～218，或者步骤201～206和步骤219～222之后，还用于执行步骤223～227：
步骤223、通过目标应用程序发送排班信息至用户终端。
其中，目标应用程序用于将排班信息通知至对应的待排列对象。
在本申请实施例中，目标应用程序可以是即时通信工具，即信息处理设备可以将生成的排班信息发送至n个待排列标识信息均存在的一个聊天群中，这样，n个用户终端均可接收到该待排列标识信息，或者通过邮件的形式分别将排班信息发送至这n个待排列标识信息对应的用户终端。
步骤224、基于排班信息，确定当前值班时间段相邻的下一值班时间段的值班用户标识信息。
步骤225、通过目标应用程序发送提示信息至值班用户标识信息对应的用户终端。
其中，提示信息用于提示下一值班时间段的值班对象需在下一值班时间内值班。
在本申请实施例中，信息处理设备会根据排班信息单独发送提示信息提醒下一值班时间段的值班人员将在下一值班时间段内值班，这样可以防止下一值班时间段内值班的人员忘了将要值班。
在本申请实施例中，信息处理设备执行步骤225之后，可以选择执行步骤226或者步骤227。若接收到值班用户标识信息对应的用户终端发送的确认信息，选择执行步骤226，若未接收到值班用户标识信息对应的用户终端发送的确认信息，选择执行步骤227：
步骤226、若接收到值班用户标识信息对应的用户终端发送的确认信息，基于确认信息，统计值班用户标识信息对应的值班对象的值班次数。
其中，确认信息用于指示值班对象已确定下一值班时间段值班。
步骤227、若未接收到值班用户标识信息对应的用户终端发送的确认信息，通过目标应用程序继续发送提示信息至值班用户标识信息对应的用户终端。
在本申请实施例中，下一值班时间段值班的值班对象在接收到提示信息后，必须发送确认信息至信息处理设备，不然信息处理设备会一直发送提示信息，这样能够确保下一值班时间段值班的值班对象看到了提示信息，知晓将在下一值班时间段值班。
基于前述实时实例，在本申请其他实施例中，信息处理设备在执行步骤a11之后的任意一个步骤后，信息处理设备还可以执行步骤a13～a15：
步骤a13、若接收到显示设备发送的用于指示显示目标标识信息对应的标签雷达图的显示指令，响应显示指令，获取目标标识信息对应的m个目标标签。
步骤a14、基于目标标识信息对应的m个目标标签，生成目标标识信息对应的目标标签雷达图。
步骤a15、发送目标标签雷达图至显示设备。
其中，目标标签雷达图用于显示在显示设备的显示区域处。
在本申请实施例中，标签雷达图用于能够直观的展示目标标识信息对应的待排列对象的业务能力。
基于前述实施例，本申请实施例提供一种信息处理方法的流程图，参照图6所示，具体包括以下步骤：
步骤b11、接收前端输入的运维人员的相关指标。
其中，前端输入的运维人员的相关指标可以是业务素质指标，即前述业务参数集合，至少可以包括以下的几个方面：a)发版能力:发版成功率，数据库(DateBase，DB)操作成功率，相关工作年限，学历。b)代码能力:工作年限，负责过的项目数，DB的压测能力。c)网络能力:工作年限，网络的证书。d)排查问题能力:故障等级及相应恢复时间，工作年限。
步骤b12、采用已训练好的线性分类器对运维人员的相关指标进行预测，得到运维人员的各相关指标的能力标签。
其中，获取历史样本数据，对SVM算法进行模型训练，得到已训练好的线性分类器。其中，历史样本数据包括历史相关指标及对应的标签，具体获取历史样本数据的过程可以包括：获取历史相关指标，对历史相关指标进行归一化处理，用户人为对归一化处理后的历史相关指标打标签，或者通过根据K聚类算法进行无监督 的聚类，聚类的结果作为标签。
在对历史相关指标和前端输入的运维人员的相关指标均需要进行归一化处理，可以采用公式y＝(x-x min)/(x max-x min)来实现归一化处理，其中，x min为某一指标中的最小值，x max为某一指标中的最大值。在对学历进行表示时，可以采用不同的数字来表示，例如小学学历为1，中学学历为2，中专学历为3，高中学历为4，大专学历为5，大学学历为6，硕士学历为7，博士学历为8,这样，即可实现对学历指标进行归一化处理。
采用用户人为对归一化处理后的历史相关指标打标签时，示例性的，将相关指标映射在0至1范围内时，人为的对各运维人员的相关指标进行打标签处理，例如按照从高到底将每一相关指标分为四级。比如某一运维人员的发版能力，在发版成功率为0.95，DB操作成功率为0.94，运维工作年限8年，学历为本科时，人为标注即打标签为4级，针对另一运维人员的发版能力，在发版成功率为0.5,DB操作成功率为0.7,运维工作年限为1年，学历本科时，人为标注即打标签1级。其中，人为打标签的准确率相对较高，但是比较费人力。
通过根据K聚类算法进行无监督的聚类，聚类的结果作为标签时，可以通过K聚类算法对归一化处理后的历史相关指标进行聚类分析，其中，K的取值为4时，即可得到4种聚类结果。其中，通过K聚类算法得到标签，能够节省大量人力，并能快速得到标签结果。
在一些应用场景中，得到运维人员的能力标签后，可以在前端显示页面上展示运维人员的能力标签雷达图。示例性的，某一运维人员的能力标签雷达图可以参照图7所示，其中，如图7所示，雷达图中的横轴的负半轴用于表示运维人员的网络能力标签等级，横轴的正半轴用于表示运维人员的发版能力标签等级，纵轴的负半轴用于表示运维人员的排查问题能力标签等级，纵轴的负半轴用于表示运维人员的代码能力标签等级。其中，图7仅示意说明，并不做任何限定，还可以参照其他雷达图标识运维人员的能力标签等级。
需说明的是，前端可以是前述的显示设备，也可以是用户终端。显示设备和用户终端可以相同。
步骤b13、根据运维人员的各相关指标的能力标签，得到运维人员的能力分数。
其中，在经过步骤b12后，每一运维人员均可得到多个能力标签，比如某一运维人员的能力标签包括：发版能力标签为3，代码能力标签为2，网络能力标签为3，排查问题能力标签为4，这样该运维人员的能力标签的值进行简单累加，得到12，将12确定为该运维人员的能力分数。在其他一些应用场景中，也可以采用公式
Figure PCTCN2021127125-appb-000001
来计算该运维人员的能力分数z，即换算为百分制。其中， a用于标识发版能力标签，b用于标识代码能力标签，c用于网络能力标签，d用于标识排查问题能力标签，len(a+b+c+d)用于表示每个标签等级均为最高级假设5级时的总和，即len(a+b+c+d)＝20，这样，得到的百分制为60分。
步骤b14、根据运维人员的能力分数，按照值班要求，对运维人员进行排班，得到值班表。
其中，值班要求可以是每次值班要求两个人，为了保证每次值班的人员的随机性，按照能力分数高低，将值班人员分为两组E组和F组，其中E组中的值班人员的能力分数全部高于F组中的值班人员的能力分数。在一般场景下值班时，从E组中随机出一人和F组中随机出一人进行组合，然后从E组剩余的人中随机出一人和F组剩余的人中随机出一人进行组合，如此重复，直至E组和F组中的人均组合完毕，并按照值班时间将得到的组合存于新的值班表中。
对于特殊场景下的值班：
1、可以通过配置权限，只有专人才有权限修改值班表。
2、专人发送相应的指令，比如“show roster”查询值班信息，“update name time”,修改某人为某时间值班，“change importance time to time”,将排班修改为重要排班，这时后端将优先安排能力分数高的同事进行排班。“change frequently_failures time to time”,这时优先安排排查问题能力强的同事进行排班。
步骤b15、将值班表提前发送至即时聊天软件群中。
其中，即时聊天软件群中包括所有值班人员。在一些应用场景中，在按天值班时，可以每次提前一天定时将值班表发到微信群里进行提醒，对应的值班人员需进行确认，不然会反复发送提醒。其中，将值班表的发送至即时聊天软件群中时，可以将得到的值班表制成图片，并转换成base64格式，以通过即时聊天工具的机器人发送。此时，图片的形式优于文字的形式，直观易读。另外，提前一天定时将值班表发到微信群里进行提醒时，可以以文字的形式将后一天的值班信息发送到即时聊天群里，并要求值班人员进行确认。
其中，在本申请实施例中，可以对每个人进行编码，例如从0开始，一直到N，并在数据库存入编码、姓名、电话、职位、负责系统、素质标签，素质分数、是否值过班等信息。
需说明的是，上述发版成功率，DB操作成功率等数值可以记录在维护的应用程序中，这样，在需要上述发版成功率，DB操作成功率等数值，可以直接从需维护的应用程序中获取。将每一个运维人员的能力标签和能力分数计算完毕后，可以存入MySQL数据库中，同时每隔一段时间例如可以是每一次值班结束后对素质指标进行更新，对能力标签和能力分数进行再次计算。当有新员工加入或者老员工离职时，通过前端界面或者即时聊天机器人对MySQL数据库中存储的数据进行更新。
需要说明的是，本实施例中与其它实施例中相同步骤和相同内容的说明，可以参照其它实施例中的描述，此处不再赘述。
本申请实施例中，信息处理设备通过确定n个待排列标识信息后，获取每一待排列标识信息对应的业务参数集合，得到n个业务参数集合，然后基于n个业务参数集合，得到n个目标值，并获取排班配置参数，最后基于排班配置参数和n个目标值，对n个待排列标识信息进行排班组合，得到排班信息。这样，信息处理设备根据用户场景设置的排班配置参数和用于表示待排列对象的业务能力的业务参数集合来确定对待排列对象的排班信息，解决了目前的排班方式可靠性较低的问题，实现了智能化排班，有效提高了排班结果的可靠性，并保证了排班效率。通过已训练好的目标分类器对业务参数集合进行预测，即通过自学习能力对业务参数集合进行预测，保证了得到的目标值的准确性，有效实现了每次值班过程中能力强的人带能力弱的人的排班方案，并可以实现根据特殊场景智能进行特殊值班安排，有效保证了特殊场景下的值班要求。
基于前述实施例，本申请的实施例提供一种信息处理方法，该方法应用于信息处理设备，参照图8所示，该方法包括以下步骤：
步骤301、确定n个待排列标识信息。
其中，每一待排列标识信息用于标识对应的一个待排列对象，n为大于或等于1的整数。
步骤302、获取每一待排列标识信息对应的业务参数集合，得到n个业务参数集合。
其中，每一业务参数集合用于表示对应的待排列对象的业务能力。在本申请实施例中，获取的每一待排列标识信息对应的业务参数集合可以是对用于表示待排列对象能力的参数进行量化后的值的集合。示例性的，从数据库中获取每一待排列对象的以下参数集合：{发版能力，代码能力，网络能力，排查问题能力}＝{(发版成功率，DB操作成功率，相关工作年限，学历)，(负责过的项目数，DB的压测能力)，(网络证书)，(解决故障等级，相应恢复时间)}，然后对获取到的集合参数中的每一集合元素进行量化，例如将学历确定为对应的数值表示值，网络证书确定为对应的数值表示值，解决故障等级确定为对应的数值表示值等，然后基于n个待排列对象的上述参数集合得到的数值集合，进行归一化处理，得到n个业务参数集合。也就是说，n个业务参数集合中的每一集合元素是量化后的数值。
步骤303、确定每一业务参数集合中每一集合元素的第二参考值，得到每一业务参数集合对应的m个第二参考值。
其中，每一业务参数集合包括m个集合元素，m为大于或等于1的整数。
步骤304、确定m个集合元素各自对应的m个权重系数。
步骤305、对m个权重系数和每一业务参数集合对应的m个第二参考值进行加权求和处理，得到n个目标值。
步骤306、获取排班配置参数。
步骤307、从排班配置参数中确定目标值班时间信息和每次值班需要的预设值班人数p。
其中，p为大于或等于1的整数。
基于前述实施例，在本申请其他实施例中，步骤303可以由步骤c11～c12来实现：
步骤c11、确定每一业务参数集合中每一集合元素的双曲正切值与对应的每一集合元素的乘积值。
在本申请实施例中，每一集合元素的双曲正切值可以通过公式
Figure PCTCN2021127125-appb-000002
来计算得到。
步骤c12、确定乘积值与预设分制数值的乘积，得到每一业务参数集合对应的m个第二参考值。
在本申请实施例中，第二参考值可以通过公式
Figure PCTCN2021127125-appb-000003
来计算得到，其中，x1为每一业务参数集合中的每一集合元素，此处对应的每一集合元素为数值，100是预设分制数值，即预设分制为百分制时对应的满分值，在预设分制为10分制时，可以将100替换为满分10。
基于前述实施例，在本申请其他实施例中，信息处理设备执行步骤301～307之后，可以选择执行步骤308～310或者步骤311～315；其中，若目标值班时间信息为第一类型时间信息，且n与p的余数为零，选择执行步骤308～310，若目标值班时间信息为第一类型时间信息，且n与p的余数为i，选择执行步骤311～315：
步骤308、若目标值班时间信息为第一类型时间信息，且n与p的余数为零，将n个待排列标识信息按照n个目标值从大到小的排序顺序进行排序并平均分组，得到p组待排列标识信息。
步骤309、依次分别从p组待排列标识信息中的每一组待排列标识信息中获取一个待排列标识信息进行组合，得到q1组第一预设数量个待排列标识信息。
其中，q1为n与p的商值。
步骤310、依次随机分配q1组第一预设数量个待排列标识信息中的每一组第一预设数量个待排列标识信息至目标值班时间信息的每一值班时间段，直至q1组第一 预设数量个待排列标识信息分配完毕，得到排班信息。
步骤311、若目标值班时间信息为第一类型时间信息，且n与p的余数为i，将n个待排列标识信息分为n与i的差值个待排列标识信息和i个待排列标识信息。
其中，i为大于或等于1的整数。
步骤312、采用参考标识对i个待排列标识信息进行标识。
步骤313、按照n与i的差值个目标值从大到小的排序顺序进行排序并平均分组，得到p组待排列标识信息。
步骤314、依次分别从p组待排列标识信息中的每一组待排列标识信息中获取一个待排列标识信息进行组合，得到q2组第一预设数量个待排列标识信息。
其中，q2为n与i的差值与p的商值。
步骤315、依次随机分配q2组第一预设数量个待排列标识信息中的每一组第一预设数量个待排列标识信息至目标值班时间信息的每一值班时间段，指示q2组第一预设数量个待排列标识信息分配完毕，得到排班信息。
基于前述实施例，在本申请其他实施例中，在信息处理设备执行步骤301～307之后，参照图9所示，还可以执行步骤316～319或者步骤320～323：
步骤316、若目标值班时间信息为第二类型时间信息，从n个目标值中确定大于或等于预设值的x个第三参考值。
其中，x为大于或等于1，且小于或等于n的整数。
步骤317、若x与p的余数为零，将x个第三参考值对应的x个待排列标识信息随机平均分组，得到p待排列标识信息。
步骤318、依次分别从p组待排列标识信息中的每一组待排列标识信息中获取一个待排列标识信息进行组合，得到q3组第一预设数量个待排列标识信息。
其中，q3为x与p的商值。
步骤319、依次随机分配q3组第一预设数量个待排列标识信息中的每一组第一预设数量个待排列标识信息至目标值班时间信息的每一值班时间段，指示q3组第一预设数量个待排列标识信息分配完毕，得到排班信息。
步骤320、若x与p的余数j不为零，对x个第三参考值按照值从大到小的顺序进行排序，得到排序后的x个第三参考值。
步骤321、从排序后的x个第三参考值中选取前x与j差值个第三参考值，并将x与j差值个第三参考值对应的x与j差值个待排列标识信息随机平均分组，得到p组待排列标识信息。
步骤322、依次分别从p组待排列标识信息中的每一组待排列标识信息中获取一个待排列标识信息进行组合，得到q4组第一预设数量个待排列标识信息。
其中，q4为x与j差值与p的商值。
步骤323、依次随机分配q4组第一预设数量个待排列标识信息中的每一组第一预设数量个待排列标识信息至目标值班时间信息的每一值班时间段，指示q4组第一预设数量个待排列标识信息分配完毕，得到排班信息。
基于前述实施例，在本申请其他实施例中，步骤301可以由以下步骤来实现：若用户标识信息中包括具有参考标识的目标用户标识信息，确定用户标识信息和目标用户标识信息确定为n个待排列标识信息。
对应的，步骤311可以由以下步骤来实现：若目标值班时间信息为第一类型时间信息，且n与p的余数为i，从用户标识信息中随机选取i个用户标识信息作为i个待排列标识信息，并将目标用户标识信息和用户标识信息中除i个待排列标识信息外的用户标识信息作为n与i的差值个待排列标识信息。
基于前述实施例，在本申请其他实施例中，参照图10所示，信息处理设备执行步骤301～310、步骤301～307和步骤311～315之后，还用于执行步骤324～328；或者参照图11所示，信息处理设备执行步骤301～307和步骤316～319，或者步骤301～307和步骤320～323之后，还用于执行步骤324～328：
步骤324、通过目标应用程序发送排班信息至用户终端。
其中，目标应用程序用于将排班信息通知至对应的待排列对象。
步骤325、基于排班信息，确定当前值班时间段相邻的下一值班时间段的值班用户标识信息。
步骤326、通过目标应用程序发送提示信息至值班用户标识信息对应的用户终端。
其中，提示信息用于提示下一值班时间段的值班对象需在下一值班时间内值班。
在本申请实施例中，信息处理设备执行步骤326之后，可以选择执行步骤327或者步骤328。若接收到值班用户标识信息对应的用户终端发送的确认信息，选择执行步骤327，若未接收到值班用户标识信息对应的用户终端发送的确认信息，选择执行步骤328：
步骤327、若接收到值班用户标识信息对应的用户终端发送的确认信息，基于确认信息，统计值班用户标识信息对应的值班对象的值班次数。
其中，确认信息用于指示值班对象已确定下一值班时间段值班。
步骤328、若未接收到值班用户标识信息对应的用户终端发送的确认信息，通过目标应用程序继续发送提示信息至值班用户标识信息对应的用户终端。
基于前述实施例，本申请实施例提供一种应用实施例，通过步骤b11得到运维人员的相关指标，并采用步骤b12处对应的归一化方法对运维人员的相关指标进行 归一化处理后，通过步骤c12中的公式得到每一相关指标中的每一子指标的参考分数，然后对每一相关指标中的每一子指标进行加权平均得到该相关指标的总分，最后对每一相关指标的总分进行求和计算，得到该运维人员的能力总分，然后得到该运维人员的能力总分后的执行步骤可以参照步骤b14和步骤b15，此处不再详细赘述。
需要说明的是，本实施例中与其它实施例中相同步骤和相同内容的说明，可以参照其它实施例中的描述，此处不再赘述。
本申请实施例中，信息处理设备通过确定n个待排列标识信息后，获取每一待排列标识信息对应的业务参数集合，得到n个业务参数集合，然后基于n个业务参数集合，得到n个目标值，并获取排班配置参数，最后基于排班配置参数和n个目标值，对n个待排列标识信息进行排班组合，得到排班信息。这样，信息处理设备根据用户场景设置的排班配置参数和用于表示待排列对象的业务能力的业务参数集合来确定对待排列对象的排班信息，解决了目前的排班方式可靠性较低的问题，实现了智能化排班，有效提高了排班结果的可靠性，并保证了排班效率。通过对运维人员的业务能力进行量化打分，根据分值高低来对运维人员进行排班，有效实现了能力强的人带能力弱的人的目的，并可以实现根据特殊场景智能进行特殊值班安排，有效保证了特殊场景下的值班要求。
基于前述实施例，本申请的实施例提供一种信息处理设备，参照图12所示，该信息处理设备4可以包括：处理器41、存储器42和通信总线43，其中：
存储器42，用于存储可执行指令；
通信总线43，用于实现处理器41和存储器42之间的通信连接；
处理器41，用于执行存储器42中存储的信息处理程序，以实现以下步骤：
确定n个待排列标识信息；其中，每一待排列标识信息用于标识对应的一个待排列对象，n为大于或等于1的整数；
获取每一待排列标识信息对应的业务参数集合，得到n个业务参数集合；其中，每一业务参数集合用于表示对应的待排列对象的业务能力；
基于n个业务参数集合，得到n个目标值；其中，每一目标值用于表示对应的待排列对象的综合业务能力；
获取排班配置参数；
基于排班配置参数和n个目标值，对n个待排列标识信息进行排班组合，得到排班信息。
在本申请其他实施例中，处理器用于执行步骤基于n个业务参数集合，得到n个目标值时，可以通过以下步骤来实现：
获取已训练好的目标分类器；
通过目标分类器，对每一业务参数集合分别进行预测，得到n个目标值。
在本申请其他实施例中，处理器用于执行步骤通过目标分类器，对每一业务参数集合分别进行预测，得到n个目标值时，可以通过以下步骤来实现：
通过目标分类器，分别预测每一业务参数集合的每一集合元素的目标标签，得到每一业务参数集合对应的m个目标标签；其中，每一业务参数集合包括m个集合元素，m为大于或等于1的整数；
基于每一业务参数集合对应的m个目标标签，确定n个目标值。
在本申请其他实施例中，处理器用于执行步骤通过目标分类器，分别预测每一业务参数集合的每一集合元素的目标标签，得到每一业务参数集合对应的m个目标标签之后，还用于执行以下步骤：
若接收到显示设备发送的用于指示显示目标标识信息对应的标签雷达图的显示指令，响应显示指令，获取目标标识信息对应的m个目标标签；
基于目标标识信息对应的m个目标标签，生成目标标识信息对应的目标标签雷达图；
发送目标标签雷达图至显示设备；其中，目标标签雷达图用于显示在显示设备的显示区域处。
在本申请其他实施例中，处理器用于执行步骤基于每一业务参数集合对应的m个目标标签，确定n个目标值时，可以通过以下步骤来实现：
获取每一业务参数集合对应的m个目标标签中每一目标标签的第一参考值，得到每一业务参数集合对应的m个第一参考值；
确定每一业务参数集合对应的m个第一参考值的累加值，得到n个目标值。
在本申请其他实施例中，处理器用于执行步骤基于n个业务参数集合，得到n个目标值时，用于执行以下步骤：
确定每一业务参数集合中每一集合元素的第二参考值，得到每一业务参数集合对应的m个第二参考值；其中，每一业务参数集合包括m个集合元素，m为大于或等于1的整数；
确定m个集合元素各自对应的m个权重系数；
对m个权重系数和每一业务参数集合对应的m个第二参考值进行加权求和处理，得到n个目标值。
在本申请其他实施例中，处理器用于执行步骤确定每一业务参数集合中每一集合元素的第二参考值，得到每一业务参数集合对应的m个第二参考值时，用于执行以下步骤：
确定每一业务参数集合中每一集合元素的双曲正切值与对应的每一集合元素的乘积值；
确定乘积值与预设分制数值的乘积，得到每一业务参数集合对应的m个第二参考值。
在本申请其他实施例中，处理器用于执行步骤基于排班配置参数和n个目标值， 对n个待排列标识信息进行排班组合，得到排班信息时，可以通过以下步骤来实现：
从排班配置参数中确定目标值班时间信息和每次值班需要的预设值班人数p；其中，p为大于或等于1的整数；
若目标值班时间信息为第一类型时间信息，且n与p的余数为零，将n个待排列标识信息按照n个目标值从大到小的排序顺序进行排序并平均分组，得到p组待排列标识信息；
依次分别从p组待排列标识信息中的每一组待排列标识信息中获取一个待排列标识信息进行组合，得到q1组第一预设数量个待排列标识信息；其中，q1为n与p的商值；
依次随机分配q1组第一预设数量个待排列标识信息中的每一组第一预设数量个待排列标识信息至目标值班时间信息的每一值班时间段，直至q1组第一预设数量个待排列标识信息分配完毕，得到排班信息。
在本申请其他实施例中，处理器还用于执行以下步骤：
若目标值班时间信息为第一类型时间信息，且n与p的余数为i，将n个待排列标识信息分为n与i的差值个待排列标识信息和i个待排列标识信息；其中，i为大于或等于1的整数；
采用参考标识对i个待排列标识信息进行标识；
按照n与i的差值个目标值从大到小的排序顺序进行排序并平均分组，得到p组待排列标识信息；
依次分别从p组待排列标识信息中的每一组待排列标识信息中获取一个待排列标识信息进行组合，得到q2组第一预设数量个待排列标识信息；其中，q2为n与i的差值与p的商值；
依次随机分配q2组第一预设数量个待排列标识信息中的每一组第一预设数量个待排列标识信息至目标值班时间信息的每一值班时间段，指示q2组第一预设数量个待排列标识信息分配完毕，得到排班信息。
在本申请其他实施例中，处理器还用于执行以下步骤：
若目标值班时间信息为第二类型时间信息，从n个目标值中确定大于或等于预设值的x个第三参考值；其中，x为大于或等于1，且小于或等于n的整数；
若x与p的余数为零，将x个第三参考值对应的x个待排列标识信息随机平均分组，得到p待排列标识信息；
依次分别从p组待排列标识信息中的每一组待排列标识信息中获取一个待排列标识信息进行组合，得到q3组第一预设数量个待排列标识信息；其中，q3为x与p的商值；
依次随机分配q3组第一预设数量个待排列标识信息中的每一组第一预设数量个待排列标识信息至目标值班时间信息的每一值班时间段，指示q3组第一预设数量个待排列标识信息分配完毕，得到排班信息。
在本申请其他实施例中，处理器还用于执行以下步骤：
若x与p的余数j不为零，对x个第三参考值按照值从大到小的顺序进行排序，得到排序后的x个第三参考值；
从排序后的x个第三参考值中选取前x与j差值个第三参考值，并将x与j差值个第三参考值对应的x与j差值个待排列标识信息随机平均分组，得到p组待排列标识信息；
依次分别从p组待排列标识信息中的每一组待排列标识信息中获取一个待排列标识信息进行组合，得到q4组第一预设数量个待排列标识信息；其中，q4为x与j差值与p的商值；
依次随机分配q4组第一预设数量个待排列标识信息中的每一组第一预设数量个待排列标识信息至目标值班时间信息的每一值班时间段，指示q4组第一预设数量个待排列标识信息分配完毕，得到排班信息。
在本申请其他实施例中，处理器用于执行步骤确定n个待排列标识信息时，可以通过以下步骤来实现：
获取待进行排列的用户标识信息；
若用户标识信息中包括具有参考标识的目标用户标识信息，确定用户标识信息和目标用户标识信息确定为n个待排列标识信息；
对应的，若目标值班时间信息为第一类型时间信息，且n与p的余数为i，将n个待排列标识信息分为n与i的差值个待排列标识信息和i个待排列标识信息，包括：
若目标值班时间信息为第一类型时间信息，且n与p的余数为i，从用户标识信息中随机选取i个用户标识信息作为i个待排列标识信息，并将目标用户标识信息和用户标识信息中除i个待排列标识信息外的用户标识信息作为n与i的差值个待排列标识信息。
在本申请其他实施例中，处理器执行步骤基于排班配置参数和n个目标值，对n个待排列标识信息进行排班组合，得到排班信息之后，还用于执行以下步骤：
通过目标应用程序发送排班信息至用户终端；其中，目标应用程序用于将排班信息通知至对应的待排列对象。
在本申请其他实施例中，处理器用于执行步骤发送排班信息至目标应用程序之后，还用于执行以下步骤：
基于排班信息，确定当前值班时间段相邻的下一值班时间段的值班用户标识信息；
通过目标应用程序发送提示信息至值班用户标识信息对应的用户终端；其中，提示信息用于提示下一值班时间段的值班对象需在下一值班时间内值班；
若接收到值班用户标识信息对应的用户终端发送的确认信息，基于确认信息，统计值班用户标识信息对应的值班对象的值班次数；其中，确认信息用于指示值班对象已确定下一值班时间段值班；
若未接收到值班用户标识信息对应的用户终端发送的确认信息，通过目标应用程序继续发送提示信息至值班用户标识信息对应的用户终端。
需要说明的是，本申请实施例中个或者多个程序可被一个或者多个处理器的步骤的解释说明，可以参照图1～6和图8～11对应的实施例提供的方法实现过程，此处不再赘述。
本申请实施例中，信息处理设备通过确定n个待排列标识信息后，获取每一待排列标识信息对应的业务参数集合，得到n个业务参数集合，然后基于n个业务参数集合，得到n个目标值，并获取排班配置参数，最后基于排班配置参数和n个目标值，对n个待排列标识信息进行排班组合，得到排班信息。这样，信息处理设备根据用户场景设置的排班配置参数和用于表示待排列对象的业务能力的业务参数集合来确定对待排列对象的排班信息，解决了目前的排班方式可靠性较低的问题，实现了智能化排班，有效提高了排班结果的可靠性，并保证了排班效率。通过对运维人员的业务能力进行量化，并根据量化值实现智能排班，有效实现了每次值班过程中能力强的人带能力弱的人的排班方案，并可以实现根据特殊场景智能进行特殊值班安排，有效保证了特殊场景下的值班要求
基于前述实施例，本申请的实施例提供一种计算机可读存储介质，简称为存储介质，该计算机可读存储介质存储有一个或者多个程序，该一个或者多个程序可被一个或者多个处理器执行，以实现如图1～6和图8～11对应的实施例提供的信息处理方法实现过程，此处不再赘述。
以上，仅为本申请的实施例而已，并非用于限定本申请的保护范围。凡在本申请的精神和范围之内所作的任何修改、等同替换和改进等，均包含在本申请的保护范围之内。
工业实用性
本申请实施例提供一种信息处理方法、设备及存储介质，该方法包括：确定n个待排列标识信息；其中，每一所述待排列标识信息用于标识对应的一个待排列对象，n为大于或等于1的整数；获取每一所述待排列标识信息对应的业务参数集合，得到n个业务参数集合；其中，每一所述业务参数集合用于表示对应的所述待排列对象的业务能力；基于n个所述业务参数集合，得到n个目标值；其中，每一所述目标值用于表示对应的待排列对象的综合业务能力；获取排班配置参数；基于所述排班配置参数和n个所述目标值，对n个所述待排列标识信息进行排班组合，得到排班信息，这样，信息处理设备根据用户场景设置的排班配置参数和用于表示待排列对象的业务能力的业务参数集合来确定对待排列对象的排班信息，解决了目前的排班方式可靠性较低的问题，实现了智能化排班，有效提高了排班结果的可靠性，并保证了排班效率。

Claims (16)

  1. 一种信息处理方法，所述方法包括：
    确定n个待排列标识信息；其中，每一所述待排列标识信息用于标识对应的一个待排列对象，n为大于或等于1的整数；
    获取每一所述待排列标识信息对应的业务参数集合，得到n个业务参数集合；其中，每一所述业务参数集合用于表示对应的所述待排列对象的业务能力；
    基于n个所述业务参数集合，得到n个目标值；其中，每一所述目标值用于表示对应的待排列对象的综合业务能力；
    获取排班配置参数；
    基于所述排班配置参数和n个所述目标值，对n个所述待排列标识信息进行排班组合，得到排班信息。
  2. 根据权利要求1所述的方法，其中，所述基于n个所述业务参数集合，得到n个目标值，包括：
    获取已训练好的目标分类器；
    通过所述目标分类器，对每一所述业务参数集合分别进行预测，得到n个所述目标值。
  3. 根据权利要求2所述的方法，其中，所述通过所述目标分类器，对每一所述业务参数集合分别进行预测，得到n个所述目标值，包括：
    通过所述目标分类器，分别预测每一所述业务参数集合的每一集合元素的目标标签，得到每一所述业务参数集合对应的m个所述目标标签；其中，每一所述业务参数集合包括m个集合元素，m为大于或等于1的整数；
    基于每一所述业务参数集合对应的m个所述目标标签，确定n个所述目标值。
  4. 根据权利要求3所述的方法，其中，所述基于每一所述业务参数集合对应的m个所述目标标签，确定n个所述目标值，包括：
    获取每一所述业务参数集合对应的m个所述目标标签中每一所述目标标签的第一参考值，得到每一所述业务参数集合对应的m个所述第一参考值；
    确定每一所述业务参数集合对应的m个所述第一参考值的累加值，得到n个所述目标值。
  5. 根据权利要求3所述的方法，其中，所述通过所述目标分类器，分别预测每一所述业务参数集合的每一集合元素的目标标签，得到每一所述业务参数集合对应 的m个所述目标标签之后，所述方法还包括：
    若接收到显示设备发送的用于指示显示目标标识信息对应的标签雷达图的显示指令，响应所述显示指令，获取所述目标标识信息对应的m个目标标签；
    基于所述目标标识信息对应的m个目标标签，生成所述目标标识信息对应的目标标签雷达图；
    发送所述目标标签雷达图至所述显示设备；其中，所述目标标签雷达图用于显示在所述显示设备的显示区域处。
  6. 根据权利要求1所述的方法，其中，所述基于n个所述业务参数集合，得到n个目标值，包括：
    确定每一所述业务参数集合中每一集合元素的第二参考值，得到每一所述业务参数集合对应的m个所述第二参考值；其中，每一所述业务参数集合包括m个集合元素，m为大于或等于1的整数；
    确定所述m个集合元素各自对应的m个权重系数；
    对m个所述权重系数和每一所述业务参数集合对应的m个所述第二参考值进行加权求和处理，得到n个所述目标值。
  7. 根据权利要求6所述的方法，其中，所述确定每一所述业务参数集合中每一集合元素的第二参考值，得到每一所述业务参数集合对应的m个所述第二参考值，包括：
    确定每一所述业务参数集合中每一集合元素的双曲正切值与对应的每一所述集合元素的乘积值；
    确定所述乘积值与预设分制数值的乘积，得到每一所述业务参数集合对应的m个所述第二参考值。
  8. 根据权利要求1至7任一所述的方法，其中，所述基于所述排班配置参数和n个所述目标值，对n个所述待排列标识信息进行排班组合，得到排班信息，包括：
    从所述排班配置参数中确定目标值班时间信息和每次值班需要的预设值班人数p；其中，p为大于或等于1的整数；
    若所述目标值班时间信息为第一类型时间信息，且n与p的余数为零，将n个所述待排列标识信息按照n个所述目标值从大到小的排序顺序进行排序并平均分组，得到p组所述待排列标识信息；
    依次分别从p组所述待排列标识信息中的每一组所述待排列标识信息中获取一 个所述待排列标识信息进行组合，得到q1组第一预设数量个待排列标识信息；其中，q1为n与p的商值；
    依次随机分配q1组所述第一预设数量个待排列标识信息中的每一组所述第一预设数量个待排列标识信息至所述目标值班时间信息的每一值班时间段，指示所述q1组所述第一预设数量个待排列标识信息分配完毕，得到所述排班信息。
  9. 根据权利要求8所述的方法，其中，所述方法还包括：
    若所述目标值班时间信息为第一类型时间信息，且n与p的余数为i，将n个所述待排列标识信息分为n与i的差值个待排列标识信息和i个待排列标识信息；其中，i为大于或等于1的整数；
    采用参考标识对i个所述待排列标识信息进行标识；
    按照n与i的差值个所述目标值从大到小的排序顺序进行排序并平均分组，得到p组所述待排列标识信息；
    依次分别从p组所述待排列标识信息中的每一组所述待排列标识信息中获取一个所述待排列标识信息进行组合，得到q2组所述第一预设数量个待排列标识信息；其中，q2为n与i的差值与p的商值；
    依次随机分配q2组所述第一预设数量个待排列标识信息中的每一组所述第一预设数量个待排列标识信息至所述目标值班时间信息的每一值班时间段，指示所述q2组所述第一预设数量个待排列标识信息分配完毕，得到所述排班信息。
  10. 根据权利要求8所述的方法，其中，所述方法还包括：
    若所述目标值班时间信息为第二类型时间信息，从n个所述目标值中确定大于或等于预设值的x个第三参考值；其中，x为大于或等于1，且小于或等于n的整数；
    若x与p的余数为零，将x个所述第三参考值对应的x个所述待排列标识信息随机平均分组，得到p所述待排列标识信息；
    依次分别从p组所述待排列标识信息中的每一组所述待排列标识信息中获取一个所述待排列标识信息进行组合，得到q3组所述第一预设数量个待排列标识信息；其中，q3为x与p的商值；
    依次随机分配q3组所述第一预设数量个待排列标识信息中的每一组所述第一预设数量个待排列标识信息至所述目标值班时间信息的每一值班时间段，指示所述q3组所述第一预设数量个待排列标识信息分配完毕，得到所述排班信息。
  11. 根据权利要求10所述的方法，其中，所述方法还包括：
    若x与p的余数j不为零，对x个所述第三参考值按照值从大到小的顺序进行排序，得到排序后的x个第三参考值；
    从所述排序后的x个第三参考值中选取前x与j差值个第三参考值，并将所述x与j差值个第三参考值对应的x与j差值个所述待排列标识信息随机平均分组，得到p组所述待排列标识信息；
    依次分别从p组所述待排列标识信息中的每一组所述待排列标识信息中获取一个所述待排列标识信息进行组合，得到q4组所述第一预设数量个待排列标识信息；其中，q4为x与j差值与p的商值；
    依次随机分配q4组所述第一预设数量个待排列标识信息中的每一组所述第一预设数量个待排列标识信息至所述目标值班时间信息的每一值班时间段，指示所述q4组所述第一预设数量个待排列标识信息分配完毕，得到所述排班信息。
  12. 根据权利要求9至11任一所述的方法，其中，所述确定n个待排列标识信息，包括：
    获取待进行排列的用户标识信息；
    若所述用户标识信息中包括具有参考标识的目标用户标识信息，确定所述用户标识信息和所述目标用户标识信息确定为n个所述待排列标识信息；
    对应的，所述若所述目标值班时间信息为第一类型时间信息，且n与p的余数为i，将n个所述待排列标识信息分为n与i的差值个待排列标识信息和i个待排列标识信息，包括：
    若所述目标值班时间信息为第一类型时间信息，且n与p的余数为i，从所述用户标识信息中随机选取i个用户标识信息作为所述i个待排列标识信息，并将所述目标用户标识信息和所述用户标识信息中除所述i个待排列标识信息外的用户标识信息作为n与i的差值个所述待排列标识信息。
  13. 根据权利要求1至7、9至11任一所述的方法，其中，所述基于所述排班配置参数和n个所述目标值，对n个所述待排列标识信息进行排班组合，得到排班信息之后，所述方法还包括：
    通过目标应用程序发送所述排班信息至用户终端；其中，所述目标应用程序用于将所述排班信息通知至对应的待排列对象。
  14. 根据权利要求13所述的方法，其中，所述发送所述排班信息至目标应用程序之后，所述方法还包括：
    基于所述排班信息，确定当前值班时间段相邻的下一值班时间段的值班用户标识信息；
    通过所述目标应用程序发送提示信息至所述值班用户标识信息对应的用户终端；其中，所述提示信息用于提示所述下一值班时间段的值班对象需在所述下一值班时间内值班；
    若接收到所述值班用户标识信息对应的用户终端发送的确认信息，基于所述确认信息，统计所述值班用户标识信息对应的值班对象的值班次数；其中，所述确认信息用于指示所述值班对象已确定下一值班时间段值班；
    若未接收到所述值班用户标识信息对应的用户终端发送的确认信息，通过所述目标应用程序继续发送所述提示信息至所述值班用户标识信息对应的用户终端。
  15. 一种信息处理设备，其中，所述设备包括存储器、处理器和通信总线；其中：
    所述存储器，用于存储可执行指令；
    所述通信总线，用于实现所述处理器和所述存储器之间的通信连接；
    所述处理器，用于执行所述存储器中存储的信息处理程序，实现如权利要求1至14中任一项所述的信息处理方法的步骤。
  16. 一种存储介质，其中，所述存储介质上存储有信息处理程序，所述信息处理程序被处理器执行时实现如权利要求1至14中任一项所述的信息处理方法的步骤。
PCT/CN2021/127125 2020-11-13 2021-10-28 一种信息处理方法、设备及存储介质 Ceased WO2022100449A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202011270938.7A CN112232713B (zh) 2020-11-13 2020-11-13 一种信息处理方法、设备及存储介质
CN202011270938.7 2020-11-13

Publications (1)

Publication Number Publication Date
WO2022100449A1 true WO2022100449A1 (zh) 2022-05-19

Family

ID=74124561

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/127125 Ceased WO2022100449A1 (zh) 2020-11-13 2021-10-28 一种信息处理方法、设备及存储介质

Country Status (2)

Country Link
CN (1) CN112232713B (zh)
WO (1) WO2022100449A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116070833A (zh) * 2022-12-09 2023-05-05 招联消费金融有限公司 收运人员排班方法、装置和计算机设备
CN118966731A (zh) * 2024-10-18 2024-11-15 江苏金智教育信息股份有限公司 一种多部门值班排班的方法、装置、介质及设备

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112232713B (zh) * 2020-11-13 2024-01-19 深圳前海微众银行股份有限公司 一种信息处理方法、设备及存储介质
CN113762693A (zh) * 2021-01-18 2021-12-07 北京京东拓先科技有限公司 用于展示信息的方法和装置
CN112862288A (zh) * 2021-01-29 2021-05-28 海南纽康信息系统有限公司 一种基于样板的公平性自动排班方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108053118A (zh) * 2017-12-14 2018-05-18 泰康保险集团股份有限公司 医生排班方法与系统
CN111754113A (zh) * 2020-06-24 2020-10-09 精效新软新技术（北京）有限公司 生产加工过程中调度排班排产自动控制方法、系统及介质
US20200341808A1 (en) * 2018-05-02 2020-10-29 Servicenow, Inc. Periodic task execution in an automated context
CN112232713A (zh) * 2020-11-13 2021-01-15 深圳前海微众银行股份有限公司 一种信息处理方法、设备及存储介质

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109190976A (zh) * 2018-08-31 2019-01-11 天津字节跳动科技有限公司 排班处理方法、装置、计算机设备及存储介质

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108053118A (zh) * 2017-12-14 2018-05-18 泰康保险集团股份有限公司 医生排班方法与系统
US20200341808A1 (en) * 2018-05-02 2020-10-29 Servicenow, Inc. Periodic task execution in an automated context
CN111754113A (zh) * 2020-06-24 2020-10-09 精效新软新技术（北京）有限公司 生产加工过程中调度排班排产自动控制方法、系统及介质
CN112232713A (zh) * 2020-11-13 2021-01-15 深圳前海微众银行股份有限公司 一种信息处理方法、设备及存储介质

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116070833A (zh) * 2022-12-09 2023-05-05 招联消费金融有限公司 收运人员排班方法、装置和计算机设备
CN118966731A (zh) * 2024-10-18 2024-11-15 江苏金智教育信息股份有限公司 一种多部门值班排班的方法、装置、介质及设备

Also Published As

Publication number Publication date
CN112232713B (zh) 2024-01-19
CN112232713A (zh) 2021-01-15

Similar Documents

Publication Publication Date Title
WO2022100449A1 (zh) 一种信息处理方法、设备及存储介质
CN110070391B (zh) 数据处理方法、装置、计算机可读介质及电子设备
Zona et al. Resourcefulness quantification approach for resilient communities and countries
CN110727852A (zh) 一种推送招聘推荐服务的方法、装置及终端
CN113535699A (zh) 一种数据质量检测方法、装置和设备
Kolokytha et al. LABOUR JOB DIGITALIZATION: MYTHS AND REALITIES.
CN113706111B (zh) 医疗机构流程数据的处理方法、装置、设备及介质
Duddalwar et al. An optimization of healthcare operation management using machine learning
Souza et al. Clustering members of project teams according their perceptions about the impact of remote work on project success: a comparative analysis
CN112052310A (zh) 基于大数据的信息获取方法、装置、设备及存储介质
CN115865736A (zh) 5g网络健康监测方法、装置、设备及介质
CN114358396B (zh) 巡检路线的评估方法、装置、存储介质及移动终端
CN120952442A (zh) 一种基于大模型底座的智能问答数据监管方法和相关设备
Fink Cognitive assistance systems for manual assembly throughout the German manufacturing industry
AZHMUHAMEDOV et al. Modeling of communication process in social environment.
JP2015176266A (ja) 事務リスク管理システムおよび事務リスク管理プログラム
CN111915188A (zh) 企业的系统性能测试方法、装置和设备
CN118096097A (zh) 业务数据处理方法及装置
CN111177283A (zh) 一种基于强化学习的智能人事模型构建方法及装置
CN113342518B (zh) 任务处理方法和装置
CN105843785B (zh) 一种内嵌组织管理层次的数据自定义计算报表生成方法
CN114780553A (zh) 一种基于工业数据模型的异构数据存储方法、装置及设备
CN107621979A (zh) 一种学生发展档案大数据算法与分析系统
Javanbakht et al. A new method for enterprise architecture assessment and decision-making about improvement or redesign
CN113793004A (zh) 一种电网人力配置应用系统及其配置方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21890976

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 31.08.2023)

122 Ep: pct application non-entry in european phase

Ref document number: 21890976

Country of ref document: EP

Kind code of ref document: A1