CN111062572B

CN111062572B - Task allocation method and device

Info

Publication number: CN111062572B
Application number: CN201911135053.3A
Authority: CN
Inventors: 许笠; 张小彪; 王超
Original assignee: China Construction Bank Corp
Current assignee: China Construction Bank Corp
Priority date: 2019-11-19
Filing date: 2019-11-19
Publication date: 2023-07-18
Anticipated expiration: 2039-11-19
Also published as: CN111062572A

Abstract

The invention discloses a task allocation method and device, and relates to the technical field of computers. One embodiment of the method comprises the following steps: calculating the relativity of the tasks to be allocated and the task classes in the task class set, and determining a first task class adapted to the tasks to be allocated; determining a first operator class in a set of operator classes adapted to the first task class; and allocating operators to the tasks to be allocated by determining the relativity between the tasks to be allocated and the historical tasks of the operators in the first operator class. The implementation mode solves the technical defects that subjective influence and accidental influence exist in the prior art when the tasks to be distributed are distributed, and further achieves the technical effect that the tasks to be distributed are distributed to operators with proper requirements.

Description

Task allocation method and device

Technical Field

The present invention relates to the field of computer technologies, and in particular, to a method and an apparatus for task allocation.

Background

When there is a task to be distributed, the prior art adopts a method of manual specialization to select operators or adopts a random method to select operators. The method adopting the manual method mainly comprises the following steps: sequencing operators according to the standard specified by the expert, and further determining the operators most suitable for the tasks to be distributed; the selection of operators by the random method means: one operator is randomly selected among operators satisfying task requirements to assign tasks.

In the process of implementing the present invention, the inventor finds that at least the following problems exist in the prior art:

1. the manual expert method selects various capabilities required by an operator to determine the task type based on the personal experience of the expert, since there is no data support for historical tasks; and the capacity value of each operator given by the expert is not necessarily accurate, and if the task to be allocated involves a new capacity, the capacity index can only be scored by the expert, so that the subjectivity is too strong.

2. The random method is too accidental to guarantee proper operators to schedule tasks to be allocated.

Disclosure of Invention

In view of this, the embodiments of the present invention provide a task allocation method and apparatus, which can achieve the technical effect of allocating tasks to be allocated to operators that are more suitable.

To achieve the above object, according to one aspect of the embodiments of the present invention, there is provided a method for task allocation, including:

calculating the relativity of the tasks to be allocated and the task classes in the task class set, and determining a first task class adapted to the tasks to be allocated;

determining a first operator class in a set of operator classes adapted to the first task class;

and allocating operators to the tasks to be allocated by determining the relativity between the tasks to be allocated and the historical tasks of the operators in the first operator class.

Optionally, determining a first operator class of the set of operator classes adapted to the first task class includes:

determining the relativity between the task class in the task class set and the operators in the operator class set;

and determining a first operator class in the operator class set matched with the first task class according to the relevance.

Optionally, before determining the correlation between the task class in the task class set and the operator in the operator class set, the method includes:

classifying the historical tasks according to the attribute information of the historical tasks to obtain task classes;

and classifying the operators according to the attribute information of the operators to obtain operator classes.

Optionally, determining a correlation between a task class in the task class set and an operator in the operator class set includes:

importing historical task information in a preset time period into a graph database to generate a historical task graph;

importing the operator information in a preset time period into the map database to generate an operator map;

importing information of the historical task executed by the operator in the preset time period into the graph database, and increasing a connecting line between the historical task graph and the operator graph;

and determining the correlation degree between the task class in the task class set and the operator in the operator class set according to the connection line.

According to still another aspect of the embodiment of the present invention, there is provided an apparatus for task allocation, including:

the first task class determining module is used for calculating the correlation degree between the task to be allocated and the task class in the task class set and determining a first task class adapted to the task to be allocated;

a first operator class determining module configured to determine a first operator class in a set of operator classes adapted to the first task class;

and the task allocation module is used for allocating operators to the tasks to be allocated by determining the correlation between the tasks to be allocated and the historical tasks of the operators in the first operator class.

the task class obtaining module is used for classifying the historical tasks according to the attribute information of the historical tasks to obtain task classes;

and the operator class obtaining module is used for classifying the operators according to the attribute information of the operators to obtain operator classes.

According to another aspect of an embodiment of the present invention, there is provided a task allocation electronic device including:

one or more processors;

storage means for storing one or more programs,

when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the task allocation method provided by the present invention.

According to still another aspect of the embodiments of the present invention, there is provided a computer readable medium having stored thereon a computer program which when executed by a processor implements the task allocation method provided by the present invention.

One embodiment of the above invention has the following advantages or benefits:

according to the technical means for determining the similarity between the tasks to be distributed and the historical tasks, the technical defects that subjective influence and accidental influence exist in the task to be distributed in the prior art are overcome, and the technical effect of distributing the tasks to be distributed to operators which are suitable is achieved.

Further effects of the above-described non-conventional alternatives are described below in connection with the embodiments.

Drawings

The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:

FIG. 1 is a schematic diagram of the main flow of a method of task allocation according to an embodiment of the present invention;

FIG. 2 is a schematic diagram of a detailed flow of steps of a method of task allocation according to an embodiment of the present invention;

FIG. 3 is a schematic diagram of the main modules of an apparatus for task allocation according to an embodiment of the present invention;

FIG. 4 is an exemplary system architecture diagram in which embodiments of the present invention may be applied;

fig. 5 is a schematic diagram of a computer system suitable for use in implementing an embodiment of the invention.

Detailed Description

Exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, in which various details of the embodiments of the present invention are included to facilitate understanding, and are to be considered merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

Fig. 1 is a schematic diagram of the main flow of a method of task allocation according to an embodiment of the present invention, as shown in fig. 1,

step S101, calculating the correlation degree between a task to be allocated and task classes in a task class set, and determining a first task class adapted to the task to be allocated;

step S102, determining a first operator class in an operator class set adapted to the first task class;

step S103, allocating operators to the tasks to be allocated by determining the correlation between the tasks to be allocated and the historical tasks of the operators in the first operator class.

The task class refers to the type of the task; the task class set refers to a set formed by a plurality of task classes; similarly, the operator class refers to the type of operators; the operator class set refers to a set composed of a plurality of operator classes.

The task class can classify the historical tasks according to attribute information of the historical tasks, and then the task class is obtained; the attribute information of the history task may include, but is not limited to, one of: roles, rights, affiliated institutions, capability requirements for operators, etc.

The operator class can classify the operators according to the attribute information of the operators, so as to obtain the operator class; the operator's attribute information may include, but is not limited to, one of the following: roles, rights, affiliated institutions, capabilities, etc.

When a task to be allocated exists, the type of the task to be allocated may not be known to a person who allocates the task, and the task class most similar to the task to be allocated can be determined by calculating the correlation between the task to be allocated and the task class in the determined task class set, so that the type of the task to be allocated can be set as the most similar task class, and for convenience of subsequent description, the most similar task class is called as a first task class.

Wherein prior to determining a first operator class of the set of operator classes that is adapted to the first task class, comprising:

determining the relativity between the task class in the task class set and the operators in the operator class set; and further, the first operator adapted to the first task class can be conveniently and directly acquired. Wherein statistics may be employed to count historical tasks performed by the operator. The representation of the correlation includes, but is not limited to, graphical representation and tabular representation.

In an alternative embodiment of the present application, determining a degree of correlation between a task class in a set of task classes and an operator in a set of operator classes includes:

Before the task to be allocated is allocated, a historical task graph and an operator graph are established based on the historical tasks, and the technical means of calculating the correlation relationship between each historical task in the historical task graph and each operator in the operator graph is included, so that the correlation can be accurately and efficiently determined when the operator is allocated to the task to be allocated later.

step S201, importing historical task information in a preset time period into a graph database, generating a historical task graph, and classifying the historical tasks according to attribute information of the historical tasks;

step S202, importing the operator information in a preset time period into the graph database, generating an operator graph, and classifying the operators according to the attribute information of the operators;

step 203, importing the information of the operator executing the historical task in the preset time period into the graph database, and increasing the connection line between the historical task graph and the operator graph;

step S204, calculating the correlation between the task class and the operator class according to the connection condition, and finding out the most relevant operator class of each task class;

step S205, calculating the correlation degree between the task to be allocated and the task class in the task class set for the task to be allocated, and determining a first task class adapted to the task to be allocated;

step S206, determining a first operator class in the operator class set adapted to the first task class according to the result of step S204;

step S207, allocating operators to the tasks to be allocated by determining the correlation between the tasks to be allocated and the historical tasks of the operators in the first operator class.

Fig. 3 is a schematic diagram of main modules of an apparatus 300 for task allocation according to an embodiment of the present invention, as shown in fig. 3, including:

the first task class determining module 301 is configured to calculate a correlation between a task to be allocated and a task class in a task class set, and determine a first task class adapted to the task to be allocated;

a first operator class determination module 302, configured to determine a first operator class in a set of operator classes adapted to the first task class;

and a task allocation module 303, configured to allocate an operator to the task to be allocated by determining a correlation between the task to be allocated and a historical task of an operator in the first operator class.

Fig. 4 illustrates an exemplary system architecture 400 to which the task allocation method or task allocation device of embodiments of the present invention may be applied.

As shown in fig. 4, the system architecture 400 may include terminal devices 401, 402, 403, a network 404, and a server 405. The network 404 is used as a medium to provide communication links between the terminal devices 401, 402, 403 and the server 405. The network 404 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.

A user may interact with the server 405 via the network 404 using the terminal devices 401, 402, 403 to receive or send messages or the like. Various communication client applications, such as shopping class applications, web browser applications, search class applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only) may be installed on the terminal devices 401, 402, 403.

The terminal devices 401, 402, 403 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smartphones, tablets, laptop and desktop computers, and the like.

The server 405 may be a server providing various services, such as a background management server (by way of example only) providing support for shopping-type websites browsed by users using the terminal devices 401, 402, 403. The background management server may analyze and process the received data such as the product information query request, and feedback the processing result (e.g., the target push information, the product information—only an example) to the terminal device.

It should be noted that, the task allocation method provided in the embodiment of the present invention is generally executed by the server 405, and accordingly, the task allocation device is generally disposed in the server 405.

It should be understood that the number of terminal devices, networks and servers in fig. 4 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

Referring now to FIG. 5, there is illustrated a schematic diagram of a computer system 500 suitable for use in implementing an embodiment of the present invention. The terminal device shown in fig. 5 is only an example, and should not impose any limitation on the functions and the scope of use of the embodiment of the present invention.

As shown in fig. 5, the computer system 500 includes a central processing module (CPU) 501, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the system 500 are also stored. The CPU 501, ROM 502, and RAM 503 are connected to each other through a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.

The following components are connected to the I/O interface 505: an input section 506 including a keyboard, a mouse, and the like; an output portion 507 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The drive 510 is also connected to the I/O interface 505 as needed. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as needed so that a computer program read therefrom is mounted into the storage section 508 as needed.

In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 509, and/or installed from the removable media 511. The above-described functions defined in the system of the present invention are performed when the computer program is executed by a central processing module (CPU) 501.

The computer readable medium shown in the present invention may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.

The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The modules involved in the embodiments of the present invention may be implemented in software or in hardware. The described modules may also be provided in a processor, for example, as: a processor includes a sending module, an obtaining module, a determining module, and a first processing module. The names of these modules do not in some cases limit the module itself, and for example, the transmitting module may also be described as "a module that transmits a picture acquisition request to a connected server".

As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be present alone without being fitted into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to include:

According to the technical scheme provided by the embodiment of the invention, the following beneficial effects can be achieved:

The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives can occur depending upon design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.

Claims

1. A method of task allocation, comprising:

classifying historical tasks according to attribute information of the historical tasks to obtain task classes so as to generate task class sets; wherein the attribute information of the history task includes at least one of: role, rights, affiliated institution, capability requirement for operator;

calculating the relativity of tasks to be allocated and task classes in a task class set, and determining a first task class adapted to the tasks to be allocated; the type of the task to be allocated is not known to the person who allocates the task, the new capability is related, and the task class set does not contain the type of the task to be allocated;

classifying operators according to attribute information of the operators to obtain operator classes so as to generate an operator class set; wherein the attribute information of the operator includes at least one of: roles, rights, affiliated institutions, capabilities;

importing historical task information in a preset time period into a graph database to generate a historical task graph; importing the operator information in a preset time period into the map database to generate an operator map;

according to the connection line, determining the correlation between the task class in the task class set and the operator in the operator class set, and determining a first operator class in the operator class set adapted to the first task class according to the correlation;

2. An apparatus for task allocation, comprising:

the task class obtaining module is used for classifying the historical tasks according to the attribute information of the historical tasks to obtain task classes so as to generate task class sets; wherein the attribute information of the history task includes at least one of: role, rights, affiliated institution, capability requirement for operator;

the first task class determining module is used for calculating the correlation degree between the task to be allocated and the task class in the task class set and determining a first task class adapted to the task to be allocated; the type of the task to be allocated is not known to the person who allocates the task, the new capability is related, and the task class set does not contain the type of the task to be allocated;

the operator class obtaining module is used for classifying operators according to the attribute information of the operators to obtain operator classes so as to generate an operator class set; wherein the attribute information of the operator includes at least one of: roles, rights, affiliated institutions, capabilities;

the first operator class determining module is used for importing the historical task information in the preset time period into the graph database to generate a historical task graph;

3. An electronic device for task allocation, comprising:

one or more processors;

storage means for storing one or more programs,

the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method of claim 1.

4. A computer readable medium on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to claim 1.