CN113537845A - Task distribution method and device, electronic equipment and computer readable storage medium - Google Patents
Task distribution method and device, electronic equipment and computer readable storage medium Download PDFInfo
- Publication number
- CN113537845A CN113537845A CN202111086123.8A CN202111086123A CN113537845A CN 113537845 A CN113537845 A CN 113537845A CN 202111086123 A CN202111086123 A CN 202111086123A CN 113537845 A CN113537845 A CN 113537845A
- Authority
- CN
- China
- Prior art keywords
- task
- executed
- objects
- dispatching
- information
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR 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/06311—Scheduling, planning or task assignment for a person or group
- G06Q10/063118—Staff planning in a project environment
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR 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/06311—Scheduling, planning or task assignment for a person or group
- G06Q10/063112—Skill-based matching of a person or a group to a task
Abstract
The application provides a task dispatching method and device, electronic equipment and a computer readable storage medium, wherein the method comprises the following steps: acquiring first task information of a task to be executed; wherein the first task information comprises at least one of: the number of task performers required to complete the task to be performed, the time required to complete the task to be performed, whether the task to be performed requires specific skills, and the urgency of the task to be performed; acquiring second task information of an object of a task to be executed; the second task information includes at least one of: the number of the objects of the task to be executed, the time for completing the number of the currently distributed tasks, the work and rest time of the objects of the task to be executed, and whether the objects of the task to be executed have specific skills; and dispatching the task to the object to be executed according to the first task information and the second task information. Through the method and the device, the technical problem that task distribution efficiency is low due to the fact that task distribution is carried out in an artificial mode in the prior art is solved.
Description
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a method and an apparatus for task distribution, an electronic device, and a computer-readable storage medium.
Background
With the continuous improvement of the management informatization level, enterprises and teams put higher demands on the efficiency, safety and flexibility of task distribution. In the prior art, task dispatching modes of enterprises and public institutions are mainly manual dispatching, and the technical problems that tasks are stacked due to low task dispatching speed and more errors are caused due to untimely personnel information transmission exist.
Disclosure of Invention
An object of the embodiments of the present application is to provide a task dispatching method and apparatus, an electronic device, and a computer-readable storage medium, which solve the technical problem in the prior art that task dispatching efficiency is low due to task dispatching performed manually. The specific technical scheme is as follows:
in a first aspect of the present application, there is provided a task dispatching method, where the method includes: acquiring first task information of a task to be executed; wherein the first task information comprises at least one of: the number of task performers required to complete the task to be performed, the time required to complete the task to be performed, whether the task to be performed requires specific skills, and the urgency of the task to be performed; acquiring second task information of an object of a task to be executed; wherein the second task information includes at least one of: the number of the objects of the task to be executed, the time for completing the number of the currently distributed tasks, the work and rest time of the objects of the task to be executed, and whether the objects of the task to be executed have specific skills; and dispatching the task to the object to be executed according to the first task information and the second task information.
In a second aspect implemented by the present application, there is also provided a task distribution apparatus, including: the first acquisition module is used for acquiring first task information of a task to be executed; wherein the first task information comprises at least one of: the number of task performers required to complete the task to be performed, the time required to complete the task to be performed, whether the task to be performed requires specific skills, and the urgency of the task to be performed; the second acquisition module is used for acquiring second task information of an object of the task to be executed; wherein the second task information includes at least one of: the number of the objects of the task to be executed, the time for completing the number of the currently distributed tasks, the work and rest time of the objects of the task to be executed, and whether the objects of the task to be executed have specific skills; and the dispatching module is used for dispatching the task to the object of the task to be executed according to the first task information and the second task information.
In a third aspect of the present application, there is also provided a computer-readable storage medium having stored therein instructions, which when run on a computer, cause the computer to execute any of the task serving methods described above.
In a fourth aspect of the present application implementation, there is also provided a computer program product containing instructions that, when run on a computer, cause the computer to perform any of the task serving methods described above.
Through this application embodiment, because first task information includes at least one of following: the number of task performers required to complete the task to be performed, the time required to complete the task to be performed, whether the task to be performed requires specific skills, and the urgency of the task to be performed; the second task information includes at least one of: the task dispatching method comprises the steps of counting the number of objects to be subjected to task execution, completing the time of the currently distributed number of tasks, completing the work and rest time of the objects to be subjected to task execution, and judging whether the objects to be subjected to task execution have specific skills, namely, dispatching the tasks to the objects to be subjected to task execution according to first task information and second task information, namely, dispatching the tasks to the objects to be subjected to task execution can be considered from multiple dimensions, and then automatically dispatching the tasks to the objects to be subjected to task execution, so that the technical problem that task dispatching efficiency is low due to the fact that task dispatching is carried out in a manual mode in the prior art is solved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below.
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below.
FIG. 1 is a flowchart of a task dispatching method in an embodiment of the present application;
FIG. 2 is a second flowchart of a task dispatching method in the embodiment of the present application;
FIG. 3 is a third flowchart of a task dispatching method in the embodiment of the present application;
FIG. 4 is a schematic structural diagram of a task dispatching device according to an embodiment of the present application;
FIG. 5 is a second schematic structural diagram of a task dispatching device in the embodiment of the present application;
FIG. 6 is a third schematic structural diagram of a task dispatching device in the embodiment of the present application;
fig. 7 is a schematic structural diagram of an electronic device in an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
In the following description, suffixes such as "module", "unit" used to denote elements are used only for facilitating the explanation of the present application and have no specific meaning by themselves. Thus, "module" and "component" may be used in a mixture.
The technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application. An embodiment of the present application provides a task dispatching method, as shown in fig. 1, the method includes the following steps:
102, acquiring first task information of a task to be executed; wherein the first task information comprises at least one of: the number of task performers required to complete the task to be performed, the time required to complete the task to be performed, whether the task to be performed requires specific skills, and the urgency of the task to be performed;
in an example, the task to be executed is task 1, the number of task performers required for completing task 1 is 3, the time required for completing the task to be executed is 5 working days, and the urgency level of the task to be executed is the urgency level relative to other tasks, such as the urgency level of task 1 is the highest among all tasks or the urgency level next to task 2; whether the task to be executed needs specific skills is related to the task to be executed, for example, task 1 needs to have a good english base, or task 1 needs to have CAD drawing skills, and the like, that is, the specific skills mean that the task needs corresponding skills to be completed.
104, acquiring second task information of an object of a task to be executed; wherein the second task information includes at least one of: the number of the objects of the task to be executed, the time for completing the number of the currently distributed tasks, the work and rest time of the objects of the task to be executed, and whether the objects of the task to be executed have specific skills;
in an example, the number of objects to be executed is 5, that is, the number of objects currently capable of executing a new task is 5, and for the 5 objects, there are some objects that have no assigned task and some objects that have assigned tasks, but the assigned tasks may be completed in a short time, so that the time for the 5 people to complete the number of currently assigned tasks needs to be known as a reference for assigning the new task. In addition, the work and rest time of an object to be subjected to a task refers to the work time of the object, namely, when the task can be executed; whether an object to be subjected to a task has a particular skill, i.e., the skill that the object has, for example, a comparative number of office software, drawing software, PS, english, etc.
And 106, dispatching the task to the object to be executed according to the first task information and the second task information.
Through the above steps 102 to 106 of the embodiment of the present application, since the first task information includes at least one of the following items: the number of task performers required to complete the task to be performed, the time required to complete the task to be performed, whether the task to be performed requires specific skills, and the urgency of the task to be performed; the second task information includes at least one of: the task dispatching method comprises the steps of counting the number of objects to be subjected to task execution, completing the time of the currently distributed number of tasks, completing the work and rest time of the objects to be subjected to task execution, and judging whether the objects to be subjected to task execution have specific skills, namely, dispatching the tasks to the objects to be subjected to task execution according to first task information and second task information, namely, dispatching the tasks to the objects to be subjected to task execution can be considered from multiple dimensions, and then automatically dispatching the tasks to the objects to be subjected to task execution, so that the technical problem that task dispatching efficiency is low due to the fact that task dispatching is carried out in a manual mode in the prior art is solved.
In an optional implementation manner of the embodiment of the present application, the dispatching a task to an object to be executed according to the first task information and the second task information, which is referred to in step 106 of the present application, as shown in fig. 2, includes:
step 202: determining the matching degree of the first task information and the second task information;
determining the matching degree of the first task information and the second task information, wherein the determining of the matching degree of the first task information and the second task information comprises at least one of the following:
1) matching degree between the number of task performers required for completing the task to be performed and the number of objects of the task to be performed;
2) the degree of matching between the time required to complete the task to be executed and the time required to complete the number of tasks currently allocated;
3) matching degree of time required for completing the task to be executed and work and rest time of the object of the task to be executed;
4) whether the task to be executed needs the matching degree of the specific skill and whether the object of the task to be executed has the specific skill;
5) the degree of matching between the urgency of the task to be executed and the time for completing the number of tasks currently allocated;
6) the degree of matching between the urgency of the task to be executed and the work and rest time of the object to be executed.
In one example, the task to be executed is task 1, the number of task performers required to complete task 1 is 3, the time required to complete the task to be executed is 5 working days, and the priority of the urgency level of the task to be executed is the highest, that is, the priority of task 1 is the highest for all tasks; and the task to be executed requires a specific skill, i.e., english reading and writing capability.
The number of objects to be executed is 5 (object 1, object 2, object 3, object 4, object 5), wherein 2 objects (object 1 and object 2) currently have no assigned task, two 3 objects (object 3, object 4, object 5) have assigned tasks, and the time for completing the currently assigned tasks respectively needs 1 working day (object 3), 2 working days (object 4), and 2 working days (object 5); the work and rest time of the object to be executed is respectively nine nights and five nights; of the 5 objects, 4 objects (object 1, object 2, object 3, object 4) have english read/write capability, wherein the 4 objects have english read/write capability, and 2 objects have assigned tasks, one needs 1 working day for completion (object 3), and one needs 2 two working days for completion (object 4).
As can be seen from the above example, the specific skill of task 1 matches with object 1, object 2, and object 3, the time required for task 1 is 5 working days, and of the current 5 objects, object 1 and object 2 are completely matched, while the currently assigned task completion time of object 3, object 4, and object 3 of object 5 is the shortest, so that object 3 is more suitable for current task 1 than object 4 and object 5, that is, the most matched time between the currently assigned task number of the current 5 objects and the time required for completing the task to be executed is object 1, object 2, and object 3; for the matching degree of the time required for completing the task to be executed and the work and rest time of the object to be executed, and the matching degree of the urgency degree of the task to be executed and the time for completing the number of the currently allocated tasks, the matching degree of the urgency degree of the task to be executed and the work and rest time of the object to be executed is based on the time relationship, and the object 1, the object 2 and the object 3 with the highest matching degree are also the object 1, the object 2 and the object 3.
It can be seen from the above examples that in the present application, tasks and objects can be matched from multiple dimensions, and the objects to be executed are determined according to the matching degree, so that the tasks are more reasonably and efficiently dispatched, and the problems of low efficiency and easy error caused by manual task dispatching in the prior art are avoided. Of course, the above is only an example, and the matching degree of the specific task and the corresponding task information, the object and the task information of the object needs to be matched correspondingly according to the actual requirement.
Step 204: selecting a first target object from objects of the task to be executed according to the matching degree;
as can be seen from the above example, the objects 1, 2, and 3 that match the task 1 to the highest degree are the objects 1, 2, and 3, and thus the objects 1, 2, and 3 are the first target objects.
Step 206: a task is served to the first target object.
As can be seen from the above example, the task 1 is sent to the object 1, the object 2, and the object 3.
In an optional implementation manner of the embodiment of the present application, the selecting a first target object from the objects to be executed with the task according to the matching degree, which is referred to in step 204 of the present application, as shown in fig. 3, includes:
step 302: selecting a second target object from the objects of the task to be executed according to the matching degree;
step 304: sequencing the second target objects according to the number of the tasks which are distributed currently;
step 306: and determining the first target object from the sequenced second target objects according to the number of task performers required for completing the task to be performed.
With regard to the above steps 302 to 306, in a specific example, if the number of the current second target objects exceeds the number of task performers required to complete the task to be performed, the second target objects need to be sorted according to the number of currently assigned tasks, and an object with a smaller number of assigned tasks is selected as the first target object. The smaller the number of assigned tasks, the more likely the object can receive new tasks, and therefore, the more reasonable the task can be dispatched by the above-mentioned manner of steps 302 to 306.
In an optional implementation manner of the embodiment of the present application, the method provided in the embodiment of the present application further may include:
and under the condition that a plurality of objects with the same sorting level appear in the sorted second target objects and the plurality of objects meet the condition of the first target object, randomly selecting the objects from the plurality of objects to determine the first target object.
It can be seen that if the task information of the plurality of objects is consistent and all of the task information satisfies the first task information, one object is randomly selected from the plurality of objects as the first target object. By the method, the selection of more objects can be avoided, the waste of resources is avoided, and the task dispatching can be efficiently completed.
In an optional implementation manner of the embodiment of the present application, before acquiring the task information, the method provided in the embodiment of the present application further may include:
examining and approving the task to be executed according to a preset examination and approval mode; wherein, the preset approval mode comprises at least one of the following items: presetting examination and approval contents, presetting an examination and approval process and presetting examination and approval personnel.
The approval process is to ensure that the task can be accurately and efficiently dispatched in the follow-up process.
The following explains the present application with reference to a specific implementation manner of an embodiment of the present application, and the specific implementation manner provides an intelligent task dispatching method, which includes the steps of:
step 11, acquiring the work and rest time information of all members of the enterprise and public institution, and preparing for dispatching subsequent tasks;
step 12, preparing for some specific tasks needing to be approved by a docking form engine and/or an approval engine;
the docked task approval can be configured in a self-defined manner through a form engine and an approval engine, and the configuration includes self-definition without limitation to approval contents, approval processes and personnel self-definition;
step 13, configuring the special skills of each task receiving member to prepare for subsequently distributing special job tasks;
step 14, inputting a source for the task, wherein the source can include but is not limited to the number of objects required by the task, the urgency degree of the task, the time required to complete the task, whether a specific skill object is required, the number of tasks of the current object, the completion state and other information;
step 15, managing the input conditions through the tasks, and according to the required objects of the existing tasks, the emergency degree of the tasks, the time required to complete the tasks, the condition of the objects requiring specific skills, the number of the tasks of all the current objects, the completion state, the work and rest time and other information, meeting all the input conditions within the work and rest time and the object with the least number of the tasks.
Wherein, the task is randomly selected to be distributed by one person with the same occurrence condition.
An embodiment of the present application provides a task dispatching device, as shown in fig. 4, the device includes:
a first obtaining module 42, configured to obtain first task information of a task to be executed; wherein the first task information comprises at least one of: the number of task performers required to complete the task to be performed, the time required to complete the task to be performed, whether the task to be performed requires specific skills, and the urgency of the task to be performed;
a second obtaining module 44, configured to obtain second task information of an object of a task to be executed; wherein the second task information includes at least one of: the number of the objects of the task to be executed, the time for completing the number of the currently distributed tasks, the work and rest time of the objects of the task to be executed, and whether the objects of the task to be executed have specific skills;
and the dispatching module 46 is used for dispatching the task to the object to be executed according to the first task information and the second task information.
With the task dispatching device provided by the embodiment of the application, the first task information comprises at least one of the following items: the number of task performers required to complete the task to be performed, the time required to complete the task to be performed, whether the task to be performed requires specific skills, and the urgency of the task to be performed; the second task information includes at least one of: the task dispatching method comprises the steps of counting the number of objects to be subjected to task execution, completing the time of the currently distributed number of tasks, completing the work and rest time of the objects to be subjected to task execution, and judging whether the objects to be subjected to task execution have specific skills, namely, dispatching the tasks to the objects to be subjected to task execution according to first task information and second task information, namely, dispatching the tasks to the objects to be subjected to task execution can be considered from multiple dimensions, and then automatically dispatching the tasks to the objects to be subjected to task execution, so that the technical problem that task dispatching efficiency is low due to the fact that task dispatching is carried out in a manual mode in the prior art is solved.
In an optional implementation manner of the embodiment of the present application, as shown in fig. 5, the dispatch module 46 provided in the embodiment of the present application further includes:
a determining unit 52, configured to determine a matching degree of the first task information and the second task information;
a selecting unit 54 for selecting a first target object from objects of the task to be performed according to the matching degree;
a dispatching unit 56 for dispatching the task to the first target object.
In an optional implementation manner of the embodiment of the present application, the selecting unit 54 provided in the embodiment of the present application, as shown in fig. 6, further may include:
selection subunit 62: the system is used for selecting a second target object from objects of the task to be executed according to the matching degree;
ordering subunit 64: the task scheduling system is used for sequencing the second target objects according to the number of tasks which are distributed currently;
the determination subunit 66: and the method is used for determining the first target object from the sequenced second target objects according to the number of task performers required for completing the task to be performed.
In an optional implementation manner of the embodiment of the present application, an apparatus provided in the embodiment of the present application may further include: and the processing module is used for randomly selecting an object from the plurality of objects to determine the first target object under the condition that the plurality of objects with the same sorting level appear in the sorted second target objects and the plurality of objects meet the condition of the first target object.
In an optional implementation manner of the embodiment of the present application, an apparatus provided in the embodiment of the present application may further include: the pre-examination module is used for examining and approving the task to be executed according to a preset examination and approval mode; wherein, the preset approval mode comprises at least one of the following items: presetting examination and approval contents, presetting an examination and approval process and presetting examination and approval personnel.
The embodiment of the present application further provides an electronic device, as shown in fig. 7, which includes a processor 701, a communication interface 702, a memory 703 and a communication bus 704, where the processor 701, the communication interface 702, and the memory 703 complete mutual communication through the communication bus 704,
a memory 703 for storing a computer program;
the processor 701, when executing the program stored in the memory 703, implements the method steps of fig. 1, which function as the method steps of fig. 1.
The communication bus mentioned in the above terminal may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 7, but this is not intended to represent only one bus or type of bus.
The communication interface is used for communication between the terminal and other equipment.
The Memory may include a Random Access Memory (RAM) or a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; the Integrated Circuit may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, a discrete Gate or transistor logic device, or a discrete hardware component.
In yet another embodiment provided by the present application, there is also provided a computer-readable storage medium having stored therein instructions, which when run on a computer, cause the computer to perform the task serving method described in any of the above embodiments.
In yet another embodiment provided by the present application, there is also provided a computer program product containing instructions which, when run on a computer, cause the computer to perform the task serving method of any of the above embodiments.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
The above description is only for the preferred embodiment of the present application, and is not intended to limit the scope of the present application. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application are included in the protection scope of the present application.
Claims (10)
1. A task dispatching method is characterized by comprising the following steps:
acquiring first task information of a task to be executed; wherein the first task information comprises at least one of: the number of task performers required to complete the task to be performed, the time required to complete the task to be performed, whether the task to be performed requires specific skills, and the urgency of the task to be performed;
acquiring second task information of an object of a task to be executed; wherein the second task information comprises at least one of: the number of the objects of the task to be executed, the time for completing the number of the currently distributed tasks, the work and rest time of the objects of the task to be executed, and whether the objects of the task to be executed have the specific skills;
and dispatching a task to the object of the task to be executed according to the first task information and the second task information.
2. The method of claim 1, wherein the dispatching the task to the object to be performed according to the first task information and the second task information comprises:
determining the matching degree of the first task information and the second task information;
selecting a first target object from the objects of the task to be executed according to the matching degree;
dispatching the task to the first target object.
3. The method of claim 2, wherein determining the degree of match between the first task information and the second task information comprises at least one of:
the matching degree between the number of the task performers required for completing the task to be performed and the number of the objects of the task to be performed;
the matching degree of the time required for completing the task to be executed and the time for completing the number of the currently distributed tasks;
the matching degree of the time required for completing the task to be executed and the work and rest time of the object of the task to be executed;
whether the task to be executed needs a matching degree of a specific skill and whether an object of the task to be executed has the specific skill;
the degree of matching between the urgency of the task to be executed and the time for completing the number of currently allocated tasks;
and the matching degree of the urgency degree of the task to be executed and the work and rest time of the object of the task to be executed.
4. The method according to claim 2 or 3, wherein the selecting a first target object from the objects of the task to be executed according to the matching degree comprises:
selecting a second target object from the objects of the task to be executed according to the matching degree;
sequencing the second target objects according to the number of tasks which are distributed currently;
and determining the first target object from the sequenced second target objects according to the number of the task performers required for completing the task to be performed.
5. The method of claim 4, further comprising:
and under the condition that a plurality of objects with the same sorting level appear in the sorted second target objects and the plurality of objects meet the condition of the first target object, randomly selecting an object from the plurality of objects to determine the first target object.
6. The method of claim 1, prior to said obtaining task information, comprising:
examining and approving the task to be executed according to a preset examination and approval mode; wherein the preset approval mode comprises at least one of the following items: presetting examination and approval contents, presetting an examination and approval process and presetting examination and approval personnel.
7. A task dispatching device, comprising:
the first acquisition module is used for acquiring first task information of a task to be executed; wherein the first task information comprises at least one of: the number of task performers required to complete the task to be performed, the time required to complete the task to be performed, and whether the task to be performed requires particular skills; the urgency of the task to be executed;
the second acquisition module is used for acquiring second task information of an object of the task to be executed; wherein the second task information comprises at least one of: the number of the objects of the task to be executed, the time for completing the number of the currently distributed tasks, the work and rest time of the objects of the task to be executed, and whether the objects of the task to be executed have the specific skills;
and the dispatching module is used for dispatching tasks to the objects of the tasks to be executed according to the first task information and the second task information.
8. The apparatus of claim 7, wherein the dispatch module comprises:
a determining unit, configured to determine a matching degree of the first task information and the second task information;
the selection unit is used for selecting a first target object from the objects of the task to be executed according to the matching degree;
and the dispatching unit is used for dispatching the task to the first target object.
9. An electronic device is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor and the communication interface are used for realizing mutual communication by the memory through the communication bus;
a memory for storing a computer program;
a processor for implementing the method steps of any of claims 1-6 when executing a program stored in the memory.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111086123.8A CN113537845A (en) | 2021-09-16 | 2021-09-16 | Task distribution method and device, electronic equipment and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111086123.8A CN113537845A (en) | 2021-09-16 | 2021-09-16 | Task distribution method and device, electronic equipment and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113537845A true CN113537845A (en) | 2021-10-22 |
Family
ID=78092725
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111086123.8A Pending CN113537845A (en) | 2021-09-16 | 2021-09-16 | Task distribution method and device, electronic equipment and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113537845A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116739820A (en) * | 2023-08-16 | 2023-09-12 | 广东卓柏信息科技有限公司 | Block chain-based data processing method and data processing system |
| CN116739316A (en) * | 2023-08-14 | 2023-09-12 | 交通运输部水运科学研究所 | Automatic dispatching method and system for emergency tasks |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140180741A1 (en) * | 2012-12-20 | 2014-06-26 | Abb Technology Ag | System and method for automatic allocation of mobile resources to tasks |
| CN112396270A (en) * | 2019-08-16 | 2021-02-23 | 阿里巴巴集团控股有限公司 | Task scheduling method |
| CN113283749A (en) * | 2021-05-26 | 2021-08-20 | 深圳前海微众银行股份有限公司 | Task distribution method, device, equipment, storage medium and program product |
-
2021
- 2021-09-16 CN CN202111086123.8A patent/CN113537845A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140180741A1 (en) * | 2012-12-20 | 2014-06-26 | Abb Technology Ag | System and method for automatic allocation of mobile resources to tasks |
| CN112396270A (en) * | 2019-08-16 | 2021-02-23 | 阿里巴巴集团控股有限公司 | Task scheduling method |
| CN113283749A (en) * | 2021-05-26 | 2021-08-20 | 深圳前海微众银行股份有限公司 | Task distribution method, device, equipment, storage medium and program product |
Non-Patent Citations (1)
| Title |
|---|
| 孟秀丽: "《协同设计支持环境及冲突消解理论与方法》", 30 April 2010 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116739316A (en) * | 2023-08-14 | 2023-09-12 | 交通运输部水运科学研究所 | Automatic dispatching method and system for emergency tasks |
| CN116739316B (en) * | 2023-08-14 | 2023-10-20 | 交通运输部水运科学研究所 | Automatic dispatching method and system for emergency tasks |
| CN116739820A (en) * | 2023-08-16 | 2023-09-12 | 广东卓柏信息科技有限公司 | Block chain-based data processing method and data processing system |
| CN116739820B (en) * | 2023-08-16 | 2024-01-19 | 广东卓柏信息科技有限公司 | Block chain-based data processing method and data processing system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107743697B (en) | Action orchestration in fault tolerant domains | |
| US8209691B1 (en) | System for sending batch of available request items when an age of one of the available items that is available for processing exceeds a predetermined threshold | |
| CN110837410A (en) | Task scheduling method and device, electronic equipment and computer readable storage medium | |
| CN113537845A (en) | Task distribution method and device, electronic equipment and computer readable storage medium | |
| US20180332102A1 (en) | Cloud-based system for collaborating engineering, operations, maintenance, project management, procurement and vendor data and activities | |
| US20140215472A1 (en) | Task management | |
| CN111582815A (en) | Engineering management method and device for nuclear power station, terminal equipment and storage medium | |
| CN113407973B (en) | Software function authority management method, system, server and storage medium | |
| CN113094224B (en) | Server asset management method and device, computer equipment and storage medium | |
| CN111125240A (en) | Distributed transaction implementation method and device, electronic equipment and storage medium | |
| CN115511292B (en) | Production scheduling method, system, intelligent terminal and storage medium | |
| CN111353762A (en) | Method and system for managing regulations and regulations | |
| CN114564210A (en) | Copy deployment method, device, system, electronic equipment and storage medium | |
| CN114782013A (en) | Request processing method and device for process modeling and electronic equipment | |
| US20210304220A1 (en) | Complex sourcing system | |
| CN113989058A (en) | Service generation method and device | |
| CN110290172B (en) | Container application cloning method and device, computer equipment and storage medium | |
| CN113867778A (en) | Method and device for generating mirror image file, electronic equipment and storage medium | |
| CN114546425A (en) | Model deployment method and device, electronic equipment and storage medium | |
| US20200402008A1 (en) | System and Method for Electronic Mail Approval Paths | |
| CN111651259A (en) | Dependency relationship-based system management method and device and storage medium | |
| CN113450062A (en) | Project information processing method, system, electronic device and storage medium | |
| CN107967549B (en) | Multi-process task processing device and method | |
| US20200065733A1 (en) | Method and system for estimating efforts for software managed services production support engagements | |
| CN112256773A (en) | Enterprise management system docking method, electronic device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20211022 |
|
| RJ01 | Rejection of invention patent application after publication |