CN110991846A - Service personnel task allocation method, device, equipment and storage medium - Google Patents
Service personnel task allocation method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN110991846A CN110991846A CN201911165575.8A CN201911165575A CN110991846A CN 110991846 A CN110991846 A CN 110991846A CN 201911165575 A CN201911165575 A CN 201911165575A CN 110991846 A CN110991846 A CN 110991846A
- Authority
- CN
- China
- Prior art keywords
- service
- service personnel
- personnel
- information
- target
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 230000006870 function Effects 0.000 claims description 11
- 230000000694 effects Effects 0.000 description 2
- 241001122767 Theaceae Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000006698 induction Effects 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
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
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a service personnel task allocation method, a service personnel task allocation device, service personnel task allocation equipment and a storage medium, wherein the service personnel task allocation method comprises the steps of acquiring order information and service personnel information, establishing a service personnel selection model according to the order information and the service personnel information based on a greedy algorithm, inputting the order information and the service personnel information into the service personnel selection model, and allocating tasks to designated service personnel through the service personnel selection model; the technical problems of low efficiency and unbalanced workload of service personnel caused by a manual distribution mode of service personnel task distribution in the prior art are solved, and an automatic, reasonable and efficient service personnel task distribution method is provided.
Description
Technical Field
The invention relates to the technical field of personnel task scheduling, in particular to a service personnel task allocation method, a service personnel task allocation device, service personnel task allocation equipment and a storage medium.
Background
With the rapid development of social economy and the continuous improvement of national living standard, the service requirements of people on various aspects in working life are continuously improved, for example, the transportation service industries such as air transportation, railway transportation and the like are also continuously improved in technology and service, and the better service quality is provided for consumers.
As the requirement of people on service is continuously improved, airport visitors and the like are more and more favored by consumers pursuing individuation and comfort, and as consumers are continuously increased, higher service efficiency requirements are provided for the operating efficiency of the visitors and the like.
Because task allocation of service personnel of the VIP hall is still stopped by manually allocating the tasks by means of pipeline personnel, the problems of incomplete data acquisition and unbalanced workload of the service personnel are caused, and the problems of low efficiency of task allocation and poor experience of consumers are caused.
Disclosure of Invention
The present invention is directed to solving at least one of the problems of the prior art. Therefore, the invention provides an automatic, reasonable and efficient service personnel task allocation method.
In a first aspect, an embodiment of the present invention provides a service person task allocation method, including:
acquiring order information and service personnel information;
establishing a service personnel selection model according to the order information and the service personnel information based on a greedy algorithm;
and inputting the order information and the service personnel information into the service personnel selection model, and distributing the tasks to the specified service personnel through the service personnel selection model.
The service personnel task allocation method of the embodiment of the invention at least has the following beneficial effects:
the embodiment of the invention provides a service personnel task allocation method, which comprises the steps of establishing a service personnel selection model according to order information and service personnel information based on a greedy algorithm by acquiring the order information and the service personnel information, inputting the order information and the service personnel information into the service personnel selection model, and allocating tasks to designated service personnel through the service personnel selection model; the technical problems of low efficiency and unbalanced workload of service personnel caused by a manual distribution mode of service personnel task distribution in the prior art are solved, and an automatic, reasonable and efficient service personnel task distribution method is provided.
According to the service personnel task allocation method of the other embodiments of the invention, the order information comprises at least one service item and the number of service personnel of each service item.
According to another embodiment of the present invention, the service person task assigning method includes: the service system comprises a service personnel ID, service statistics corresponding to the service personnel ID, the current service quantity corresponding to the service personnel ID, and the service upper limit quantity corresponding to the service personnel ID at the same time.
According to the service person task allocation method according to another embodiment of the present invention, the establishing a service person selection model according to the order information and the service person information based on a greedy algorithm specifically includes:
establishing an objective function:
the constraints of the objective function include a first constraint:
Sr_cjt≤Sr_lij(2)
the second constraint condition is as follows:
wherein Od isniIs the n-thThe number of service personnel of the ith service item in the order; srijThe service statistics of the jth service personnel in the ith service item;
average workload of service personnel for the ith service item; sr _ cjtThe current service quantity of the j server at the time t; sr _ lijThe upper limit number of services for the jth waiter; ar (Ar)niThe service person ID scheduled for the ith service item in the nth order.
According to another embodiment of the present invention, the step of inputting the order information and the service person information into the service person selection model, and the step of assigning the task to the designated service person through the service person selection model specifically includes:
obtaining the service personnel ID with the minimum service statistic according to the objective function, namely obtaining the target service personnel ID;
acquiring the current service quantity corresponding to the ID of the target service staff according to the ID of the target service staff, namely acquiring the current service quantity of the target service staff;
acquiring the service upper limit quantity corresponding to the ID of the target service staff according to the ID of the target service staff, namely acquiring the service upper limit quantity of the target service staff;
judging whether the current service quantity of the target service personnel meets the service upper limit quantity of the target service personnel or not;
if not, excluding the ID of the target service personnel from task allocation of the service personnel, and repeatedly acquiring the ID of the target service personnel;
if so, allocating the task to the ID of the target service personnel, and updating the current service quantity and the service statistic corresponding to the ID of the target service personnel;
judging whether the number of the IDs of the tasks which are allocated to the target service personnel meets the number of the service personnel;
if not, returning to continuously acquire the ID of the target service personnel;
and if so, outputting the ID of the target service personnel.
In a second aspect, an embodiment of the present invention provides a service person task assigning apparatus, including:
the information acquisition module is used for acquiring order information and service personnel information;
the model establishing module is used for establishing a service personnel selection model according to the order information and the service personnel information based on a greedy algorithm;
and the task allocation module is used for inputting the order information and the service personnel information into the service personnel selection model and allocating tasks to specified service personnel through the service personnel selection model.
In a third aspect, an embodiment of the present invention provides a service person task allocation apparatus, including:
at least one processor, and,
a memory communicatively coupled to the at least one processor, wherein,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the attendant task assignment method.
In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium storing computer-executable instructions for causing a computer to perform the service person task assignment method.
Drawings
FIG. 1 is a flowchart illustrating a method for assigning tasks to service personnel according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a method for assigning tasks to service personnel according to another embodiment of the present invention;
fig. 3 is a block diagram of an embodiment of a service staff task assignment device according to the present invention.
Detailed Description
The concept and technical effects of the present invention will be clearly and completely described below in conjunction with the embodiments to fully understand the objects, features and effects of the present invention. It is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all embodiments, and those skilled in the art can obtain other embodiments without inventive effort based on the embodiments of the present invention, and all embodiments are within the protection scope of the present invention.
In the description of the embodiments of the present invention, if "a number" is referred to, it means one or more, if "a plurality" is referred to, it means two or more, if "greater than", "less than" or "more than" is referred to, it is understood that the number is not included, and if "greater than", "lower" or "inner" is referred to, it is understood that the number is included. References to "first", "second", "third", etc., are to be understood as being used to distinguish between technical features and are not intended to indicate or imply relative importance or to implicitly indicate a number of indicated technical features or to implicitly indicate a precedence relationship of the indicated technical features.
The first embodiment is as follows:
referring to fig. 1, in an embodiment of the present invention, a service person task allocation method includes the following steps:
s100, obtaining order information and service staff information;
in some embodiments, the order information is a service demand from a consumer, one order information includes one or more service items, the order information also includes a corresponding service staff number in each service item, the determined service staff number is for better performing more reasonable arrangement according to the current service staff information, and an unreasonable task allocation situation is excluded, for example, the service staff number of one service item is 3, and the service staff number of the assignable task in the currently acquired service staff information is only two, in which case, the service staff task allocation may not be performed, and task allocation needs to be performed after more service staff information is acquired, so that the task allocation efficiency is improved.
In the embodiment of the invention, the service staff information comprises the service staff ID, the service statistics corresponding to the service staff ID, the current service quantity corresponding to the service staff ID and the service upper limit quantity corresponding to the service staff ID at the same time. The service personnel ID corresponds to one service personnel one by one, the number of service personnel of the currently allocable task can be obtained from the service personnel ID, the service statistics comprises the sum of the number of orders completed by the service personnel on the same day and the current service number, when the task is allocated to a certain service personnel, the service statistics is compared with the set service upper limit number, if the service statistics is larger than the service upper limit number, the task allocation is cancelled, the task allocation is carried out again, other service personnel are appointed, and the aim of preventing the too many tasks from being allocated to the same service personnel to cause the too heavy workload of the service personnel is fulfilled.
S200, establishing a service personnel selection model according to order information and service personnel information based on a greedy algorithm;
in the embodiment of the invention, the task person selection model is established based on a greedy algorithm. The task allocation problem of the service personnel aims at an optimal strategy of assigning the tasks to the service personnel based on the current resource state, and the problem is high in randomness and high in real-time requirement, so that the implementation condition of a greedy algorithm is met. Greedy algorithms mean that the overall optimal solution to the problem sought can be achieved by a series of locally optimal choices, greedy choices. This is the first basic element of the greedy algorithm and is the main difference between the greedy algorithm and the dynamic programming algorithm. The greedy selection is to make successive selection from top to bottom by an iterative method, the problem to be solved is simplified into a subproblem with smaller scale every time the greedy selection is made, and for a specific problem, to determine whether the problem has the property of greedy selection, we must prove that the greedy selection made at each step can finally obtain the optimal solution of the problem. Usually, an overall optimal solution of the problem can be firstly proved, which starts from greedy selection, and after greedy selection, the original problem is simplified into a similar subproblem with smaller scale. Then, a mathematical induction method is used for proving that an overall optimal solution of the problem can be finally obtained through greedy selection at each step.
In the embodiment of the invention, after obtaining the order information and the service personnel information, a service personnel selection model is established based on a greedy algorithm, which specifically comprises the following steps:
establishing an objective function:
the constraints of the objective function include a first constraint:
Sr_cjt≤Sr_lij(2)
the second constraint condition is as follows:
wherein Od isniThe number of service personnel for the ith service item in the nth order; srijService statistics of the jth service personnel in the ith service item;
for the average workload of the service personnel of the ith service item, the related information of each service personnel completing each service item can be obtained from the obtained service statistics of each service personnel, and then the average workload of the service personnel of the ith service item can be obtained through the service statistics
Sr_cjtIn the embodiment of the present invention, when distributing tasks of service personnel, the current service quantity of the service personnel needs to be considered comprehensively, and if the current service quantity of the service personnel is too large and the tasks are distributed to the service personnel, the order is finished, the time consumption is too long, and the order requirement cannot be solved in time. Sr _ lijUpper limit number of services for j-th attendant；ArniThe service person ID scheduled for the ith service item in the nth order.
And S300, inputting the order information and the service personnel information into a service personnel selection model, and distributing the tasks to the specified service personnel through the service personnel selection model.
Referring to FIG. 2, in some embodiments, order information is entered in the service person selection model, the order information including service items and a number of service persons per service item (i.e., Od)ni) And inputting service personnel information, including: service person ID, service statistic corresponding to service person ID (namely Sr)ij) Service person ID pair and corresponding current service quantity (i.e., Sr _ c)jt) The upper limit number of services (i.e., Sr _ l) corresponding to the service person IDij). When the task is distributed, each service item in the order information is traversed, and service personnel are distributed step by step for each service item. Specifically, the minimum service statistic Sr is output according to the obtained order information and service person informationijAnd is marked as a target attendant ID; obtaining the current service quantity of the target service personnel corresponding to the target service personnel ID according to the target service personnel ID, obtaining the service upper limit quantity of the target service personnel corresponding to the target service personnel ID, judging and comparing the current service quantity of the target service personnel with the service upper limit quantity of the target service personnel, namely judging whether the condition Sr _ c is metjt≤Sr_lijIf the constraint condition is met, outputting the target service person ID, allocating the service item in the order to the target service person ID, if the constraint condition is not met, excluding the target service person ID, and then re-acquiring the service person ID of the minimum service statistic, comparing the service statistic with the set service upper limit quantity when distributing the task to a certain service person, if the service statistic is greater than the service upper limit quantity, canceling the task distribution, re-distributing the task, and appointing other service persons, so as to prevent the too many tasks from being distributed to the same service person (namely the same service person ID) to cause the too heavy workload of the service person. After the task is allocated to the ID of the target service person, the service statistic S corresponding to the ID of the target service person is obtainedrijUpdating to prevent service statistics Sr from being updated in subsequent order or service item task assignmentsijResulting in its actual service statistics SrijService statistic Sr larger than recordijAnd, at the same time, judging whether the number of the target service person IDs satisfies the number of the service persons of the service item, i.e., judging whether the condition is satisfied
If the constraint condition is not met, returning to continuously acquiring another target service person ID, if the constraint condition is met, outputting the target service person ID, and at the moment, outputting the output target service person ID in a list form (one or more target service person IDs may exist).
In addition, in some embodiments, since the output corresponds to the minimum service statistic SrijSince there may exist a plurality of the same service statistics, the service person ID of (1) can obtain a plurality of the minimum service statistics SrijAt this time, one service person ID is randomly selected from the service person IDs as the target service person ID by a random selection method, so that the situation that the allocation process cannot be continued due to a plurality of results is avoided. In the above embodiment, if the service person task allocation method is applied to service person task allocation in an airport visitant hall, the service items may include service items such as guidance, baggage transportation, hall, tea, catering, and machine transportation. Obviously, the service person task allocation method provided in the embodiment of the present invention is not limited to be applied to airport visitant halls, and the service person task allocation method provided in the embodiment of the present invention may be applied to service person task allocation in other scenarios.
In summary, in the service person task allocation method provided by the embodiment of the present invention, a service person selection model is established according to order information and service person information based on a greedy algorithm by acquiring the order information and the service person information, the order information and the service person information are input into the service person selection model, and a task is allocated to a designated service person through the service person selection model; the technical problems of low efficiency and unbalanced workload of service personnel caused by a manual distribution mode of service personnel task distribution in the prior art are solved, and an automatic, reasonable and efficient service personnel task distribution method is provided.
Example two:
referring to fig. 3, an embodiment of the present invention provides a service person task allocation apparatus, including:
the information acquisition module is used for acquiring order information and service personnel information;
the model establishing module is used for establishing a service personnel selection model according to the order information and the service personnel information based on a greedy algorithm;
and the task allocation module is used for inputting the order information and the service personnel information into the service personnel selection model and allocating tasks to specified service personnel through the service personnel selection model.
In some embodiments, the order information acquired by the information acquisition module includes one or more service items, the order information further includes a number of service personnel corresponding to each service item, and the service personnel information acquired by the information acquisition module includes a service personnel ID, service statistics corresponding to the service personnel ID, a current service number corresponding to the service personnel ID, and a service upper limit number corresponding to the service personnel ID at the same time.
In some embodiments, after obtaining the order information and the service person information, the model building module builds the service person selection model based on a greedy algorithm, which specifically includes:
establishing an objective function:
the constraints of the objective function include a first constraint:
Sr_cjt≤Sr_lij(2)
the second constraint condition is as follows:
wherein Od isniThe number of service personnel for the ith service item in the nth order; srijService statistics of the jth service personnel in the ith service item;
average workload of service personnel for the ith service item; sr _ cjtThe current service quantity of the j-th waiter at the time t; sr _ lijThe upper limit number of services for the j server; ar (Ar)niThe service person ID scheduled for the ith service item in the nth order.
In some embodiments, the task assigning module assigns the task to the designated service person according to the service person selection model specifically includes:
obtaining the ID of the service person with the minimum service statistic according to the target function, namely obtaining the ID of the target service person;
acquiring the current service quantity corresponding to the ID of the target service staff according to the ID of the target service staff, namely acquiring the current service quantity of the target service staff;
acquiring the service upper limit quantity corresponding to the ID of the target service staff according to the ID of the target service staff, namely acquiring the service upper limit quantity of the target service staff;
judging whether the current service quantity of the target service personnel meets the service upper limit quantity of the target service personnel or not;
if not, excluding the ID of the target service personnel from the task allocation of the service personnel, and repeatedly acquiring the ID of the target service personnel;
if so, allocating the task to the ID of the target service personnel, and updating the current service quantity and the service statistic corresponding to the ID of the target service personnel;
judging whether the number of the IDs of the tasks which are allocated to the target service personnel meets the number of the service personnel;
if not, returning to continuously obtain the ID of the target service personnel;
and if so, outputting the ID of the target service person.
The process principle implemented by the service personnel task allocation device in the embodiment of the present invention may be mutually referred to and correspond to the process principle implemented by the service personnel task allocation method described in the first embodiment, and details are not described herein.
The service personnel task allocation device in the embodiment of the invention is provided with the information acquisition module, the model establishment module and the task allocation module, and allocates the tasks in the order information to the specified service personnel after the order information and the service personnel information are acquired, so that the automatic, reasonable and efficient service personnel task allocation device is provided.
Example three:
the embodiment of the invention provides service personnel task allocation equipment, which comprises:
the system comprises at least one processor and a memory communicatively connected with the at least one processor, wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute the service personnel task assignment method as described in embodiment one.
Example four:
the embodiment of the invention provides a computer-readable storage medium, wherein computer-executable instructions are stored in the computer-readable storage medium and used for enabling a computer to execute the service personnel task allocation method in the first embodiment.
The embodiments of the present invention have been described in detail with reference to the accompanying drawings, but the present invention is not limited to the above embodiments, and various changes can be made within the knowledge of those skilled in the art without departing from the gist of the present invention. Furthermore, the embodiments of the present invention and the features of the embodiments may be combined with each other without conflict.
Claims (8)
1. A service personnel task allocation method is characterized by comprising the following steps:
acquiring order information and service personnel information;
establishing a service personnel selection model according to the order information and the service personnel information based on a greedy algorithm;
and inputting the order information and the service personnel information into the service personnel selection model, and distributing the tasks to the specified service personnel through the service personnel selection model.
2. The service person task assignment method according to claim 1, wherein the order information includes at least one service item, and a number of service persons per the service item.
3. The service person task assignment method according to claim 2, wherein the service person information includes: the service system comprises a service personnel ID, service statistics corresponding to the service personnel ID, the current service quantity corresponding to the service personnel ID, and the service upper limit quantity corresponding to the service personnel ID at the same time.
4. The method for allocating task of service personnel as claimed in claim 3, wherein said building a service personnel selection model based on a greedy algorithm according to said order information and said service personnel information specifically comprises:
establishing an objective function:
the constraints of the objective function include a first constraint:
Sr_cjt≤Sr_lij(2)
the second constraint condition is as follows:
wherein Od isniThe number of service personnel for the ith service item in the nth order; srijThe service statistics of the jth service personnel in the ith service item;
average workload of service personnel for the ith service item; sr _ cjtThe current service quantity of the j server at the time t; sr _ lijThe upper limit number of services for the jth waiter; ar (Ar)niThe service person ID scheduled for the ith service item in the nth order.
5. The service person task assignment method according to claim 4, wherein the inputting the order information and the service person information into the service person selection model, assigning a task to a specified service person through the service person selection model specifically comprises:
obtaining the service personnel ID with the minimum service statistic according to the objective function, namely obtaining the target service personnel ID;
acquiring the current service quantity corresponding to the ID of the target service staff according to the ID of the target service staff, namely acquiring the current service quantity of the target service staff;
acquiring the service upper limit quantity corresponding to the ID of the target service staff according to the ID of the target service staff, namely acquiring the service upper limit quantity of the target service staff;
judging whether the current service quantity of the target service personnel meets the service upper limit quantity of the target service personnel or not;
if not, excluding the ID of the target service personnel from task allocation of the service personnel, and repeatedly acquiring the ID of the target service personnel;
if so, allocating the task to the ID of the target service personnel, and updating the current service quantity and the service statistic corresponding to the ID of the target service personnel;
judging whether the number of the IDs of the tasks which are allocated to the target service personnel meets the number of the service personnel;
if not, returning to continuously acquire the ID of the target service personnel;
and if so, outputting the ID of the target service personnel.
6. An attendant task assignment device, comprising:
the information acquisition module is used for acquiring order information and service personnel information;
the model establishing module is used for establishing a service personnel selection model according to the order information and the service personnel information based on a greedy algorithm;
and the task allocation module is used for inputting the order information and the service personnel information into the service personnel selection model and allocating tasks to specified service personnel through the service personnel selection model.
7. An attendant task assignment device, comprising:
at least one processor, and,
a memory communicatively coupled to the at least one processor, wherein,
the memory stores instructions executable by at least one processor to enable the at least one processor to perform the method of any one of claims 1 to 5.
8. A computer-readable storage medium having stored thereon computer-executable instructions for causing a computer to perform the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911165575.8A CN110991846B (en) | 2019-11-25 | 2019-11-25 | Service personnel task allocation method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911165575.8A CN110991846B (en) | 2019-11-25 | 2019-11-25 | Service personnel task allocation method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110991846A true CN110991846A (en) | 2020-04-10 |
| CN110991846B CN110991846B (en) | 2023-06-20 |
Family
ID=70086392
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911165575.8A Active CN110991846B (en) | 2019-11-25 | 2019-11-25 | Service personnel task allocation method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110991846B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111754121A (en) * | 2020-06-28 | 2020-10-09 | 北京百度网讯科技有限公司 | Task allocation method, device, equipment and storage medium |
| CN111815304A (en) * | 2020-09-14 | 2020-10-23 | 江苏开博科技有限公司 | Realization method of non-directional approval mechanism based on workload balancing election algorithm |
| CN112101714A (en) * | 2020-08-06 | 2020-12-18 | 长沙市到家悠享家政服务有限公司 | Task allocation method, device, equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080046895A1 (en) * | 2006-08-15 | 2008-02-21 | International Business Machines Corporation | Affinity dispatching load balancer with precise CPU consumption data |
| US20140165071A1 (en) * | 2012-12-06 | 2014-06-12 | Xerox Corporation | Method and system for managing allocation of tasks to be crowdsourced |
| CN108537619A (en) * | 2018-03-05 | 2018-09-14 | 新智数字科技有限公司 | A kind of method for allocating tasks, device and equipment based on maximum-flow algorithm |
| CN109087158A (en) * | 2018-06-12 | 2018-12-25 | 佛山欧神诺陶瓷有限公司 | A kind of method and its system summarizing and distribute automatically business opportunity by all kinds of means |
| CN109214731A (en) * | 2017-06-29 | 2019-01-15 | 菜鸟智能物流控股有限公司 | Method and device for distributing logistics orders and computer system |
-
2019
- 2019-11-25 CN CN201911165575.8A patent/CN110991846B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080046895A1 (en) * | 2006-08-15 | 2008-02-21 | International Business Machines Corporation | Affinity dispatching load balancer with precise CPU consumption data |
| US20140165071A1 (en) * | 2012-12-06 | 2014-06-12 | Xerox Corporation | Method and system for managing allocation of tasks to be crowdsourced |
| CN109214731A (en) * | 2017-06-29 | 2019-01-15 | 菜鸟智能物流控股有限公司 | Method and device for distributing logistics orders and computer system |
| CN108537619A (en) * | 2018-03-05 | 2018-09-14 | 新智数字科技有限公司 | A kind of method for allocating tasks, device and equipment based on maximum-flow algorithm |
| CN109087158A (en) * | 2018-06-12 | 2018-12-25 | 佛山欧神诺陶瓷有限公司 | A kind of method and its system summarizing and distribute automatically business opportunity by all kinds of means |
Non-Patent Citations (1)
| Title |
|---|
| 杨东林 等: ""在O2O情景下的送取货集成决策"", 《管理工程学报》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111754121A (en) * | 2020-06-28 | 2020-10-09 | 北京百度网讯科技有限公司 | Task allocation method, device, equipment and storage medium |
| CN111754121B (en) * | 2020-06-28 | 2024-02-06 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for task allocation |
| CN112101714A (en) * | 2020-08-06 | 2020-12-18 | 长沙市到家悠享家政服务有限公司 | Task allocation method, device, equipment and storage medium |
| CN112101714B (en) * | 2020-08-06 | 2023-12-29 | 长沙市到家悠享家政服务有限公司 | Task allocation method, device, equipment and storage medium |
| CN111815304A (en) * | 2020-09-14 | 2020-10-23 | 江苏开博科技有限公司 | Realization method of non-directional approval mechanism based on workload balancing election algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110991846B (en) | 2023-06-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Abdel-Basset et al. | Resource levelling problem in construction projects under neutrosophic environment | |
| CN110991846A (en) | Service personnel task allocation method, device, equipment and storage medium | |
| Braekers et al. | A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience | |
| US7555440B2 (en) | Immediate next task dispatch system and method | |
| Lee et al. | An optimization heuristic for the berth scheduling problem | |
| Lee et al. | Optimal capacity and operation design of a robot logistics system for the hotel industry | |
| Mattfeld et al. | Terminal operations management in vehicle transshipment | |
| WO2019001126A1 (en) | Task management method and device, computer device and storage medium | |
| CN110348613A (en) | Distribution Center Intelligent logistics management method and system | |
| Jütte et al. | Optimizing railway crew schedules with fairness preferences | |
| US20130290063A1 (en) | Optimizing Allocations In A Workforce Allocation Plan | |
| CN104077638B (en) | A kind of dispatching method of portal jib crane | |
| Sadjadi et al. | Augmented ε-constraint method in multiobjective staff scheduling problem: a case study | |
| Babiceanu et al. | Real-time holonic scheduling of material handling operations in a dynamic manufacturing environment | |
| CN108279980A (en) | Resource allocation methods and system and resource allocation terminal | |
| US8117051B2 (en) | Method for determining the number of available transport seats in a computerized reservation system | |
| Ebben et al. | Dynamic transport scheduling under multiple resource constraints | |
| Saadouli et al. | An optimization and Simulation approach for Operating Room scheduling under stochastic durations | |
| CN107230047A (en) | A kind of intelligent vehicle administration office's service system and method for servicing based on cloud computing | |
| CN110851260A (en) | Task allocation method and device | |
| Aydinliyim et al. | A cooperative savings game approach to a time sensitive capacity allocation and scheduling problem | |
| Saffari et al. | A queuing system with inventory and competing suppliers | |
| Nisafani et al. | Bayesian selection rule for human-resource selection in business process management systems | |
| Walter et al. | On a multi-project staffing problem with heterogeneously skilled workers | |
| CN114037232A (en) | Online distribution method and device for home maintenance orders and terminal equipment |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |