WO2019205370A1 - Dispositif électronique, procédé de distribution de tâche et support d'informations - Google Patents

Dispositif électronique, procédé de distribution de tâche et support d'informations Download PDF

Info

Publication number
WO2019205370A1
WO2019205370A1 PCT/CN2018/102088 CN2018102088W WO2019205370A1 WO 2019205370 A1 WO2019205370 A1 WO 2019205370A1 CN 2018102088 W CN2018102088 W CN 2018102088W WO 2019205370 A1 WO2019205370 A1 WO 2019205370A1
Authority
WO
WIPO (PCT)
Prior art keywords
task
score
assigned
remaining
processing
Prior art date
Application number
PCT/CN2018/102088
Other languages
English (en)
Chinese (zh)
Inventor
王磊
Original Assignee
平安科技（深圳）有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 平安科技（深圳）有限公司 filed Critical 平安科技（深圳）有限公司
Publication of WO2019205370A1 publication Critical patent/WO2019205370A1/fr

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/063112—Skill-based matching of a person or a group to a task

Definitions

  • the present application relates to the field of data processing technologies, and in particular, to an electronic device, a method for allocating tasks, and a storage medium.
  • the assignment of tasks is generally performed by the system according to the established strategy to assign tasks to various processing personnel in the team, for example, assigning tasks to the processing personnel who have the largest difference in the proportion of assigned tasks with the current relative burden ratio distance setting (ie, distance presets)
  • the maximum load gap is the largest: for each type of task set the team and the team members in the task arrangement ratio, team A has two A and B, the proportion of A and B set is 67% and 33%, then the first task comes over, because Have not assigned tasks, will be assigned to the task assignment ratio is high, that is assigned to A; when the second task comes over, A currently has a task, B has no task, as the relative burden ratio of A is 100%, B relative The burden ratio is 0%, so the second task is assigned to B.
  • a and B currently have tasks, and the relative burden ratio of A and B is 50%, but the distance of A is set. 67% is the largest, so the task is assigned to A; when the fourth task comes over, the current relative burden ratio is calculated to be 66.6%, and the current relative burden ratio of B is 33.3%.
  • a task is assigned to four, and so on.
  • the purpose of the present application is to provide an electronic device, a method for distributing a task, and a storage medium, which are intended to comprehensively evaluate the task situation of each assigned object, and assign the task to a person with comprehensive processing capability to ensure the timeliness of the processing. .
  • the present application provides an electronic device including a memory and a processor coupled to the memory, the memory storing a processing system operable on the processor, the processing The system implements the following steps when executed by the processor:
  • a third calculating step acquiring the number of task processing of the assigned object in the past preset time, and calculating the processing task score according to the number of task processing of the assigned object and the number of remaining tasks;
  • the analysis step when assigning a task, analyzing whether there is an allocation object whose remaining task score is greater than or equal to 0;
  • a first allocation step if not, assigning a task to a pre-allocated allocation object
  • a second allocation step if yes, in the allocation object whose remaining task score is greater than or equal to 0, the current task is assigned according to the weighting score and the predetermined allocation rule according to the weighting score calculated by the pre-allocation score, the remaining task score, and the processing task score Assign the corresponding assignment object.
  • the present application further provides a method for allocating tasks, and the method for assigning tasks includes:
  • S2 acquiring the number of remaining tasks of the allocated object, and calculating a remaining task score corresponding to the allocated object according to the number of remaining tasks of the allocated object;
  • the present application also provides a computer readable storage medium having stored thereon a processing system, the processing system being executed by a processor to implement the steps of the method of assigning tasks as described above.
  • the present application Before assigning a task to each assigned object in the team, the present application first analyzes the situation in which the assigned object is currently pre-assigned, the remaining unprocessed task, and the assigned object in the past preset time. The task processing situation, and calculating the corresponding score according to the situation, when the task is assigned, if there are multiple assignment objects whose number of remaining tasks is less than or equal to a certain value, the calculation is based on the pre-dispatch score, the remaining task score, and the processing task score.
  • the current task is assigned to the corresponding assignment object according to the weight score and the predetermined distribution rule, and the task situation of each assignment object can be comprehensively evaluated, and the task is assigned to the person with comprehensive processing capability. To ensure the timeliness of processing.
  • FIG. 1 is a schematic diagram of a hardware architecture of an embodiment of an electronic device according to the present application.
  • FIG. 2 is a schematic flowchart diagram of an embodiment of a method for allocating tasks according to the present application.
  • FIG. 1 is a schematic diagram of an application environment of an embodiment of an electronic device of the present application.
  • the electronic device 1 is an apparatus capable of automatically performing numerical calculation and/or information processing in accordance with an instruction set or stored in advance.
  • the electronic device 1 may be a computer, a single network server, a server group composed of multiple network servers, or a cloud-based cloud composed of a large number of hosts or network servers, where cloud computing is a type of distributed computing.
  • a super virtual computer consisting of a group of loosely coupled computers.
  • the electronic device 1 may include, but is not limited to, a memory 11 communicably connected to each other through a system bus, a processor 12, and a network interface 13, and the memory 11 stores a processing system operable on the processor 12. It should be noted that FIG. 1 only shows the electronic device 1 having the components 11-13, but it should be understood that not all illustrated components are required to be implemented, and more or fewer components may be implemented instead.
  • the memory 11 includes a memory and at least one type of readable storage medium.
  • the memory provides a cache for the operation of the electronic device 1;
  • the readable storage medium may be, for example, a flash memory, a hard disk, a multimedia card, a card type memory (eg, SD or DX memory, etc.), a random access memory (RAM), a static random access memory (SRAM).
  • a non-volatile storage medium such as a read only memory (ROM), an electrically erasable programmable read only memory (EEPROM), a programmable read only memory (PROM), a magnetic memory, a magnetic disk, an optical disk, or the like.
  • the readable storage medium may be an internal storage unit of the electronic device 1, such as a hard disk of the electronic device 1; in other embodiments, the non-volatile storage medium may also be external to the electronic device 1.
  • a storage device such as a plug-in hard disk equipped with an electronic device 1, a smart memory card (SMC), a Secure Digital (SD) card, a flash card, or the like.
  • the readable storage medium of the memory 11 is generally used to store an operating system and various types of application software installed in the electronic device 1, such as program code for storing a processing system in an embodiment of the present application. Further, the memory 11 can also be used to temporarily store various types of data that have been output or are to be output.
  • the processor 12 may be a Central Processing Unit (CPU), controller, microcontroller, microprocessor, or other data processing chip in some embodiments.
  • the processor 12 is typically used to control the overall operation of the electronic device 1, such as performing control and processing related to data interaction or communication with other devices.
  • the processor 12 is configured to run program code or process data stored in the memory 11, such as running a processing system or the like.
  • the network interface 13 may comprise a wireless network interface or a wired network interface, which is typically used to establish a communication connection between the electronic device 1 and other electronic devices.
  • the processing system is stored in the memory 11 and includes at least one computer readable instruction stored in the memory 11, the at least one computer readable instruction being executable by the processor 12 to implement the methods of various embodiments of the present application;
  • the at least one computer readable instruction can be classified into different logic modules depending on the functions implemented by its various parts.
  • the pre-dispatching represents that the assignment object is currently pre-dispatched, and the task may be first dispatched according to a pre-defined strategy in the task system.
  • the pre-deployed strategy may be pre-dispatched according to the current task number of each allocation object, and the probability that the current task number is less pre-dispatched is larger; or the pre-dispatch may be performed according to the efficiency of each allocation object processing task.
  • the higher the efficiency of processing a task the greater the probability of being pre-dispatched. It may also be based on the current number of tasks of each assigned object and the efficiency of the processing task. The lesser the current task number of the assigned object, the more efficient the task. The higher the probability of being pre-dispatched, the more, and so on, there is no limit here.
  • a task is pre-assigned to one assignment object, and the assignment object is currently assigned to one task, and the corresponding pre-dispatch score is 1 point. If the assignment object is not currently assigned to the task, the corresponding assignment object is pre-dispatched. The score is 0 points; or the task is pre-assigned to the corresponding assignment object according to the distribution ratio preset by the task system (for example, the task is divided into 5, each of which is 20%), and the assignment object is currently assigned to a certain proportion of tasks. Then, the corresponding pre-dispatch score is 1 point, and the assigned object is not currently assigned to the task, and the corresponding assigned object pre-dispatch score is 0 points.
  • the number of remaining tasks represents the remaining unprocessed tasks of the allocation object. The smaller the number of remaining tasks, the higher the remaining task scores, and the more the number of remaining tasks, the lower the remaining task scores.
  • the calculation rule of the remaining task score may be pre-determined, and the remaining task score corresponding to the allocation object is calculated according to the number of remaining tasks of the allocation object and the calculation rule of the remaining task score.
  • the remaining task score 1 - (number of remaining tasks / n) * 0.1, where n is a conversion parameter, and the value of n can be predetermined according to different actual situations, for example, in an actual case, if the number of remaining tasks is 50 tasks are demarcation points, then the value of n can be 1/10 of 50, which is 5; if the number of remaining tasks is 30 points, the value of n can be 1/10 of 30. That is, 3, etc., of course, it is also possible to reserve the value of n as other values, and there is no excessive limit here.
  • remaining task score 1 - (number of remaining tasks / n) * 0.1, preferably, n is 5, that is, the number of remaining tasks of the assigned object is equal to 50, the remaining task score is 0, and the number of remaining tasks is less than 50, the remaining task score is greater than 0, the remaining task number is greater than 50, and the remaining task score is less than 0.
  • a third calculating step acquiring the number of task processing of the assigned object in the past preset time, and calculating the processing task score according to the number of task processing of the assigned object and the number of remaining tasks;
  • the number of task processing of the assigned object in the past preset time represents the situation in which the assigned object recently processed the task. The more the number of task processing of the assigned object in the past preset time, the less the number of remaining tasks, the more the processing task score is. high.
  • the calculation rule of the processing task score may be pre-established, and the processing task score corresponding to the allocation object is calculated according to the number of task processing of the allocation object in the past preset time, the number of remaining tasks, and the calculation rule of the processing task score.
  • the processing task score the number of task processing / (the number of task processing + the number of remaining tasks).
  • the past preset time is preferably 7 days.
  • the analysis step when assigning a task, analyzing whether there is an allocation object whose remaining task score is greater than or equal to 0;
  • a first allocation step if not, assigning a task to a pre-allocated allocation object
  • a second allocation step if yes, in the allocation object whose remaining task score is greater than or equal to 0, the current task is assigned according to the weighting score and the predetermined allocation rule according to the weighting score calculated by the pre-allocation score, the remaining task score, and the processing task score Assign the corresponding assignment object.
  • the allocation objects whose remaining task scores are greater than or equal to 0 are first filtered out, that is, the allocation objects whose remaining tasks are less than or equal to a certain value are filtered out, for example, the number of remaining tasks is less than or equal to the allocation objects of 50 tasks. Screen out and then conduct a comprehensive assessment. If the remaining task scores of all the assigned objects are less than 0, the allocation is performed according to the aforementioned pre-allocation case, and the tasks are equally distributed to the pre-allocated allocation objects. For the assigned objects whose remaining task score is greater than or equal to 0, the weight score for the comprehensive evaluation is calculated.
  • the assigned object with high pre-scoring score indicates that it is currently pre-dispatched; the higher the remaining task score, the less the number of remaining tasks; the higher the processing task score is. The more the number of recent task processing and the smaller the number of remaining tasks; the higher the weight score, the stronger the comprehensive ability of the assigned object to represent its processing tasks.
  • the predetermined allocation rule includes: if the remaining task score is greater than or equal to 0, the assigned task is assigned to the assigned object;
  • assignment of tasks is performed for the allocation objects whose scores of the plurality of remaining tasks are greater than or equal to 0.
  • the next step is not performed. If the task is not assigned, the operation is performed in the following order: in the multiple assignment objects whose remaining task score is greater than or equal to 0, analyze whether there is any allocation.
  • the weight score, the processing task score and the remaining task score of the object respectively correspond to the same, that is, whether the weight scores of the assigned objects are the same, and whether the processing task scores are the same, and whether the remaining task scores are the same;
  • the assignment tasks are assigned to the corresponding assignment objects in descending order of the pre-dispatch scores among the assignment objects that are identical in the above-mentioned three assignments ( The first allocation), that is, firstly assigned to the above three objects that are identical to each other but not pre-assigned to the task, for example, the task is assigned to the above three in order according to the pre-dispatch score from low to high. All the same, pre-dispatch assignments with a score of 0.
  • the allocation object of the first assigned task is removed, and further analysis is performed whether the weighting score of the assigned object and the processing task score are respectively the same, that is, whether the weighting scores of the assigned objects are the same, and whether the processing task scores are the same. ;
  • the two objects of the assigned object are respectively the same, then in the allocation object with multiple remaining task scores greater than or equal to 0 (if there is the first allocation, the assigned object of the first assigned task is removed), according to the remaining The task is assigned to the corresponding assigned object (second allocation) in order from highest to lowest;
  • the current task is assigned to the corresponding allocation object in order from the highest to the lowest in the processing task score; if not, the current task is assigned to the corresponding allocation object in descending order of the weighting score.
  • the predetermined allocation rule may further include: if the remaining task score is greater than or equal to 0, the assignment task is assigned to the assignment object; if the remaining task score is greater than or equal to 0, the assignment object is If there are multiple, the current task is assigned to the corresponding assigned object in order from the highest to the lowest.
  • the present application first analyzes the situation in which the assigned object is currently pre-assigned the task, the remaining unprocessed task, and the object allocated in the past preset time before assigning the task to each assigned object in the team.
  • the task processing situation, and calculating the corresponding score according to the situation when the task is assigned, if there are multiple assignment objects whose number of remaining tasks is less than or equal to a certain value, the calculation is based on the pre-dispatch score, the remaining task score, and the processing task score.
  • the weight score of the comprehensive evaluation the current task is assigned to the corresponding assignment object according to the weight score and the predetermined distribution rule, and the task situation of each assignment object can be comprehensively evaluated, and the task is assigned to the person with comprehensive processing capability. To ensure the timeliness of processing.
  • FIG. 2 is a schematic flowchart of an embodiment of a method for allocating tasks according to the present application.
  • the method for allocating tasks includes the following steps:
  • Step S1 before assigning the task, pre-assigning the current task to the allocation object in the task system, and calculating the pre-dispatch score of the assigned object after pre-dispatching;
  • the pre-dispatching represents that the assignment object is currently pre-dispatched, and the task may be first dispatched according to a pre-defined strategy in the task system.
  • the pre-deployed strategy may be pre-dispatched according to the current task number of each allocation object, and the probability that the current task number is less pre-dispatched is larger; or the pre-dispatch may be performed according to the efficiency of each allocation object processing task.
  • the higher the efficiency of processing a task the greater the probability of being pre-dispatched. It may also be based on the current number of tasks of each assigned object and the efficiency of the processing task. The lesser the current task number of the assigned object, the more efficient the task. The higher the probability of being pre-dispatched, the more, and so on, there is no limit here.
  • a task is pre-assigned to one assignment object, and the assignment object is currently assigned to one task, and the corresponding pre-dispatch score is 1 point. If the assignment object is not currently assigned to the task, the corresponding assignment object is pre-dispatched. The score is 0 points; or the task is pre-assigned to the corresponding assignment object according to the distribution ratio preset by the task system (for example, the task is divided into 5, each of which is 20%), and the assignment object is currently assigned to a certain proportion of tasks. Then, the corresponding pre-dispatch score is 1 point, and the assigned object is not currently assigned to the task, and the corresponding assigned object pre-dispatch score is 0 points.
  • Step S2 acquiring the number of remaining tasks of the allocation object, and calculating a remaining task score corresponding to the allocation object according to the number of remaining tasks of the allocation object;
  • the number of remaining tasks represents the remaining unprocessed tasks of the allocation object. The smaller the number of remaining tasks, the higher the remaining task scores, and the more the number of remaining tasks, the lower the remaining task scores.
  • the calculation rule of the remaining task score may be pre-determined, and the remaining task score corresponding to the allocation object is calculated according to the number of remaining tasks of the allocation object and the calculation rule of the remaining task score.
  • the remaining task score 1 - (number of remaining tasks / n) * 0.1, where n is a conversion parameter, and the value of n can be predetermined according to different actual situations, for example, in an actual case, if the number of remaining tasks is 50 tasks are demarcation points, then the value of n can be 1/10 of 50, which is 5; if the number of remaining tasks is 30 points, the value of n can be 1/10 of 30. That is, 3, etc., of course, it is also possible to reserve the value of n as other values, and there is no excessive limit here.
  • remaining task score 1 - (number of remaining tasks / n) * 0.1, preferably, n is 5, that is, the number of remaining tasks of the assigned object is equal to 50, the remaining task score is 0, and the number of remaining tasks is less than 50, the remaining task score is greater than 0, the remaining task number is greater than 50, and the remaining task score is less than 0.
  • Step S3 acquiring the number of task processing of the assigned object in the past preset time, and calculating the processing task score according to the number of task processing of the allocated object and the number of remaining tasks;
  • the number of task processing of the assigned object in the past preset time represents the situation in which the assigned object recently processed the task. The more the number of task processing of the assigned object in the past preset time, the less the number of remaining tasks, the more the processing task score is. high.
  • the calculation rule of the processing task score may be pre-established, and the processing task score corresponding to the allocation object is calculated according to the number of task processing of the allocation object in the past preset time, the number of remaining tasks, and the calculation rule of the processing task score.
  • the processing task score the number of task processing / (the number of task processing + the number of remaining tasks).
  • the past preset time is preferably 7 days.
  • Step S4 when assigning a task, analyzing whether there is an allocation object whose remaining task score is greater than or equal to 0;
  • Step S5 if no, assign the task to the pre-allocated allocation object
  • Step S6 if yes, in the allocation object whose remaining task score is greater than or equal to 0, the current task is assigned to the corresponding task according to the weight score and the predetermined distribution rule according to the weight score calculated by the pre-distribution score, the remaining task score, and the processing task score. Assignment object.
  • the allocation objects whose remaining task scores are greater than or equal to 0 are first filtered out, that is, the allocation objects whose remaining tasks are less than or equal to a certain value are filtered out, for example, the number of remaining tasks is less than or equal to the allocation objects of 50 tasks. Screen out and then conduct a comprehensive assessment. If the remaining task scores of all the assigned objects are less than 0, the allocation is performed according to the aforementioned pre-allocation case, and the tasks are equally distributed to the pre-allocated allocation objects. For the assigned objects whose remaining task score is greater than or equal to 0, the weight score for the comprehensive evaluation is calculated.
  • the assigned object with high pre-scoring score indicates that it is currently pre-dispatched; the higher the remaining task score, the less the number of remaining tasks; the higher the processing task score is. The more the number of recent task processing and the smaller the number of remaining tasks; the higher the weight score, the stronger the comprehensive ability of the assigned object to represent its processing tasks.
  • the predetermined allocation rule includes: if the remaining task score is greater than or equal to 0, the assigned task is assigned to the assigned object;
  • assignment of tasks is performed for the allocation objects whose scores of the plurality of remaining tasks are greater than or equal to 0.
  • the next step is not performed. If the task is not assigned, the operation is performed in the following order: in the multiple assignment objects whose remaining task score is greater than or equal to 0, analyze whether there is any allocation.
  • the weight score, the processing task score and the remaining task score of the object respectively correspond to the same, that is, whether the weight scores of the assigned objects are the same, and whether the processing task scores are the same, and whether the remaining task scores are the same;
  • the assignment tasks are assigned to the corresponding assignment objects in descending order of the pre-dispatch scores among the assignment objects that are identical in the above-mentioned three assignments ( The first allocation), that is, firstly assigned to the above three objects that are identical to each other but not pre-assigned to the task, for example, the task is assigned to the above three in order according to the pre-dispatch score from low to high. All the same, pre-dispatch assignments with a score of 0.
  • the allocation object of the first assigned task is removed, and further analysis is performed whether the weighting score of the assigned object and the processing task score are respectively the same, that is, whether the weighting scores of the assigned objects are the same, and whether the processing task scores are the same. ;
  • the two objects of the assigned object are respectively the same, then in the allocation object with multiple remaining task scores greater than or equal to 0 (if there is the first allocation, the assigned object of the first assigned task is removed), according to the remaining The task is assigned to the corresponding assigned object (second allocation) in order from highest to lowest;
  • the current task is assigned to the corresponding allocation object in order from the highest to the lowest in the processing task score; if not, the current task is assigned to the corresponding allocation object in descending order of the weighting score.
  • the predetermined allocation rule may further include: if the remaining task score is greater than or equal to 0, the assignment task is assigned to the assignment object; if the remaining task score is greater than or equal to 0, the assignment object is If there are multiple, the current task is assigned to the corresponding assigned object in order from the highest to the lowest.
  • the present application first analyzes the situation in which the assigned object is currently pre-assigned the task, the remaining unprocessed task, and the object allocated in the past preset time before assigning the task to each assigned object in the team.
  • the task processing situation, and calculating the corresponding score according to the situation when the task is assigned, if there are multiple assignment objects whose number of remaining tasks is less than or equal to a certain value, the calculation is based on the pre-dispatch score, the remaining task score, and the processing task score.
  • the weight score of the comprehensive evaluation the current task is assigned to the corresponding assignment object according to the weight score and the predetermined distribution rule, and the task situation of each assignment object can be comprehensively evaluated, and the task is assigned to the person with comprehensive processing capability. To ensure the timeliness of processing.
  • the present application also provides a computer readable storage medium having stored thereon a processing system, the processing system being executed by a processor to implement the steps of the method of assigning tasks as described above.
  • the foregoing embodiment method can be implemented by means of software plus a necessary general hardware platform, and of course, can also be through hardware, but in many cases, the former is better.
  • Implementation Based on such understanding, the technical solution of the present application, which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk,
  • the optical disc includes a number of instructions for causing a terminal device (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to perform the methods described in various embodiments of the present application.

Landscapes

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

Abstract

La présente invention concerne un dispositif électronique, un procédé de distribution de tâche et un support d'informations. Le procédé comprend les étapes consistant : avant distribution de tâche, à pré-répartir des tâches actuelles vers des objets de distribution dans un système de tâche et à calculer un score de pré-répartition ; à obtenir une quantité de tâches résiduelles des objets de distribution, et à calculer un score de tâche résiduelle conformément à la quantité des tâches résiduelles ; à obtenir des quantités de traitement de tâche des objets de distribution dans un temps passé prédéfini, et à calculer un score de traitement de tâche conformément aux quantités de traitement de tâche et à la quantité des tâches résiduelles ; pendant la distribution de tâche, si un objet de distribution dont le score de tâche résiduelle est supérieur ou égal à 0 existe, à calculer un score de poids conformément au score de pré-répartition, le score de tâche résiduelle et le score de traitement de tâche, et à répartir la tâche actuelle vers un objet de distribution correspondant conformément au score de poids et à une règle de distribution prédéterminée. Conformément au procédé, la condition de tâche de chaque objet de distribution peut être évaluée de manière complète, et des tâches sont distribuées à des équipes avec une forte capacité de traitement complète, de telle sorte que l'opportunité de traitement est assurée.
PCT/CN2018/102088 2018-04-24 2018-08-24 Dispositif électronique, procédé de distribution de tâche et support d'informations WO2019205370A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810374572.4 2018-04-24
CN201810374572.4A CN108805397A (zh) 2018-04-24 2018-04-24 电子装置、分配任务的方法及存储介质

Publications (1)

Publication Number Publication Date
WO2019205370A1 true WO2019205370A1 (fr) 2019-10-31

Family

ID=64093816

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/102088 WO2019205370A1 (fr) 2018-04-24 2018-08-24 Dispositif électronique, procédé de distribution de tâche et support d'informations

Country Status (2)

Country Link
CN (1) CN108805397A (fr)
WO (1) WO2019205370A1 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110618855A (zh) * 2018-12-25 2019-12-27 北京时光荏苒科技有限公司 一种任务分配方法、装置、电子设备及存储介质
CN110599017A (zh) * 2019-08-29 2019-12-20 凡普数字技术有限公司 坐席任务分配方法、装置以及存储介质
CN112001659A (zh) * 2020-09-02 2020-11-27 平安养老保险股份有限公司 共享任务分配方法、装置、计算机设备及计算机可读介质
CN113240126A (zh) * 2021-01-13 2021-08-10 深延科技(北京)有限公司 标注管理方法、装置、设备及存储介质
CN116663853B (zh) * 2023-07-24 2023-10-24 太平金融科技服务（上海）有限公司 任务分派方法、装置、计算机设备和存储介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0685805A2 (fr) * 1994-05-31 1995-12-06 International Business Machines Corporation Procédé d'allocation pour générer un plan de production
CN105718317A (zh) * 2016-01-15 2016-06-29 浪潮(北京)电子信息产业有限公司 一种任务调度方法及装置
CN106529883A (zh) * 2016-11-23 2017-03-22 北京小度信息科技有限公司 分配数据对象的方法及装置
CN107092999A (zh) * 2016-11-08 2017-08-25 北京小度信息科技有限公司 任务处理方法及装置
CN107301485A (zh) * 2016-04-16 2017-10-27 深圳市唯德科创信息有限公司 工作任务自动分配的方法及系统
CN107545351A (zh) * 2016-06-29 2018-01-05 阿里巴巴集团控股有限公司 任务分配方法和装置

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10395205B2 (en) * 2010-03-05 2019-08-27 Oracle International Corporation Cost of change for adjusting long running order management fulfillment processes for a distributed order orchestration system
WO2014056076A1 (fr) * 2012-10-08 2014-04-17 Maintenance Assistant Inc. Système et procédé permettant de charger des actifs dans un système de gestion de maintenance
CN106339802A (zh) * 2016-08-24 2017-01-18 深圳市讯方技术股份有限公司 任务分配的方法和装置、电子设备
CN107392512B (zh) * 2016-11-25 2018-06-01 北京小度信息科技有限公司 任务分组方法和装置
CN107665401B (zh) * 2017-09-15 2020-06-26 平安科技（深圳）有限公司 一种任务分配方法、终端及计算机可读存储介质

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0685805A2 (fr) * 1994-05-31 1995-12-06 International Business Machines Corporation Procédé d'allocation pour générer un plan de production
CN105718317A (zh) * 2016-01-15 2016-06-29 浪潮(北京)电子信息产业有限公司 一种任务调度方法及装置
CN107301485A (zh) * 2016-04-16 2017-10-27 深圳市唯德科创信息有限公司 工作任务自动分配的方法及系统
CN107545351A (zh) * 2016-06-29 2018-01-05 阿里巴巴集团控股有限公司 任务分配方法和装置
CN107092999A (zh) * 2016-11-08 2017-08-25 北京小度信息科技有限公司 任务处理方法及装置
CN106529883A (zh) * 2016-11-23 2017-03-22 北京小度信息科技有限公司 分配数据对象的方法及装置

Also Published As

Publication number Publication date
CN108805397A (zh) 2018-11-13

Similar Documents

Publication Publication Date Title
WO2019205370A1 (fr) Dispositif électronique, procédé de distribution de tâche et support d'informations
CN110837410B (zh) 任务调度方法、装置、电子设备及计算机可读存储介质
CN108595157B (zh) 区块链数据的处理方法、装置、设备和存储介质
CN107291546B (zh) 一种资源调度方法及装置
CN109241772B (zh) 发票区块链记录方法、装置、区块链网关服务器和介质
US20170300359A1 (en) Policy based workload scaler
US8028197B1 (en) Problem ticket cause allocation
WO2019144556A1 (fr) Dispositif électronique, procédé d'attribution de dossier automatique pour dossiers de recouvrement de carte de crédit, et support de stockage
CN107729137B (zh) 服务器、区块链验签解密的方法及存储介质
US8924667B2 (en) Backup storage management
CN111352736A (zh) 大数据资源的调度方法、装置、服务器及存储介质
CN112579622B (zh) 业务数据的处理方法、装置及设备
CN103763346A (zh) 一种分布式资源调度方法及装置
CN111782383A (zh) 任务分配方法、服务器、电子终端及计算机可读存储介质
CN108510399B (zh) 投保单自动分配的方法、装置、计算机设备及存储介质
CN105989133A (zh) 事务处理方法及装置
CN114327894A (zh) 资源分配方法、装置、电子设备及存储介质
CN113590274A (zh) 任务分配方法及装置、任务处理系统
CN117435337A (zh) 资源配置方法、装置、电子设备及存储介质
CN116881003A (zh) 资源分配方法、装置、服务设备及存储介质
CN108920278B (zh) 资源分配方法及装置
US20190278644A1 (en) Managing node failures in a computing environment
CN111796934B (zh) 任务下发方法、装置、存储介质和电子设备
CN112884382B (zh) 云平台的资源配额管理方法、装置、设备以及存储介质
CN114756380A (zh) 云服务器部署方法、装置、电子设备及存储介质

Legal Events

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

Ref document number: 18916612

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

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

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

122 Ep: pct application non-entry in european phase

Ref document number: 18916612

Country of ref document: EP

Kind code of ref document: A1