CN113379177A

CN113379177A - Task scheduling system and method

Info

Publication number: CN113379177A
Application number: CN202010161855.8A
Authority: CN
Inventors: 冯军
Original assignee: Beijing Jingdong Century Trading Co Ltd; Beijing Wodong Tianjun Information Technology Co Ltd
Current assignee: Beijing Jingdong Century Trading Co Ltd; Beijing Wodong Tianjun Information Technology Co Ltd
Priority date: 2020-03-10
Filing date: 2020-03-10
Publication date: 2021-09-10

Abstract

The invention discloses a task scheduling system and method, and relates to the technical field of computers. One embodiment of the system comprises: the executor module is used for storing skill information of an executor; the task pool module is used for receiving the tasks to be executed created by the business system and storing the detailed information of the tasks to be executed; and the scheduling module is used for matching the task to be executed with the executor according to the skill information and the detail information of the task to be executed and sending the successfully matched task to be executed to the corresponding executor. The task scheduling system can flexibly expand the skills of the staff, can automatically distribute the tasks to be executed to corresponding executors, realizes the automation of staff work scheduling, improves the work efficiency and the work output, and has low influence on the original service system due to the decoupling of the task scheduling system and the original service system.

Description

Task scheduling system and method

Technical Field

The invention relates to the technical field of computers, in particular to a task scheduling system and method.

Background

The retail industry is the platform that communicates between the producer and the end consumer and is the window for the display and sale of goods. Stores are the most common business state of the retail industry, and shopping at stores has become one of the ways in which modern people live at a fast pace. Production jobs in stores, such as receiving, picking, replenishing, packaging, sorting, returning, collecting cash, processing, etc., are generally distributed to the relevant executives by managers through the relevant business systems. The large-scale store has large passenger flow, and the production works such as receiving, picking, replenishing, packing, arranging, returning, cash registering, processing and the like are carried out every day, and if the production works are arranged through manual management, the production of the large-scale store is very disordered and inefficient.

Disclosure of Invention

In view of this, embodiments of the present invention provide a task scheduling system and method, which can flexibly extend skills of a worker, and can automatically allocate a task to be executed to a corresponding executor, thereby implementing automation of worker work scheduling, and improving work efficiency and work output. Moreover, the task scheduling system of the embodiment is decoupled from the original service system, and has low influence on the original service system.

To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a task scheduling system including:

the executor module is used for storing skill information of an executor;

the task pool module is used for receiving the tasks to be executed created by the business system and storing the detailed information of the tasks to be executed;

and the scheduling module is used for matching the task to be executed with the executor according to the skill information and the detail information of the task to be executed and sending the successfully matched task to be executed to the corresponding executor.

Optionally, the skill information is described by a service tag; the detail information of the task to be executed comprises the type of the task to be executed, and the type of the task to be executed is described through a service label;

the scheduling module is further configured to: and matching the task to be executed with the executor according to the service label of the executor and the service label of the task to be executed, and sending the successfully matched task to be executed to the corresponding executor.

Optionally, the executor module is further configured to store attribute information of the executor, where the attribute information includes a department to which the employee belongs and/or a site to which the employee belongs;

the detail information of the task to be executed further comprises one or more of the following information: task priority, task expected execution time, task source, department, site, business tag priority, sub-business priority, execution channel, and execution link.

Optionally, the executor module is further to: calculating a Cartesian product of the skill information and the attribute information; and generating a skill attribute table according to the skill information, the attribute information and the Cartesian product.

Optionally, the scheduling module is further configured to: determining a task to be executed matched with an executor according to the service label, the department to which the executor belongs, the site to which the executor belongs, and the service label, the department and the site of the task to be executed; and if the tasks to be executed matched with the executer have a plurality of tasks, distributing the tasks to be executed with the highest task priority to the executer.

Optionally, the task priority is determined according to the service tag priority, the task expected execution time, and the sub-service priority.

Optionally, the task scheduling system further includes a service tag module, configured to create and store a service tag.

To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a task scheduling method, including: acquiring skill information of an executor; receiving a task to be executed created by a business system; and matching the task to be executed with an executor according to the skill attribute information and the detail information of the task to be executed, and sending the successfully matched task to be executed to a corresponding executor.

To achieve the above object, according to still another aspect of an embodiment of the present invention, there is provided an electronic apparatus including: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors realize the task scheduling method of the embodiment of the invention.

To achieve the above object, according to still another aspect of the embodiments of the present invention, there is provided a computer-readable medium on which a computer program is stored, the program implementing the task scheduling method of the embodiments of the present invention when executed by a processor.

One embodiment of the above invention has the following advantages or benefits: the scheduling module matches the executor in the executor module with the to-be-executed tasks in the task pool module and sends the successfully-matched to-be-executed tasks to the corresponding executors, so that the to-be-executed tasks can be automatically distributed to the corresponding executors, the automation of personnel work scheduling is realized, the work efficiency and the work output are improved, and the task scheduling system of the embodiment is decoupled from the original service system and has low influence on the original service system.

Further effects of the above-mentioned non-conventional alternatives will be 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 major modules of a task scheduling system of an embodiment of the present invention;

FIG. 2 is a schematic diagram of the architecture of a task scheduling system according to an embodiment of the present invention;

FIG. 3 is a schematic diagram of a main flow of task allocation of the task scheduling system according to an embodiment of the present invention;

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

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

fig. 6 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.

Detailed Description

Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as 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 main modules of a task scheduling system 100 according to an embodiment of the present invention, and the task scheduling system 100 according to an embodiment of the present invention may be applied to an offline store. As shown in fig. 1, the task scheduling system 100 includes:

an executor module 101 for storing skill information of an executor;

the task pool module 102 is configured to receive a task to be executed created by a service system, and store details of the task to be executed;

and the scheduling module 103 is configured to match the task to be executed with an executor according to the skill information and the detail information of the task to be executed, and send the successfully matched task to be executed to a corresponding executor.

Specifically, the executor module 101 is configured to record skill information of the executor, such as information about sorting, picking, replenishment, packaging, and the like, so that the skill of the employee can be flexibly extended. These skills information may be described by a business label. In this embodiment, the service label may be created by the service system, and the executor and the service label are bound by the staff member to represent the service that the executor can execute. The executor may bind multiple tags, with the business tag and executor being in a many-to-many relationship. The priority of the service label may be set when the service label is created.

The task pool module 102 is configured to record relevant information of the task to be executed, for example, a type of the task to be executed, and the type of the task to be executed may also be described by a service tag. Thus, the skill attribute information of the performer includes a business label, and the detail information of the task to be performed also includes a business label.

The scheduling module 103 is configured to automatically allocate the tasks to be executed to corresponding executors, so as to ensure reasonable and ordered allocation of the tasks under the condition of high concurrency.

Because the skill attribute information of the executor includes the service tag, and the detail information of the task to be executed also includes the service tag, the scheduling module 103 may match the task to be executed with the executor according to the service tag of the executor and the service tag of the task to be executed, and send the task to be executed that is successfully matched to the corresponding executor.

The task scheduling system of the embodiment of the invention can flexibly expand the skills of the staff, can automatically distribute the tasks to be executed to the corresponding executors, realizes the automation of the work scheduling of the staff, improves the work efficiency and the work output, and has low influence on the original service system because the task scheduling system is decoupled from the original service system.

In an optional embodiment, the executor module is further configured to store attribute information of the executor, where the attribute information includes a department to which the employee belongs and/or a site to which the employee belongs. In practical applications, a large store may be divided into multiple departments and multiple sites, and an employee may be responsible for a certain job in one or more departments, or in one or more sites.

The detail information of the task to be executed further includes one or more of the following information: task priority, task expected execution time, task source, department, site, business tag priority, sub-business priority, execution channel, and execution link. And the task priority is determined according to the service label priority, the expected task execution time and the sub-service priority. More specifically, the traffic label priority is represented by a fixed number of digits (e.g., represented by a three digit number, with smaller numbers having higher priority). The service label priority is defined by the manager of the store and the service personnel in advance, and is manually specified, for example, the picking service is more important than the replenishment service, so the picking priority is set to be higher. However, the picking service has more than ten sub-services, and the sub-service priority is also predefined by the service system. The task priority is obtained by splicing the service label priority, the task expected execution time and the sub-service priority according to the sequence, and the smaller the value obtained by splicing is, the higher the task priority is. The execution channel refers to which device the task to be executed is executed by, and the execution link refers to a service page to which jumping to is needed when the task to be executed is executed, specifically jumping through a URL.

In an alternative embodiment, for convenience of recording, a skill attribute table is set in the executor module, and the skill information and attribute information of the executor are recorded in the skill attribute table. As an example, the skill attribute table may include the following fields: an autonomy main key (ID), a staff account number (PIN), a STATE (STATE, representing whether to be on-line or not), a distribution TASK number (PIN _ TASK _ NUM), a service label, a department and a site.

In order to flexibly expand the attribute dimension of the staff, the skill attribute table is stored in a Cartesian product mode. Specifically, the method comprises the following steps:

calculating a Cartesian product of the skill information and the attribute information;

and generating a skill attribute table according to the skill information, the attribute information and the Cartesian product.

Where the cartesian product refers to the cartesian product (also called direct product) of two sets X and Y in mathematics, the first object being a member of X and the second object being one of all possible ordered pairs of Y.

As an example, assuming that a certain employee has a replenishment label, he is again in a department of miscellaneous and also responsible for the forecourt, he can perform four types of tasks: 1. the replenishment tasks of the departments and fields to which the employees belong are not specified; 2. belonging to Heterostemona and not specifying a replenishment task of a place to which the employee belongs; 3. the replenishment tasks belong to the front field and do not specify the department to which the employee belongs; 4. and (4) replenishment tasks of miscellaneous departments at the front field. Then for that employee there are 4 records in the skill attribute table (4 ═ 1 × 2 × 2), and if one more dimension, say a bin, is added, then the multiplication continues. This extension of the property can be achieved by cartesian product storage.

In the above example, the information of the task and the attributes of the performer is refined, so the scheduling module is further configured to: determining a task to be executed matched with an executor according to the service label, the department to which the executor belongs, the site to which the executor belongs, and the service label, the department and the site of the task to be executed; and if the tasks to be executed matched with the executer have a plurality of tasks, distributing the tasks to be executed with the highest task priority to the executer.

Fig. 2 is a schematic structural diagram of a task scheduling system according to another embodiment of the present invention, and as shown in fig. 2, the task scheduling system includes a service tag module, an executor module, a task pool module, and a scheduling module.

The service label module is used for creating and storing a service label. In this embodiment, the service system creates a corresponding service tag through the service tag module, and sets the priority of the service tag. The priority of the service label may be represented by a number, for example, the priority of the service label consists of a three-digit number, and the lower the number, the higher the priority.

Taking the replenishment business system as an example, the fields of the replenishment label are shown in the following table 1:

table 1:

after the business label is created, the manager can bind the business label to the employee, and the employee and the business label are in a many-to-many relationship. In a specific example, a many-to-many relationship between an employee and a business label may be stored in a relationship mapping table, which may be as shown in table 2:

table 2:

field(s)	Description of the invention
		PIN	Employee account
TAG_ID	Service tag ID

The executor module is used for storing skill information and attribute information of the executor. The skill information is described through a service label, and the attribute information comprises a department to which the employee belongs and/or a site to which the employee belongs. In other optional embodiments, the attribute information further includes an amount of tasks that the employee has accepted.

As an example, two tables are stored in the actor module: an employee table and a skill attribute table. The employee table is used for recording personal information and states of employees, and the skill attribute table is used for recording skill information and attribute information of the employees. By way of example, the major fields of the employee table are shown in Table 3 below:

table 3:

in this embodiment, after the employee goes online, the status of the employee is updated to be online in the staff table. And after the employee is offline, updating the state of the employee into offline in the staff list.

The main fields of the skill attribute table are shown in table 4 below:

field(s)	Description of the invention
		PIN	Employee account
TAG_ID	Service tag ID
		DEPARTMENT_ID	Department ID
AREA_ID	Site ID
		PIN_TASK_NUM	Assigned task volume

It should be noted that, in order to continuously extend the employee attribute dimension based on the service label, the skill attribute table adopts a cartesian product storage method. Where the Cartesian product refers to the Cartesian product (also called direct product) of two sets X and Y, expressed as X × Y, in mathematics, the first object being a member of X and the second object being one of all possible ordered pairs of Y.

For example, assuming that zhang san of employee may receive a replenishment task without specifying the department and site to which employee belongs, and may also receive a replenishment task with a different department, then zhang san has 2 records in the skill attribute table (1 × 2 ═ 2, where 1 indicates that the business label of zhang san has only one replenishment element, and 2 indicates that the department to which zhang belongs has two elements, which are not specified and different), then zhang in the skill attribute table has a record as shown in table 5 below:

table 5:

wherein a "-1" indicates that no department is specified.

Based on Table 5, the scheduling module looks up two records when looking up the idle man hours. The first record shows that Zhang III can receive the replenishment tasks of departments and fields which do not specify the employees, and the second record shows that Zhang III can receive the replenishment tasks of various departments. If a restocking task for an unspecified department exists in the task pool module, the scheduling module may assign the task to Zhang III. If the task pool module has a replenishment task of hundreds of departments, the scheduling module can allocate the task to Zhang III.

If the store in which Zhang III is located divides the store field, and Zhang III is responsible for the front field, an attribute dimension should be added on the basis of the table 5: and (4) a field. Then zhang three records in the skill attribute table have 4 entries (1 × 2 ═ 4, where 1 indicates that the business label of zhang three has only one element for replenishment, 2 indicates that the department to which zhang three belongs has two elements, unspecified and miscellaneous, and that the site to which zhang three belongs has two elements, unspecified and former), table 5 is updated to table 6:

table 6:

PIN	TAG_ID	DEPARTMENT_ID	AREA_ID	PIN_TASK_NUM
					Zhang San	replenishment	-1	-1	0
Zhang San	Replenishment	Miscellaneous medicine	-1	0
					Zhang San	Replenishment	-1	Forecourt	0
Zhang San	Replenishment	Miscellaneous medicine	Forecourt	0

As can be seen from table 6, zhang san may be connected to a replenishment task, a replenishment task of a different department, a replenishment task of a previous yard, and a replenishment task of a different department of the previous yard. If the store is added with other attributes of the staff, such as staff positions and other attributes, the storage can be carried out in the same way.

And the task pool module is used for being in butt joint with each service system, receiving the tasks to be executed established by each service system and storing the tasks. The tasks to be executed in the task pool module are stored in a task table, and the task table comprises a service tag field and can also comprise one or more of the following fields: task ID, business TAG ID (TAG _ ID), business ID (task source), department, site, expected execution time, business TAG priority, sub-business priority, task priority, execution channel, execution link, task status, executor, allocation time, actual execution time, completion time.

To record the status change of each task, a task flow meter may be provided in the task pool module that records the status change of the task, such as when it was assigned, when it was executed, who the executive was, etc. A record is generated for each change in the state of the task. The whole life cycle of the task can be restored through the task flow meter. For example, a task may have 5 states: 1. initialization 2, waiting for allocation 3, allocated 4, execution 5, completed. Only one status field is stored in the task table, and the content of this field is variable. In the future, the historical state cannot be displayed when the running water of the task is traced, so that one state is recorded in the running water meter every time the state is changed, for example, 5 states correspond to 5 running water records, and the whole running record of the task can be displayed later.

It should be noted that, when storing the tasks to be executed, the task pool module may store the tasks in order from high priority to low priority. The task priority can be determined according to the service label priority, the expected execution time of the task and the sub-service priority. More specifically, the traffic label priority is represented by a fixed number of digits (e.g., represented by a three digit number, with smaller numbers having higher priority). The service label priority is defined by the manager of the store and the service personnel in advance, and is manually specified, for example, the picking service is more important than the replenishment service, so the picking priority is set to be higher. However, the picking service has more than ten sub-services, and the sub-service priority is also predefined by the service system. And splicing the service label priority, the expected execution time and the sub-service priority of the task to be executed in sequence, wherein the obtained number is used as the task priority, and the smaller the number is, the higher the task priority is.

As an example, assume that there are 6 tasks to be performed, and the detailed information thereof is shown in table 7 below:

and splicing the service label priority, the expected execution time and the sub-service priority of each task to be executed in sequence, and taking the obtained number as the task priority. The task priority of the 1 st to-be-executed task is 9920190901100001101, the task priority of the 2 nd to-be-executed task is 9920190901095002101, the task priority of the 3 rd to-be-executed task is 9920190901100001100, the task priority of the 4 th to-be-executed task is 9920190901095500100, the task priority of the 5 th to-be-executed task is 1020190901100001102, and the task priority of the 6 th to-be-executed task is 1020190901095002102, then the task priorities of the 6 to-be-executed tasks are in the order from high to low: 6-5-4-3-2-1.

The task pool module obtains the service priority by splicing the service label priority, the expected execution time and the sub-service priority in sequence, and improves the sequencing performance.

And the scheduling module is used for matching the task to be executed with an executor according to the skill information and the detail information of the task to be executed and sending the successfully matched task to be executed to a corresponding executor. Specifically, the scheduling module may match the task to be executed with the executor according to the service tag of the executor and the service tag of the task to be executed, and send the successfully matched task to be executed to the corresponding executor. More specifically, the scheduling module may determine the task to be executed, which is matched with the executor, according to the service tag, the department, the site of the executor, and the service tag, the department, and the site of the task to be executed; and if the tasks to be executed matched with the executer have a plurality of tasks, distributing the tasks to be executed with the highest task priority to the executer.

Fig. 3 is a schematic flowchart of a task scheduling system allocating a task according to an embodiment of the present invention, and as shown in fig. 3, the task scheduling system allocating a task includes:

1. the scheduling module acquires relevant data of an executor from the executor module;

2. the scheduling module searches tasks to be executed in the task pool module according to the relevant data of the executor, and when a plurality of tasks are matched with the executor, the tasks to be executed with the highest priority are obtained;

3. and the scheduling module allocates the task to be executed with the highest priority to the executor and updates the task state to be allocated.

4. The scheduling module updates the number of the tasks distributed to the executor in the executor module;

5. and the executor acquires the task to be executed, completes the task by clicking after the task is completed, and updates the state of the task in the task pool module and the number of the distributed tasks of the executor.

Fig. 4 is a schematic diagram of a main flow of a task scheduling method according to an embodiment of the present invention, and as shown in fig. 4, the method includes:

step S401: acquiring skill attribute information of an executor;

step S402: receiving a task to be executed created by a business system;

step S403: and matching the task to be executed with an executor according to the skill attribute information, and sending the successfully matched task to be executed to a corresponding executor.

The task scheduling method of the embodiment of the invention can automatically distribute the tasks to be executed to the corresponding executors, thereby realizing the automation of the work scheduling of the personnel and improving the work efficiency and the work output.

In an alternative embodiment, the skill information is described by a business tag; the detail information of the tasks to be executed comprises the types of the tasks to be executed, and the types of the tasks to be executed are described through business tags. Therefore, step S403 may further include matching the task to be executed with the executor according to the service tag of the executor and the service tag of the task to be executed, and sending the task to be executed that is successfully matched to the corresponding executor.

In an optional embodiment, the executor module is further configured to store attribute information of an executor, where the attribute information includes a department to which the employee belongs and/or a site to which the employee belongs;

In an optional embodiment, the method further comprises: calculating a Cartesian product of the skill information and the attribute information; and generating a skill attribute table according to the skill information, the attribute information and the Cartesian product.

In an optional embodiment, matching the task to be executed with an executor according to the skill information and the detail information of the task to be executed, and sending the successfully matched task to be executed to a corresponding executor includes: determining a task to be executed matched with an executor according to the service label, the department to which the executor belongs, the site to which the executor belongs, and the service label, the department and the site of the task to be executed; and if the tasks to be executed matched with the executer have a plurality of tasks, distributing the tasks to be executed with the highest task priority to the executer.

In an optional embodiment, the task priority is determined according to a service tag priority, a task expected execution time, and a sub-service priority.

Fig. 5 illustrates an exemplary system architecture 500 to which the task scheduling method or task scheduling system of embodiments of the present invention may be applied.

As shown in fig. 5, the system architecture 500 may include

terminal devices

501, 502, 503, a network 504, and a server 505. The network 504 serves to provide a medium for communication links between the

terminal devices

501, 502, 503 and the server 505. Network 504 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

The user may use the

terminal devices

501, 502, 503 to interact with a server 505 over a network 504 to receive or send messages or the like. The

terminal devices

501, 502, 503 may have various communication client applications installed thereon, such as a shopping application, a web browser application, a search application, an instant messaging tool, a mailbox client, social platform software, and the like.

The

terminal devices

501, 502, 503 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The server 505 may be a server that provides various services, such as a background management server that supports shopping websites browsed by users using the

terminal devices

501, 502, 503. The background management server may analyze and perform other processing on the received data such as the product information query request, and feed back a processing result (e.g., target push information and product information) to the terminal device.

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

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

Referring now to FIG. 6, a block diagram of a computer system 600 suitable for use with a terminal device implementing an embodiment of the invention is shown. The terminal device shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.

As shown in fig. 6, the computer system 600 includes a Central Processing Unit (CPU)601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.

The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.

In particular, according to the embodiments of the present disclosure, the processes described above with reference to the 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 illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication part Y09, and/or installed from the removable medium Y11. The above-described functions defined in the system of the present invention are executed when the computer program is executed by the Central Processing Unit (CPU) Y01.

It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination 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 present invention, 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, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. 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 flowchart 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 described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described 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 constitute a limitation on the unit itself, and for example, the sending module may also be described as a "module that sends 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 separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise:

acquiring skill attribute information of an executor;

receiving a task to be executed created by a business system;

and matching the task to be executed with an executor according to the skill attribute information, and sending the successfully matched task to be executed to a corresponding executor.

The technical scheme of the embodiment of the invention can automatically distribute the tasks to be executed to corresponding executors, thereby realizing the automation of the work scheduling of the personnel and improving the work efficiency and the work output.

The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A task scheduling system, comprising:

the executor module is used for storing skill information of an executor;

2. The task scheduling system of claim 1 wherein the skill information is described by a business label; the detail information of the task to be executed comprises the type of the task to be executed, and the type of the task to be executed is described through a service label;

3. The task scheduling system of claim 2, wherein the executor module is further configured to store attribute information of an executor, wherein the attribute information includes a department to which the employee belongs and/or a site to which the employee belongs;

4. The task scheduling system of claim 3 wherein the executor module is further to:

5. The task scheduling system of claim 3, wherein the scheduling module is further configured to:

determining a task to be executed matched with an executor according to the service label, the department to which the executor belongs, the site to which the executor belongs, and the service label, the department and the site of the task to be executed;

and if the tasks to be executed matched with the executer have a plurality of tasks, distributing the tasks to be executed with the highest task priority to the executer.

6. The task scheduling system of claim 3 wherein the task priority is determined based on a service tag priority, a task expected execution time, and a sub-service priority.

7. A task scheduling system according to any of claims 1-6 wherein the task scheduling system further comprises a traffic label module for creating and storing traffic labels.

8. A method for task scheduling, comprising:

acquiring skill information of an executor;

receiving a task to be executed created by a business system;

and matching the task to be executed with an executor according to the skill information and the detail information of the task to be executed, and sending the successfully matched task to be executed to a corresponding executor.

9. An electronic device, comprising:

one or more processors;

a storage device for storing one or more programs,

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

10. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method of claim 8.