CN110516906A - Large user's amount concurrently takes single method and system - Google Patents
Large user's amount concurrently takes single method and system Download PDFInfo
- Publication number
- CN110516906A CN110516906A CN201910628327.6A CN201910628327A CN110516906A CN 110516906 A CN110516906 A CN 110516906A CN 201910628327 A CN201910628327 A CN 201910628327A CN 110516906 A CN110516906 A CN 110516906A
- Authority
- CN
- China
- Prior art keywords
- order
- employee
- work order
- new work
- taking
- 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
- 238000000034 method Methods 0.000 title claims abstract description 58
- 238000012545 processing Methods 0.000 claims abstract description 70
- 238000003860 storage Methods 0.000 claims description 18
- 238000012163 sequencing technique Methods 0.000 claims description 15
- 238000009826 distribution Methods 0.000 claims description 14
- 230000009471 action Effects 0.000 claims description 8
- 238000012549 training Methods 0.000 claims description 5
- 238000004590 computer program Methods 0.000 claims description 4
- 230000008569 process Effects 0.000 claims description 3
- 238000011084 recovery Methods 0.000 claims description 3
- 238000012216 screening Methods 0.000 claims description 3
- 230000001737 promoting effect Effects 0.000 abstract 1
- 230000009286 beneficial effect Effects 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 3
- 230000032683 aging Effects 0.000 description 2
- 230000003111 delayed effect Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 238000013528 artificial neural network Methods 0.000 description 1
- 238000004140 cleaning Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000004622 sleep time Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/08—Learning methods
-
- 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
-
- 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/06316—Sequencing of tasks or work
-
- 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Operations Research (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Finance (AREA)
- Game Theory and Decision Science (AREA)
- Accounting & Taxation (AREA)
- Biophysics (AREA)
- Evolutionary Computation (AREA)
- Artificial Intelligence (AREA)
- Biomedical Technology (AREA)
- Health & Medical Sciences (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Life Sciences & Earth Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention discloses a kind of large user amount and concurrently takes single method and system, is related to intelligence and takes single technical field, can realize accurate worksheet processing while promoting worksheet processing efficiency, solve the problems, such as poor user experience.This method comprises: persistently obtaining new work order, and the type based on new work order is distributed to corresponding user group;Identify new work order, priority scheduling employee to be matched takes single processing before the deadline after locking to new work order;If the new work order locked in validity period is not taken list, label is retracted into user group for lock work order and keeps in after being unlocked;The single residue for measuring and having taken single amount to calculate each employee of processing of maximum day based on employee takes unilateral quota, and statistics can order employee information;According to the Suo Dan quantity of each employee, without lock work order quantity and can order employee information, will all without lock work order sequence after poll be distributed to it is each can order employee processing.The system application has the method that above scheme is proposed.
Description
Technical Field
The invention relates to the technical field of intelligent order taking, in particular to a method and a system for simultaneously taking orders with large user quantity.
Background
With the development of internet technology, operation systems in various industry fields relate to order taking operation, such as the operation fields of customer service, express package picking, package distribution and the like. The existing operating system has two types of order taking modes, namely a manual dispatching mode and an automatic dispatching mode, and for the manual dispatching mode, the defects that the dispatching efficiency is low and the dispatching result is influenced by subjectivity exist; for the automatic distribution mode, the problem that the customer complaint is upgraded due to the mechanical distribution mode and the user experience is poor exists.
Disclosure of Invention
The invention aims to provide a large-user-quantity concurrent order-taking method and a system, which can improve the order-sending efficiency and simultaneously realize accurate order sending and solve the problem of poor user experience.
In order to achieve the above object, an aspect of the present invention provides a large-user-volume concurrent invoice retrieval method, including:
continuously acquiring a new work order, and distributing the new work order to a corresponding user group based on the type of the new work order;
identifying a new work order, and after locking the new work order, preferentially waiting for the matched staff to take the order for processing in the validity period;
if the new work order locked within the validity period is not singled, the new work order is marked as a lockless work order after being unlocked and returned to the user group for temporary storage;
calculating the residual order taking limit of each employee based on the maximum daily processing order quantity and the obtained order quantity of the employee, and counting the information of the employee capable of receiving the order;
and sequencing all the non-lock work orders and then distributing the non-lock work orders to each staff capable of receiving the order for processing according to the number of the order, the number of the non-lock work orders and the information of the staff capable of receiving the order.
Preferably, the method for continuously acquiring the new work order and distributing the new work order to the corresponding user group based on the type of the new work order comprises the following steps:
correspondingly setting a plurality of groups of user groups based on the type of the new work order, wherein the user groups correspond to the type of the new work order one by one and consist of a plurality of employees;
and distributing the continuously acquired new work orders to corresponding user groups according to types for temporary storage.
Preferably, the method for identifying a new work order and preferably waiting for the matched employee to take the order within the validity period after locking the new work order comprises the following steps:
counting problem labels which are processed well by each employee based on historical work order data processed by each employee, and training a capability model of the corresponding employee;
identifying the content of a new work order, and screening out the staff with the matched capability model from the corresponding user group to be locked as matched staff;
and locking the new work order, and preferentially waiting for the matched staff to take the order for processing in the valid period.
Preferably, the situation that the new work order locked within the validity period is not singled out includes:
the matched staff initiatively releases, abandons and takes the order; or,
the matched staff tries to take the order, and when the order taking action times exceed the threshold value and the order taking is not successful, the order taking is passively abandoned by default.
Further, the method for calculating the remaining order taking limit of each employee based on the maximum daily processing order quantity and the taken order quantity of the employee comprises the following steps:
acquiring historical work order data processed by each employee to calculate the daily average processing unit of each employee, and calculating the maximum daily processing unit of each employee based on the daily average processing unit;
and counting the current day single taking amount of each employee by the current time, and calculating the residual single taking limit of each employee by combining the maximum daily processing single amount of each employee.
Preferably, the method for calculating the maximum daily processing unit of each employee based on the daily average processing unit comprises the following steps:
presetting basic factor parameters;
combining three dimensional weights of a customer satisfaction degree dimension, a work order recovery efficiency dimension and a work order finishing efficiency dimension with basic factor parameters to calculate to obtain a prediction expansion multiple of each employee;
and calculating the maximum daily processing unit of each employee based on the predicted expansion multiple of each employee and the corresponding daily average processing unit.
Preferably, the method for sequencing and polling and distributing all the non-lock work orders to each order-receivable employee to process according to the number of the order, the number of the non-lock work orders and the information of the order-receivable employees of each employee comprises the following steps:
acquiring the number of the order forms set by each employee, the number of the non-lock order temporarily stored in the user group at the end of counting time and the information of the screened out order-receivable employees, and taking the residual order-taking limit as the number of the order forms when the number of the order forms of the employees is greater than the residual order-taking limit;
sequencing all temporary-stored lockless work orders according to the generation time sequence of the work orders, and sequencing each order-receivable employee in the user group according to the employee work number;
counting the sum of the number of odd-number-of-asking quantities of the employees who can receive the order, sequentially distributing the number of odd-number-of-asking quantities to each employee who can receive the order when the sum of the number of odd-number-of-asking quantities is smaller than the number of the employee who does not have the lock, stopping distribution until the number of odd-number-of-asking quantities of each employee who can receive the order is reached, and temporarily storing the rest number of odd; or,
and when the sum of the number of the order sheets is larger than the number of the non-lock work orders, the number of the order sheets of each employee capable of receiving the order sheets is proportionally reduced, and then the non-lock work orders are polled and distributed to each employee capable of receiving the order sheets in sequence until the non-lock work orders are distributed.
Optionally, when no-lock work order polling is allocated to each acceptable work order worker, if the number of available work orders reaches the number of the order, the next polling allocation automatically skips the acceptable work order worker.
Compared with the prior art, the large-user-quantity concurrent single-party-fetching method provided by the invention has the following beneficial effects:
in the method for simultaneously sending and taking the large number of the users, new worksheets are continuously obtained from a system and distributed to corresponding user groups for temporary storage according to the types of the new worksheets, for example, after-sales consultation customer service worksheets are distributed to after-sales service user groups, then the new worksheets temporarily stored in the user groups are sequentially identified, the key problems of each new worksheet are analyzed, and then the prior locking is executed, so that staff who are skilled in processing the problems can preferentially take the worksheets within the validity period, the synchronous improvement of the processing quality of the worksheets and the customer satisfaction degree is realized, if the locked new worksheets are not taken by matched staff within the validity period, at the moment, in order to ensure the timeliness of the worksheet processing, the new worksheets do not continue to wait, namely the new worksheets are marked as lock-free worksheets to be returned to the user groups after being unlocked, so as to be; meanwhile, considering that the processing efficiency of different employees is different, the residual order taking limit of each employee needs to be evaluated according to the maximum daily processing order quantity and the obtained order quantity of the employees, an order taking strategy which is different and flexibly distributed among different persons is adopted to avoid the situation that the accumulated work order processing of part of the employees is delayed due to blind order taking, the timeliness of the work order processing is ensured from the source, and finally, for the non-lock work orders in the user group, the number of the order searching orders of the employees, the number of the non-lock work orders and the information of the order-accepting employees are referred, all the non-lock work orders are sequenced and then distributed to each order-accepting employee for processing, the uniformity of work order distribution is ensured, and the time that the accumulated work order is caused by distributing the work orders of the same employee in a certain time period in a centralized way is avoided.
Another aspect of the present invention provides a large-user-volume concurrent invoice issuing device, which is applied to the large-user-volume concurrent invoice issuing method mentioned in the above technical solution, and the device includes:
the order taking unit is used for continuously obtaining a new work order and distributing the new work order to a corresponding user group based on the type of the new work order;
the locking unit is used for continuously acquiring a new work order and distributing the new work order to a corresponding user group based on the type of the new work order;
the judging unit is used for marking the unlocked new work order as a lock-free work order to return to the user group for temporary storage if the locked new work order is not picked within the validity period;
the processing unit is used for calculating the residual order taking limit of each employee based on the maximum daily processing order quantity and the obtained order quantity of the employee and counting the information of the employee capable of receiving the order;
and the distribution unit is used for sequencing all the non-lock work orders and then distributing the non-lock work orders to each order-receivable employee for processing according to the number of the order, the number of the non-lock work orders and the information of the order-receivable employees.
Compared with the prior art, the beneficial effect of the large-user-quantity concurrent list sending device provided by the invention is the same as that of the large-user-quantity concurrent list sending method provided by the technical scheme, and the detailed description is omitted here.
A third aspect of the present invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the above-described large-user volume concurrent ticket-taking method.
Compared with the prior art, the beneficial effect of the computer-readable storage medium provided by the invention is the same as that of the large-user-volume concurrent list-fetching method provided by the technical scheme, and the detailed description is omitted here.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the invention and not to limit the invention. In the drawings:
fig. 1 is a schematic flow chart of a method for concurrent ordering of a large number of users according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a single frame for concurrent fetching of a large number of users according to an embodiment of the present invention.
Detailed Description
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in detail below. It is to be understood that the described embodiments are merely exemplary of the invention, and not restrictive of the full scope of the invention. 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 invention.
Example one
Referring to fig. 1, the present embodiment provides a method for concurrent ordering of large number of users, including: continuously acquiring a new work order, and distributing the new work order to a corresponding user group based on the type of the new work order; identifying a new work order, and after locking the new work order, preferentially waiting for the matched staff to take the order for processing in the validity period; if the new work order locked within the validity period is not singled, the new work order is marked as a lockless work order after being unlocked and returned to the user group for temporary storage; calculating the residual order taking limit of each employee based on the maximum daily processing order quantity and the obtained order quantity of the employee, and counting the information of the employee capable of receiving the order; and sequencing all the non-lock work orders and then distributing the non-lock work orders to each staff capable of receiving the order for processing according to the number of the order, the number of the non-lock work orders and the information of the staff capable of receiving the order.
In the method for sending and taking a large number of sheets concurrently provided by this embodiment, new work orders are continuously obtained from the system and distributed to corresponding user groups according to the types of the new work orders for temporary storage, for example, after-sale consultation customer service work orders are distributed to after-sale service user groups, then the new work orders stored temporarily in the user groups are sequentially identified, and after key problems of each new work order are resolved, advanced locking is performed, so that staff who are good at handling the problems can take sheets preferentially within the validity period, thereby achieving synchronous improvement of work order processing quality and customer satisfaction, if the locked new work orders are not taken sheets by matched staff within the validity period, at this time, in order to ensure the timeliness of work order processing, the new work orders will not wait any more, namely, the unlocked new work orders are marked as lock-free work orders and returned to the user groups for other staff to take sheets for processing; meanwhile, considering that the processing efficiency of different employees is different, the residual order taking limit of each employee needs to be evaluated according to the maximum daily processing order quantity and the obtained order quantity of the employees, an order taking strategy which is different and flexibly distributed among different persons is adopted to avoid the situation that the accumulated work order processing of part of the employees is delayed due to blind order taking, the timeliness of the work order processing is ensured from the source, and finally, for the non-lock work orders in the user group, the number of the order searching orders of the employees, the number of the non-lock work orders and the information of the order-accepting employees are referred, all the non-lock work orders are sequenced and then distributed to each order-accepting employee for processing, the uniformity of work order distribution is ensured, and the time that the accumulated work order is caused by distributing the work orders of the same employee in a certain time period in a centralized way is avoided.
Therefore, the large-user-quantity concurrent single-party-taking method provided by the embodiment can realize high concurrent single-party taking, the single-party taking efficiency is improved, meanwhile, the work order can be assigned to the staff with the most suitable and optimal solution at present through the priority matching strategy, the processing quality of the work order is guaranteed while the business capacity of the staff is strengthened, in addition, because the time distribution of the work order obtained by each staff is uniform, the fact that each work order has enough time to be processed is guaranteed, and the experience of customers is improved.
Specifically, the method for continuously acquiring the new work order and distributing the new work order to the corresponding user group based on the type of the new work order in the embodiment includes:
correspondingly setting a plurality of groups of user groups based on the types of the new work orders, wherein the user groups correspond to the types of the new work orders one by one and consist of a plurality of employees; and distributing the continuously acquired new work orders to corresponding user groups according to types for temporary storage. Illustratively, the types of user groups include pre-sale consultant user groups, post-sale service user groups, financial product consultant user groups, and the like.
In the above embodiment, the method for identifying a new work order and preferentially waiting for the matched employee to take the order within the validity period after locking the new work order includes:
counting problem labels which are processed well by each employee based on historical work order data processed by each employee, and training a capability model of the corresponding employee; identifying the content of a new work order, and screening out the staff with the matched capability model from the corresponding user group to be locked as matched staff; and locking the new work order, and preferentially waiting for the matched staff to take the order for processing in the validity period.
In specific implementation, please refer to fig. 2, a training sample is made based on historical work order data of each employee, a key problem label of each work order is screened after data cleaning, a neural network training capacity recognition model is adopted, a capacity model corresponding to each employee is recognized through the capacity recognition model, the key problem label is automatically recognized after a new work order is obtained, and the employee who is good at handling the problem is locked as a matched employee, namely, an employee matched with the problem capacity model; in addition, the locking validity period may be specifically set according to an application scenario, and the embodiment is not limited herein, for example, the locking validity period is 5 seconds.
Optionally, the situation that the new work order locked within the validity period is not singled out in the above embodiment includes:
the matched staff initiatively releases, abandons and takes the order; or the matched staff tries to take the order, and when the number of the order taking actions exceeds the threshold value and is still successful in order taking, the order taking is abandoned passively by default.
In order to ensure the stability of the system, in the specific implementation, the same employee needs to perform the single taking action again after performing the single taking action once at certain intervals, if the sleep time is set to be 50 milliseconds, after the single taking action is not successful, the thread wakes up for 50 milliseconds, then the single taking action is repeated, and when the accumulated times reach the threshold value and the single taking action is not successful, the passive single taking release and release is defaulted, so that the operation pressure of the system is reduced.
Further, in the above embodiment, the method for calculating the remaining order taking limit of each employee based on the maximum daily processing order amount and the order taking amount of the employee includes:
acquiring historical work order data processed by each employee to calculate the daily average processing unit of each employee, and calculating the maximum daily processing unit of each employee based on the daily average processing unit; and counting the current day single taking amount of each employee by the current time, and calculating the residual single taking limit of each employee by combining the maximum daily processing single amount of each employee. And when the residual order taking limit of the employee is larger than zero, allowing the employee to continue to take the order, and otherwise, limiting the employee to take the order. The implementation adopts the following two methods as an exemplary description, the first method is a default expansion multiple method, the second method is a measurement and calculation expansion multiple method, and the system can be freely configured during specific implementation. Because the second method is more accurate in measuring and calculating results, the multiple expansion method is taken as an example for the most detailed description:
presetting basic factor parameters; combining three dimensional weights of a customer satisfaction degree dimension, a work order recovery efficiency dimension and a work order finishing efficiency dimension with basic factor parameters to calculate to obtain a prediction expansion multiple of each employee; and calculating the maximum daily processing unit of each employee based on the predicted expansion multiple and the corresponding daily average processing unit of each employee.
Illustratively, the initial value of the basic factor parameter is 1.2, the customer satisfaction rate dimension weight is 0.8, the efficiency dimension weight is 0.1 when the work order is replied, the efficiency dimension weight is 0.1 when the work order is finished, and the calculation formula of the prediction expansion multiple is as follows: the predicted expansion factor parameter [ customer satisfaction rate 0.8+ efficiency at work order reply 0.1+ efficiency at work order completion 0.1 ].
The calculation method of the customer satisfaction rate comprises the following steps: counting the sum of the evaluated number and the unevaluated number, and dividing the sum by the total number of the processed work orders to obtain the customer satisfaction rate; the method for calculating the efficiency during work order reply comprises the following steps: setting a reply timeliness threshold value based on the work order problem type, counting the number of work orders processed in the reply timeliness threshold value, and dividing the number by the total number of the processed work orders to obtain the work order reply efficiency; the method for calculating the efficiency when the work order is finished comprises the following steps: and setting a finishing aging threshold value based on the work order problem type, counting the number of work orders processed in the finishing aging threshold value, and dividing the number by the total number of the processed work orders to obtain the finishing efficiency of the work orders.
Further, in the above embodiment, the method for sequencing and polling and distributing all the non-lock work orders to each order-receivable employee to process according to the number of order forms, the number of non-lock work orders, and the information of the order-receivable employees includes:
acquiring the number of the order forms set by each employee, the number of the non-lock order temporarily stored in the user group at the end of counting time and the information of the screened out order-receivable employees, and taking the residual order-taking limit as the number of the order forms when the number of the order forms of the employees is greater than the residual order-taking limit; sequencing all temporary-stored lockless work orders according to the generation time sequence of the work orders, and sequencing each order-receivable employee in the user group according to the employee work number; counting the sum of the number of odd-number-of-asking quantities of the employees who can receive the order, sequentially distributing the number of odd-number-of-asking quantities to each employee who can receive the order when the sum of the number of odd-number-of-asking quantities is smaller than the number of the employee who does not have the lock, stopping distribution until the number of odd-number-of-asking quantities of each employee who can receive the order is reached, and temporarily storing the rest number of odd; or when the sum of the number of the order sheets is larger than the number of the non-lock work orders, the number of the order sheets of each staff capable of receiving the order sheets is reduced proportionally, and then the non-lock work orders are polled and distributed to each staff capable of receiving the order sheets sequentially until the non-lock work orders are distributed completely.
It should be noted that, when no-lock work order polling is allocated to each order receivable staff, if the number of the order receivable staff reaches the number of the order, the next time polling allocation is performed, the order receivable staff is automatically skipped.
For the convenience of understanding of the manufacturing example of the polling distributor, if the number of the non-lock worksheets stored in the user group is 100, the corresponding serial numbers are 1 to 100, the number of the receivable worksheets is 10, and the number of the receivable worksheets is 1 employee, 2 employee, … … and 10 employee respectively, the number of the invoice of each employee is set to 10, and the remaining order taking limit of each employee is greater than 10, when the round-robin distribution is performed, the number 1 worksheet, the number 11 worksheet, the number 21 worksheet, the number 31 worksheet, the number 41 worksheet, the number 51 worksheet, the number 61 worksheet, the number 71 worksheet, the number 81 worksheet and the number 91 worksheet are distributed to the number 1 worksheet, the number 2 worksheets, the number 12 worksheets, the number 22 worksheets, the number 32 worksheets, the number 42 worksheets, the number 52 worksheets, the number 62 worksheets, the number 72 worksheets, the number 82 worksheets and the number 92 worksheets are distributed to the number 2, and so on, No. 50 work orders, No. 60 work orders, No. 70 work orders, No. 80 work orders, No. 90 work orders and No. 100 work orders are distributed to No. 10 employees until the lock-free work orders temporarily stored in the user group are distributed completely at the time of statistics, and therefore the work orders can be distributed more uniformly by adopting a polling distribution mechanism, and the finishing timeliness of each work order is guaranteed.
In addition, with continued reference to fig. 2, in order to increase the flexibility of work order allocation, the work orders in the above embodiment may also be set with a work order grade, so that the work orders with high grade are preferentially allocated to experienced employees for processing, thereby ensuring the processing quality of the emergency work orders.
Example two
The embodiment provides a large-user-volume concurrent receipt device, which comprises:
the order taking unit is used for continuously obtaining a new work order and distributing the new work order to a corresponding user group based on the type of the new work order;
the locking unit is used for continuously acquiring a new work order and distributing the new work order to a corresponding user group based on the type of the new work order;
the judging unit is used for marking the unlocked new work order as a lock-free work order to return to the user group for temporary storage if the locked new work order is not picked within the validity period;
the processing unit is used for calculating the residual order taking limit of each employee based on the maximum daily processing order quantity and the obtained order quantity of the employee and counting the information of the employee capable of receiving the order;
and the distribution unit is used for sequencing all the non-lock work orders and then distributing the non-lock work orders to each order-receivable employee for processing according to the number of the order, the number of the non-lock work orders and the information of the order-receivable employees.
Compared with the prior art, the beneficial effect of the large-user-volume concurrent single-sending device provided by the embodiment of the invention is the same as that of the large-user-volume concurrent single-sending method provided by the first embodiment, and details are not repeated herein.
EXAMPLE III
The present embodiment provides a computer-readable storage medium, on which a computer program is stored, and the computer program is executed by a processor to perform the steps of the above-mentioned large-user-volume concurrent ticket issuing method.
Compared with the prior art, the beneficial effect of the computer-readable storage medium provided by the embodiment is the same as that of the large-user-volume concurrent list sending method provided by the technical scheme, and details are not repeated herein.
It will be understood by those skilled in the art that all or part of the steps in the method for implementing the invention may be implemented by hardware instructions related to a program, the program may be stored in a computer-readable storage medium, and when executed, the program includes the steps of the method of the embodiment, and the storage medium may be: ROM/RAM, magnetic disks, optical disks, memory cards, and the like.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.
Claims (10)
1. A large-user-quantity concurrent order taking method is characterized by comprising the following steps:
continuously acquiring a new work order, and distributing the new work order to a corresponding user group based on the type of the new work order;
identifying a new work order, and after locking the new work order, preferentially waiting for the matched staff to take the order for processing in the validity period;
if the new work order locked within the validity period is not singled, the new work order is marked as a lockless work order after being unlocked and returned to the user group for temporary storage;
calculating the residual order taking limit of each employee based on the maximum daily processing order quantity and the obtained order quantity of the employee, and counting the information of the employee capable of receiving the order;
and sequencing all the non-lock work orders and then distributing the non-lock work orders to each staff capable of receiving the order for processing according to the number of the order, the number of the non-lock work orders and the information of the staff capable of receiving the order.
2. The large-user-volume concurrent bill taking method according to claim 1, wherein the method of continuously obtaining a new work order and distributing the new work order to the corresponding user group based on the type of the new work order comprises:
correspondingly setting a plurality of groups of user groups based on the type of the new work order, wherein the user groups correspond to the type of the new work order one by one and consist of a plurality of employees;
and distributing the continuously acquired new work orders to corresponding user groups according to types for temporary storage.
3. The method for large-user-volume concurrent bill taking according to claim 1, wherein the method for identifying a new work order, and preferentially waiting for the matched staff to take the bill within the validity period after locking the new work order comprises the following steps:
counting problem labels which are processed well by each employee based on historical work order data processed by each employee, and training a capability model of the corresponding employee;
identifying the content of a new work order, and screening out the staff with the matched capability model from the corresponding user group to be locked as matched staff;
and locking the new work order, and preferentially waiting for the matched staff to take the order for processing in the valid period.
4. The large-user-volume concurrent bill taking method according to claim 3, wherein the case that the new work order locked within the validity period is not taken comprises:
the matched staff initiatively releases, abandons and takes the order; or,
the matched staff tries to take the order, and when the order taking action times exceed the threshold value and the order taking is not successful, the order taking is passively abandoned by default.
5. The large user quantity concurrent order taking method according to claim 4, wherein the remaining order taking limit of each employee is calculated based on the maximum daily processing order quantity and the order taking quantity of the employee, and the method for counting the information of the employee capable of receiving the order comprises the following steps:
acquiring historical work order data processed by each employee to calculate the daily average processing unit of each employee, and calculating the maximum daily processing unit of each employee based on the daily average processing unit;
and counting the current day single taking amount of each employee by the current time, and calculating the residual single taking limit of each employee by combining the maximum daily processing single amount of each employee.
6. The method for large user quantity concurrent bill drawing according to claim 5, wherein the method for calculating the maximum daily processing bill quantity of each employee based on the average daily processing bill quantity comprises the following steps:
presetting basic factor parameters;
combining three dimensional weights of a customer satisfaction degree dimension, a work order recovery efficiency dimension and a work order finishing efficiency dimension with basic factor parameters to calculate to obtain a prediction expansion multiple of each employee;
and calculating the maximum daily processing unit of each employee based on the predicted expansion multiple of each employee and the corresponding daily average processing unit.
7. The method for the large-user-volume concurrent bill pickup according to claim 6, wherein the method for sequencing and polling and distributing all the non-lock work orders to each bill-receivable employee to process according to the number of the bills of the employees, the number of the non-lock work orders and the information of the bill-receivable employees comprises the following steps:
acquiring the number of the order forms set by each employee, the number of the non-lock order temporarily stored in the user group at the end of counting time and the information of the screened out order-receivable employees, and taking the residual order-taking limit as the number of the order forms when the number of the order forms of the employees is greater than the residual order-taking limit;
sequencing all temporary-stored lockless work orders according to the generation time sequence of the work orders, and sequencing each order-receivable employee in the user group according to the employee work number;
counting the sum of the number of odd-number-of-asking quantities of the employees who can receive the order, sequentially distributing the number of odd-number-of-asking quantities to each employee who can receive the order when the sum of the number of odd-number-of-asking quantities is smaller than the number of the employee who does not have the lock, stopping distribution until the number of odd-number-of-asking quantities of each employee who can receive the order is reached, and temporarily storing the rest number of odd; or,
and when the sum of the number of the order sheets is larger than the number of the non-lock work orders, the number of the order sheets of each employee capable of receiving the order sheets is proportionally reduced, and then the non-lock work orders are polled and distributed to each employee capable of receiving the order sheets in sequence until the non-lock work orders are distributed.
8. The large number concurrent order taking method according to claim 7, wherein when no lock work order polling is allocated to each order receivable employee, if the number of orders taken by the order receivable employee reaches the number of orders, the next polling allocation automatically skips the order receivable employee.
9. A large-user-volume concurrent ticket issuing apparatus, comprising:
the order taking unit is used for continuously obtaining a new work order and distributing the new work order to a corresponding user group based on the type of the new work order;
the locking unit is used for continuously acquiring a new work order and distributing the new work order to a corresponding user group based on the type of the new work order;
the judging unit is used for marking the unlocked new work order as a lock-free work order to return to the user group for temporary storage if the locked new work order is not picked within the validity period;
the processing unit is used for calculating the residual order taking limit of each employee based on the maximum daily processing order quantity and the obtained order quantity of the employee and counting the information of the employee capable of receiving the order;
and the distribution unit is used for sequencing all the non-lock work orders and then distributing the non-lock work orders to each order-receivable employee for processing according to the number of the order, the number of the non-lock work orders and the information of the order-receivable employees.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method according to any one of the claims 1 to 8.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910628327.6A CN110516906A (en) | 2019-07-12 | 2019-07-12 | Large user's amount concurrently takes single method and system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910628327.6A CN110516906A (en) | 2019-07-12 | 2019-07-12 | Large user's amount concurrently takes single method and system |
Publications (1)
Publication Number | Publication Date |
---|---|
CN110516906A true CN110516906A (en) | 2019-11-29 |
Family
ID=68623035
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910628327.6A Pending CN110516906A (en) | 2019-07-12 | 2019-07-12 | Large user's amount concurrently takes single method and system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110516906A (en) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111340354A (en) * | 2020-02-24 | 2020-06-26 | 上海东普信息科技有限公司 | Work order management and control method, system, computer equipment and storage medium |
CN111489097A (en) * | 2020-04-17 | 2020-08-04 | 云南电网有限责任公司电力科学研究院 | Park people flow management and control system based on edge calculation |
CN112182192A (en) * | 2020-10-16 | 2021-01-05 | 衡阳携创信息服务有限公司 | WeChat applet-based customer service system |
CN112925851A (en) * | 2021-02-26 | 2021-06-08 | 杭州网易再顾科技有限公司 | Single number processing method and device, electronic equipment and storage medium |
CN113379394A (en) * | 2021-06-30 | 2021-09-10 | 北京世纪互联宽带数据中心有限公司 | Work order processing method and device |
Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104183118A (en) * | 2014-08-19 | 2014-12-03 | 北京嘀嘀无限科技发展有限公司 | Order sending system for obtaining passenger optimal picking-up driver based on auction model |
US20150262298A1 (en) * | 2014-03-11 | 2015-09-17 | Chicago Mercantile Exchange Inc. | Market operation through regulation of incoming order match allocation and/or dynamic resting order match allocation priorities |
CN107992604A (en) * | 2017-12-14 | 2018-05-04 | 北京搜狗科技发展有限公司 | The distribution method and relevant apparatus of a kind of task entry |
CN108428047A (en) * | 2018-02-23 | 2018-08-21 | 广州启盟信息科技有限公司 | A kind of building work smart allocation method, apparatus and system |
CN108921470A (en) * | 2018-06-26 | 2018-11-30 | 广东步同城网络科技有限公司 | Method, apparatus, computer equipment and the storage medium of order delivery management |
CN109325615A (en) * | 2018-08-31 | 2019-02-12 | 苏宁易购集团股份有限公司 | A kind of Intelligent worker assigning method and device |
WO2019042135A1 (en) * | 2017-08-28 | 2019-03-07 | 上海蔚来汽车有限公司 | Combined task assignment method and system |
CN109598413A (en) * | 2018-11-09 | 2019-04-09 | 珠海市华兴软件信息服务有限公司 | A kind of intelligent task worksheet processing system |
CN109784677A (en) * | 2018-12-26 | 2019-05-21 | 北京炎黄新星网络科技有限公司 | A kind of work order automatic identification based on customer service system and distribution method and device |
-
2019
- 2019-07-12 CN CN201910628327.6A patent/CN110516906A/en active Pending
Patent Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20150262298A1 (en) * | 2014-03-11 | 2015-09-17 | Chicago Mercantile Exchange Inc. | Market operation through regulation of incoming order match allocation and/or dynamic resting order match allocation priorities |
CN104183118A (en) * | 2014-08-19 | 2014-12-03 | 北京嘀嘀无限科技发展有限公司 | Order sending system for obtaining passenger optimal picking-up driver based on auction model |
WO2019042135A1 (en) * | 2017-08-28 | 2019-03-07 | 上海蔚来汽车有限公司 | Combined task assignment method and system |
CN107992604A (en) * | 2017-12-14 | 2018-05-04 | 北京搜狗科技发展有限公司 | The distribution method and relevant apparatus of a kind of task entry |
CN108428047A (en) * | 2018-02-23 | 2018-08-21 | 广州启盟信息科技有限公司 | A kind of building work smart allocation method, apparatus and system |
CN108921470A (en) * | 2018-06-26 | 2018-11-30 | 广东步同城网络科技有限公司 | Method, apparatus, computer equipment and the storage medium of order delivery management |
CN109325615A (en) * | 2018-08-31 | 2019-02-12 | 苏宁易购集团股份有限公司 | A kind of Intelligent worker assigning method and device |
CN109598413A (en) * | 2018-11-09 | 2019-04-09 | 珠海市华兴软件信息服务有限公司 | A kind of intelligent task worksheet processing system |
CN109784677A (en) * | 2018-12-26 | 2019-05-21 | 北京炎黄新星网络科技有限公司 | A kind of work order automatic identification based on customer service system and distribution method and device |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111340354A (en) * | 2020-02-24 | 2020-06-26 | 上海东普信息科技有限公司 | Work order management and control method, system, computer equipment and storage medium |
CN111489097A (en) * | 2020-04-17 | 2020-08-04 | 云南电网有限责任公司电力科学研究院 | Park people flow management and control system based on edge calculation |
CN112182192A (en) * | 2020-10-16 | 2021-01-05 | 衡阳携创信息服务有限公司 | WeChat applet-based customer service system |
CN112925851A (en) * | 2021-02-26 | 2021-06-08 | 杭州网易再顾科技有限公司 | Single number processing method and device, electronic equipment and storage medium |
CN112925851B (en) * | 2021-02-26 | 2023-06-13 | 杭州网易再顾科技有限公司 | Single number processing method and device, electronic equipment and storage medium |
CN113379394A (en) * | 2021-06-30 | 2021-09-10 | 北京世纪互联宽带数据中心有限公司 | Work order processing method and device |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110516906A (en) | Large user's amount concurrently takes single method and system | |
CN109118334B (en) | Order processing method and device | |
CN102779367B (en) | Scheduling method of queuing processing system and queuing machine for prediction of service processing time | |
CN108551533B (en) | Scheduling method of customer service agents, storage medium and server | |
CN109272276A (en) | A kind of inventory replenishes management method and device | |
CN108985688A (en) | Method of servicing is sent in full-automatic logistics with charge free | |
CN109636217A (en) | Order scheduling method and device, electronic equipment and storage medium | |
CN106844594A (en) | A kind of electric power Optimal Configuration Method based on big data | |
CN108256721A (en) | A kind of method for scheduling task, terminal device and medium | |
CN113450002A (en) | Task allocation method and device, electronic equipment and storage medium | |
CN115239223A (en) | Allocation center task scheduling method, device, equipment and storage medium | |
CN111126779B (en) | Customer service work order distribution method and device | |
CN115796732B (en) | Regional logistics delivery and entry distribution management method based on e-commerce platform commodity | |
CN109377633A (en) | A kind of queue number generation method and terminal device | |
CN114706862B (en) | Hotel room state prediction method, device, equipment and storage medium | |
CN118193166A (en) | Task processing method and device, electronic equipment and storage medium | |
CN111652440A (en) | Logistics node cargo quantity information management method and device | |
Saffari et al. | A queuing system with inventory and competing suppliers | |
CN115187084A (en) | Service personnel allocation method, device, equipment and readable storage medium | |
CN115630827A (en) | Translation order allocation method, system, electronic equipment and storage medium | |
CN116228115A (en) | Inventory management method and device, electronic equipment and storage medium | |
CN113435763B (en) | Task automatic getting system and method based on big data | |
CN109472528A (en) | A kind of automatic cargo allocation method and device | |
CN113609236B (en) | Data processing method, device and equipment | |
CN108668038A (en) | The special customer service system of VIP user |
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 | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191129 |