CN109784646A - Method for allocating tasks, device, storage medium and server - Google Patents
Method for allocating tasks, device, storage medium and server Download PDFInfo
- Publication number
- CN109784646A CN109784646A CN201811536043.6A CN201811536043A CN109784646A CN 109784646 A CN109784646 A CN 109784646A CN 201811536043 A CN201811536043 A CN 201811536043A CN 109784646 A CN109784646 A CN 109784646A
- Authority
- CN
- China
- Prior art keywords
- task
- service node
- preset
- business
- node
- 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 35
- 238000003860 storage Methods 0.000 title claims abstract description 20
- 238000012545 processing Methods 0.000 claims abstract description 37
- 239000003999 initiator Substances 0.000 claims abstract description 18
- 238000004590 computer program Methods 0.000 claims description 14
- 230000000977 initiatory effect Effects 0.000 claims description 9
- 230000006870 function Effects 0.000 description 18
- 238000009826 distribution Methods 0.000 description 13
- 238000010586 diagram Methods 0.000 description 5
- 230000007246 mechanism Effects 0.000 description 5
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 238000005303 weighing Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 239000013078 crystal Substances 0.000 description 1
- 230000005484 gravity Effects 0.000 description 1
- 239000007788 liquid Substances 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
Abstract
The present invention relates to data processing fields, and in particular to a kind of method for allocating tasks, device, storage medium and server, which comprises receives the task requests that task initiator initiates, generates corresponding task according to the task requests；Obtain the processing information of preset service node；The task is parsed, the basic information of task is obtained, corresponding service node is matched according to the basic information based on preset matching rule；The task is sent to corresponding service node.Task can reasonably be distributed the allocative efficiency for accelerating task to different service nodes by the present invention, improve the treatment effeciency of task.
Description
Technical field
The present invention relates to data processing fields, and in particular to a kind of method for allocating tasks, device, storage medium and service
Device.
Background technique
With the continuous development of company, the scale of company constantly expands, while relying on the development of Internet technology, company's industry
The service range of business is constantly expanded, from line under shops's service expand be on line-line under the integrated service that combines, the industry of company
Business source also becomes multi-faceted channel from single channel, including channel under channel and line on line, and channel includes movement on line
Channel on end line, channel on PC end line, channel etc. on phone end line, management while business is more and more, for business
Also it is increasingly difficult to, and currently, often take nearest distribution principle for received task, it, should when a certain port flow is big
Handling needed for port for task is also excessive, and other ports are then in idle condition for a long time, cause resource allocation unreasonable, from
And lead to the phenomenon that current task processing lag, task treatment effeciency are too low out.
Summary of the invention
To overcome the above technical problem, the especially prior art that can not efficiently distribute, handle times of different channels generations
The problem of business, spy propose following technical scheme:
In a first aspect, the present invention provides a kind of method for allocating tasks, comprising:
The task requests that reception task initiator initiates generate corresponding task according to the task requests；
Obtain the processing information of preset service node；
The task is parsed, the basic information of task is obtained, based on preset matching rule according to the basic information
With corresponding service node；
The task is sent to corresponding service node.
Further, described that corresponding service node, packet are matched according to the basic information based on preset matching rule
It includes:
Corresponding multiple service nodes are matched according to the basic information based on preset matching rule, to the multiple industry
Business node is ranked up；
It is described that the task is sent to corresponding service node, comprising:
The preceding service node that sorts is obtained from the multiple service node；Judge working as the service node obtained
Preceding task load distributes task to sequence if the current task load of the service node of the acquisition is greater than preset value
One service node.
It is further, described that the multiple service node is ranked up, comprising:
Obtain each service node in the multiple business section task schedule within a preset time, task is completed
Rate, task complete the feedback information of satisfaction and task scoring, the influent factor of the ordering rule as service node, according to shadow
Ring the sequence that element adjusts the multiple service node.
It is further, described that the task is sent to after corresponding service node, further includes:
Service node is tracked to the feedback of the task, if being not received by service node in preset time to the task
Feedback when, task is distributed to next service node of sequence.
Further, the task of each service node obtained in the multiple business section within a preset time complete into
Degree, task completion rate, task complete the feedback information of satisfaction and task scoring, the influence of the ordering rule as service node
Element adjusts the sequence of the multiple service node according to influent factor, comprising:
Obtain the feedback information of the business in the preset time of each service node in the multiple business section；According to default
Task schedule in time obtains average schedule, obtains the first score value multiplied by the first coefficient；According in preset time
Task completion rate obtain average completion rate, obtain the second score value multiplied by the second coefficient；It is completed according to the task in preset time
Satisfaction obtains average satisfaction, obtains third score value multiplied by third coefficient；It is scored and is put down according to the task in preset time
It scores, obtains quartile multiplied by the 4th coefficient；First score value, the second score value, third score value, quartile are added, obtained
The sequence of the multiple service node is adjusted according to the sequence of total score from big to small to total score.
Further, after the processing information for obtaining preset service node, further includes:
Judge service node with the presence or absence of relationship between superior and subordinate according to the processing information of the service node；
If there are relationships between superior and subordinate between service node, judge whether junior's service node follows of higher level's service node
With rule；
If so, junior's service node matching rule is determined according to the matching rule of higher level's service node；If it is not, junior's industry
The matching rule of business node is determined according to the matching rule of own service node.
Second aspect, the present invention provide a kind of task allocation apparatus, comprising:
Task collects module: for receiving the task requests of task initiator initiation, generating phase according to the task requests
Answering for task；
Data obtaining module: for obtaining the processing information of preset service node；
Task matching module: for parsing the task, the basic information of task is obtained, preset matching rule root is based on
Corresponding service node is matched according to the basic information；
Task pushing module: for the task to be sent to corresponding service node.
Further, the task matching module further includes executing:
Corresponding multiple service nodes are matched according to the basic information based on preset matching rule, to the multiple industry
Business node is ranked up；
The task pushing module further includes executing:
The preceding service node that sorts is obtained from the multiple service node；Judge working as the service node obtained
Preceding task load distributes task to sequence if the current task load of the service node of the acquisition is greater than preset value
One service node.
The third aspect, the present invention also provides a kind of computer readable storage medium, the computer readable storage medium
On be stored with computer program, which realizes above-mentioned method for allocating tasks when being executed by processor.
Fourth aspect, the present invention also provides a server, the server includes one or more processors, storage
Device, one or more computer programs, wherein one or more of computer programs are stored in the memory and quilt
It is configured to be executed by one or more of processors, one or more of programs are configured to carry out above-mentioned task distribution
Method.
Compared with the prior art, the present invention has the following beneficial effects:
The present invention provides a kind of method that task based access control sources and big data scheme carry out reasonable distribution to task,
After the task requests for receiving receipts task initiator initiation, corresponding task is generated according to the task requests, then will be appointed
It is to be allocated that business collects backstage etc., while obtaining the processing information of preset service node in real time, the processing information of service node
Task including the current task quantity of service node, the task treatment effeciency of service node, service node handles satisfaction, industry
The priority level of business node, the Permission Levels of service node, the information such as business personnel that service node includes are distributed by task
To before service node, the basic information of task is obtained, is matched and is corresponded to according to the basic information based on preset matching rule
Service node, the task is sent to corresponding service node, reasonably distributes task to different service nodes；Together
When, receive task and executed with the task of distribution by different functional module, between different function module independently of each other, though task without
Method is handled, and still is able to receive new task requests, avoids omitting new task requests, likewise, even if can not connect
New task requests are received, still is able to be allocated existing task, is effectively prevented from the wrong and right of simple function module
The allocative efficiency of task is accelerated in the influence of other functional modules, improves the treatment effeciency of task.
The additional aspect of the present invention and advantage will be set forth in part in the description, these will become from the following description
Obviously, or practice through the invention is recognized.
Detailed description of the invention
Above-mentioned and/or additional aspect and advantage of the invention will become from the following description of the accompanying drawings of embodiments
Obviously and it is readily appreciated that, in which:
Fig. 1 is an embodiment flow diagram of method for allocating tasks of the present invention；
Fig. 2 is another embodiment flow diagram of method for allocating tasks of the present invention；
Fig. 3 is an embodiment schematic diagram of task allocation apparatus of the present invention；
Fig. 4 is an example structure schematic diagram of server of the present invention.
Specific embodiment
The embodiment of the present invention is described below in detail, examples of the embodiments are shown in the accompanying drawings, wherein from beginning to end
Same or similar label indicates same or similar element or element with the same or similar functions.Below with reference to attached
The embodiment of figure description is exemplary, and for explaining only the invention, and is not construed as limiting the claims.
Those skilled in the art of the present technique are appreciated that unless expressly stated, singular " one " used herein, " one
It is a ", " described " and "the" may also comprise plural form.It is to be further understood that being arranged used in specification of the invention
Diction " comprising " refers to that there are the feature, integer, step, operations, but it is not excluded that in the presence of or addition it is one or more other
Feature, integer, step, operation.
Those skilled in the art of the present technique are appreciated that unless otherwise defined, all terms used herein (including technology art
Language and scientific term), there is meaning identical with the general understanding of those of ordinary skill in fields of the present invention.Should also
Understand, those terms such as defined in the general dictionary, it should be understood that have in the context of the prior art
The consistent meaning of meaning, and unless idealization or meaning too formal otherwise will not be used by specific definitions as here
To explain.
It will be appreciated by those skilled in the art that of the invention so-called " application ", " application program ", " computer program " and
The concept of similar statement, is same concept well known to those skilled in the art, refers to and is instructed by series of computation machine and dependency number
According to the computer software for being suitable for electronics operation of the organic construction of resource.Unless specified, this name itself is not by programming language
Say type, rank, the operating system of operation of also not rely by it or platform are limited.In the nature of things, this genus also not by
Any type of terminal is limited.
The embodiment of the present invention provides a kind of method for allocating tasks, as shown in Figure 1, the described method comprises the following steps:
S10: receiving the task requests that task initiator initiates, and generates corresponding task according to the task requests.
In the present embodiment, using server background as executing subject, the task that the task initiator of different channels initiates is received
Request, the task initiator of different channels includes wechat small routine, such as user grasps as indicated on wechat small routine
Make, to initiate task requests, the task initiator of different channels includes application program, such as user in application program or webpage
Service required for upper submission, to initiate task requests, in the present embodiment, server background receives task initiator initiation
Task requests after, generate corresponding task according to the task requests, for example, client provides a loan in wechat small routine application, hair
Task requests are played, the present embodiment backstage generates " loan " task after receiving the task requests, it is to be allocated to collect backstage etc.
Task is collected into system background；User initiates application by website or application program and settles a claim, initiation task requests, after server
Platform, which receives, generates corresponding " Claims Resolution " task after task requests, then collects and from the background etc. to be allocated task is collected system
From the background.In the present embodiment, the specifying information of user and task can be obtained from the task requests, such as from task requests
In know the city A user submit demand for loan or be the city B user submit Claims Resolution demand.
S20: the processing information of preset service node is obtained；
In this step, the processing information of service node includes the current task quantity of service node, the task of service node
The task for the treatment of effeciency, service node handles satisfaction, the priority level of service node, the Permission Levels of service node, business
The information such as the business personnel that node includes, so that the subsequent processing information according to service node will collect appointing for server background
The service node to match is distributed in business, and in the present embodiment, the processing information of the service node be can be by manager
Member is updated, and can also be updated by the feedback data of automatic collection service node, it is preferred that the present embodiment passes through
The feedback data of automatic collection service node is updated the processing information of service node.
S30: parsing the task, obtains the basic information of task, is believed based on preset matching rule according to the basis
Breath matches corresponding service node.
In the present embodiment, different function module preferably is configured by the execution of step S10 and the execution of step S30 and is held
Row, it is mutually indepedent between different function module, be effectively prevented from the mistake of simple function module and to the shadow of other functional modules
Ring, in the present embodiment, when server background by received task request generate corresponding task collect, typing after, parse institute
The stating typing of the task, obtains the basic information of each task, and the basic information includes the initiator information of task, task
The specific requirement for generating channel, the type of task, task, is then based on preset matching rule and is matched according to the basic information
Then corresponding service node, an embodiment of the present embodiment parse the task, obtain the type information of task,
The service node of task with responsible the type, such as service node A are able to carry out the completing type S1 of the task, task node B
Be able to carry out complete type S2 task, wait get task type be S1 when, task is matched to service node A, works as acquisition
Task type be S2 when, task is matched to service node B；The another embodiment of the present embodiment parses the task,
Then the level information of acquisition task can be responsible for the service node of corresponding level according to level information matching；For example, appointing
Rank of being engaged in is 3 grades, and the permission for the service node that can be matched to is also required to be greater than 3 grades；Task rank is 1 grade, can be matched to
Service node permission be also required to be greater than 1 grade.
S40: the task is sent to corresponding service node.
In this step, after being matched task with corresponding service node according to preset matching rule, by the task
It is sent to corresponding service node, to allow service node that can receive the task and start to execute, complete the task.
Present embodiments provide the side that a kind of task based access control sources and big data scheme carry out reasonable distribution to task
Method generates corresponding task according to the task requests after the task requests for receiving receipts task initiator initiation, then will
It is to be allocated that task collects backstage etc., while obtaining the processing information of preset service node in real time, the processing letter of service node
Breath includes the current task quantity of service node, and the task of the task treatment effeciency of service node, service node handles satisfaction,
The priority level of service node, the Permission Levels of service node, the information such as business personnel that service node includes are divided by task
It is assigned to before service node, obtains the basic information of task, based on preset matching rule according to basic information matching pair
The task is sent to corresponding service node by the service node answered, and reasonably distributes task to different service nodes；
Meanwhile receiving task and being executed from the task of distribution by different functional modules, it is mutually indepedent between different function module, even if task
It is unable to get processing, still is able to receive new task requests, avoids omitting new task requests, likewise, even if can not
Receive new task requests, still be able to be allocated existing task, be effectively prevented from the mistake of simple function module and
The allocative efficiency of task is accelerated in influence to other functional modules, improves the treatment effeciency of task.
A kind of embodiment of the invention, as shown in Fig. 2, the parsing task, obtains the basic information of task, be based on
Preset matching rule matches corresponding service node according to the basic information, comprising:
S31: parsing the task, obtains the basic information of task, is believed based on preset matching rule according to the basis
Breath matches corresponding multiple service nodes, is ranked up to the multiple service node；
It is described that the task is sent to corresponding service node, comprising:
S41: the preceding service node that sorts is obtained from the multiple service node；Judge the service node obtained
Current task load, if the current task load of the service node of the acquisition be greater than preset value, task is distributed to sequence
Next service node.
In order to reasonably distribute task, the same service node is avoided to distribute excessive task, in the present embodiment, to appoint
When business matches corresponding service node, corresponding multiple business sections are matched according to the basic information based on preset matching rule
Point, as a task match multiple service nodes simultaneously, are then ranked up to multiple service node, ordering rule includes
It is further distributed by task to right with the ordering rule that service node distance, professional ability, service satisfaction are reference
Before answering service node, the preceding service node that sorts is obtained from the multiple service node, then judgement obtains
The current task load of service node, determines whether the current task load of the service node is greater than preset value, if so, in order to protect
Card task can be handled in time, and task is distributed to next service node of sequence, to avoid the same service node
Task load it is excessive and the phenomenon that task can not be handled in time.
A kind of embodiment of the invention, it is described that the multiple service node is ranked up, comprising:
Obtain each service node in the multiple business section task schedule within a preset time, task is completed
Rate, task complete the feedback information of satisfaction and task scoring, the influent factor of the ordering rule as service node, according to shadow
Ring the sequence that element adjusts the multiple service node.
In the present embodiment, when above-described embodiment is ranked up the multiple service nodes being matched to, obtains and be matched to
Multiple service nodes are within a preset time for the schedule of being distributed for task, completion rate, completion satisfaction and scoring etc.
Feedback information, for example, feedback information of the multiple service node in one month is counted, using those feedback informations as sequence
The influent factor of rule, then according to the sequence of different feedback information dynamic adjustment business nodes.A kind of reality of the present embodiment
Mode is applied, the weighted of influence of each influent factor for ordering rule in the feedback information, such as task completion rate pair
It is 40% in the weighing factor of ordering rule, it is 45% for the weighing factor of ordering rule that task, which completes satisfaction, different
Influent factor configures different weighing factors, preferably dynamic adjustment can be carried out to ordering rule, preferably by outstanding industry
Node sequencing be engaged in preceding, outstanding service node is allowed to complete task.
A kind of embodiment of the invention, it is described that the task is sent to after corresponding service node, further includes:
Service node is tracked to the feedback of the task, if being not received by service node in preset time to the task
Feedback when, task is distributed to next service node of sequence.
It in the present embodiment, distributes by task to service node, needs the schedule of real-time tracking task, first,
Whether the service node for tracking the task of being assigned has feedback to the task, to know whether service node appoints to what is distributed
Business has known that optionally, after distributing task to service node, service node can be by specified operation to server background
It is fed back, after server background receives the feedback of service node, i.e., knowable service node has had received the task, and if
When being not received by feedback of the service node to being distributed for task in preset time, according to the above-mentioned row to multiple service nodes
Sequence distributes the task to next service node of sequence；Further, tracking service node completes the progress of task, when
When the schedule of the task is unable to satisfy minimum requirements, Xiang Suoshu service node sends corresponding prompting message.
A kind of embodiment of the invention, after the processing information for obtaining preset service node, further includes:
Judge service node with the presence or absence of relationship between superior and subordinate according to the processing information of the service node；
If there are relationships between superior and subordinate between service node, judge whether junior's service node follows of higher level's service node
With rule；
If so, junior's service node matching rule is determined according to the matching rule of higher level's service node；If it is not, junior's industry
The matching rule of business node is determined according to the matching rule of own service node.
In actual application, since the scale of service node is different or the grade of service node is different, business
There are relationships between superior and subordinate for node, and there are there are certain administration authority, the present embodiment between the service node of relationship between superior and subordinate
In, after the processing information for obtaining preset service node, judge that service node is according to the processing information of the service node
No there are relationships between superior and subordinate, if there are relationships between superior and subordinate between service node, it needs to be determined that whether junior's service node follows
The matching rule of higher level's service node, for example, junior's service node receptible task whether the pipe by higher level's service node
Control, if so, junior's service node matching rule is determined according to the matching rule of higher level's service node, when higher level's service node
Matching rule modification when, need to modify the corresponding junior's service node of higher level's service node accordingly；If it is not, junior's business
The matching rule of node determines that is, the matching rule of junior's service node can be by certainly according to the matching rule of this service node
Body determines, is not influenced, is not also changed with the change of the matching rule of higher level's service node, instantly by higher level's service node
Grade service node by higher level's service node control when, can achieve the effect that be managed collectively service node, to improve business
Allocative efficiency can achieve the effect that personalization when junior's service node is not required to the control by higher level's service node, thus
The method of salary distribution to branch out.
A kind of embodiment of the invention, each service node obtained in the multiple business section is within a preset time
Task schedule, task completion rate, task complete the feedback information of satisfaction and task scoring, the sequence as service node
The influent factor of rule, the sequence of the multiple service node is adjusted according to influent factor, comprising:
Obtain the feedback information of the business in the preset time of each service node in the multiple business section；According to default
Task schedule in time obtains average schedule, obtains the first score value multiplied by the first coefficient；According in preset time
Task completion rate obtain average completion rate, obtain the second score value multiplied by the second coefficient；It is completed according to the task in preset time
Satisfaction obtains average satisfaction, obtains third score value multiplied by third coefficient；It is scored and is put down according to the task in preset time
It scores, obtains quartile multiplied by the 4th coefficient；First score value, the second score value, third score value, quartile are added, obtained
The sequence of the multiple service node is adjusted according to the sequence of total score from big to small to total score.
In the present embodiment, different feedback informations has different specific gravity, passes through the data preparation to historical feedback information
So that it is determined that the score value that service node is current, specifically, obtaining the feedback information of the business in the preset time of each service node；
Then the average schedule that will be obtained according to the task schedule in preset time obtains first point multiplied by the first coefficient
Value；The average completion rate that will be obtained according to the task completion rate in preset time obtains the second score value multiplied by the second coefficient；By root
The average satisfaction that satisfaction obtains is completed according to the task in preset time, obtains third score value multiplied by third coefficient；By basis
The average score that task in preset time scores obtains quartile multiplied by the 4th coefficient；The first score value, second point
Value, third score value, quartile are added, and obtain total score, obtain multiple service nodes of the maximum preset quantity of total score.
The application scenarios of the present embodiment.
Task collects, and wechat small routine, moving marketing system etc. can automatically generate specific type by task generting machanism
Client, and collect system background.Appoint for example, client after wechat small routine application loan, automatically generates " loan follow-up "
It is to be allocated to collect backstage etc. for business.
Task distributes:
A. it distributes setting-executing agency: for certain types of task, can distribute to and be held with the mechanism for executing qualification
Row.For example, collected loan transaction is assigned to the site with loan transaction ability and carries out follow-up and transacting business.
B. distribute setting-role: system distinguishes the scope of business of each business personnel by " role ", and work rule is being sent to set
When setting, particular task type is distributed into specified character types business personnel and is followed up, it is ensured that follow-up personnel have professional ability
Services client.
C. it distributes setting-method of salary distribution: " mean allocation ", " distributing by completeness ", " distributing by service history " can be set
Etc. modes.For example, selection " is distributed " mode by service history, then more than meeting the conditions such as " executing agency ", " role " people
It in member, if the system detects that A business personnel serviced B client, is then sent working hour in task, will preferentially service appointing for B client
A business personnel is preferentially distributed in business.
D. distribute setting-general mechanism: solve bank's multiple-limb mechanism distributes mechanism unification and personalized question.It is sending
" whether consistent with higher level " button is set in work rule, the branch sends work rule to be bound with supervisory if selecting "Yes",
If supervisory rule changes, which changes automatically.If selection "No", mechanism if, can not be by parent body's shadow
It rings, autonomous management sends work regular.
As shown in figure 3, in another embodiment, the present invention provides a kind of task allocation apparatus, comprising:
Task collects module 10: for receiving the task requests of task initiator initiation, being generated according to the task requests
Corresponding task；
Data obtaining module 20: for obtaining the processing information of preset service node；
Task matching module 30: for parsing the task, the basic information of task is obtained, preset matching rule is based on
Corresponding service node is matched according to the basic information；
Task pushing module 40: for the task to be sent to corresponding service node.
A kind of embodiment of the invention, the task matching module 30 further include executing:
Corresponding multiple service nodes are matched according to the basic information based on preset matching rule, to the multiple industry
Business node is ranked up；
The task pushing module 40 further includes executing:
The preceding service node that sorts is obtained from the multiple service node；Judge working as the service node obtained
Preceding task load distributes task to sequence if the current task load of the service node of the acquisition is greater than preset value
One service node.
A kind of embodiment of the invention, the task matching module 30 further include executing:
Obtain each service node in the multiple business section task schedule within a preset time, task is completed
Rate, task complete the feedback information of satisfaction and task scoring, the influent factor of the ordering rule as service node, according to shadow
Ring the sequence that element adjusts the multiple service node.
A kind of embodiment of the invention, the task pushing module 40 further include executing:
Service node is tracked to the feedback of the task, if being not received by service node in preset time to the task
Feedback when, task is distributed to next service node of sequence.
A kind of embodiment of the invention, the data obtaining module 20 further include executing:
Judge service node with the presence or absence of relationship between superior and subordinate according to the processing information of the service node；
If there are relationships between superior and subordinate between service node, judge whether junior's service node follows of higher level's service node
With rule；
If so, junior's service node matching rule is determined according to the matching rule of higher level's service node；If it is not, junior's industry
The matching rule of business node is determined according to the matching rule of own service node.
A kind of embodiment of the invention, the task matching module 30 further include executing:
Obtain the feedback information of the business in the preset time of each service node in the multiple business section；According to default
Task schedule in time obtains average schedule, obtains the first score value multiplied by the first coefficient；According in preset time
Task completion rate obtain average completion rate, obtain the second score value multiplied by the second coefficient；It is completed according to the task in preset time
Satisfaction obtains average satisfaction, obtains third score value multiplied by third coefficient；It is scored and is put down according to the task in preset time
It scores, obtains quartile multiplied by the 4th coefficient；First score value, the second score value, third score value, quartile are added, obtained
The sequence of the multiple service node is adjusted according to the sequence of total score from big to small to total score.
In another embodiment, the present invention provides a kind of computer readable storage medium, computer-readable storage mediums
Computer program is stored in matter, which realizes task distribution side described in above-described embodiment when being executed by processor
Method.Wherein, the computer readable storage medium includes but is not limited to any kind of disk (including floppy disk, hard disk, CD, CD-
ROM and magneto-optic disk), ROM (Read-Only Memory, read-only memory), RAM (Random AcceSS Memory, immediately
Memory), EPROM (EraSable Programmable Read-Only Memory, Erarable Programmable Read only Memory),
(Electrically EraSable Programmable Read-Only Memory, electric erazable programmable is read-only to be deposited EEPROM
Reservoir), flash memory, magnetic card or light card.It is, storage equipment includes by equipment (for example, computer, mobile phone) with energy
Any medium for the form storage or transmission information enough read can be read-only memory, disk or CD etc..
A kind of computer readable storage medium provided in an embodiment of the present invention is, it can be achieved that receive times that task initiator initiates
Business request generates corresponding task according to the task requests；Obtain the processing information of preset service node；Parsing is described to appoint
Business, obtains the basic information of task, matches corresponding service node according to the basic information based on preset matching rule；It will
The task is sent to corresponding service node.By provide a kind of task based access control sources and big data scheme to task into
The method of row reasonable distribution generates phase according to the task requests after the task requests for receiving receipts task initiator initiation
Then it is to be allocated to be collected backstage etc., while obtaining the processing information of preset service node, industry in real time by answering for task for task
The processing information of business node includes the current task quantity of service node, the task treatment effeciency of service node, service node
Task handles satisfaction, the priority level of service node, the Permission Levels of service node, the business personnel etc. that service node includes
Information is distributed by task to before service node, and the basic information of task is obtained, based on preset matching rule according to
Basic information matches corresponding service node, and the task is sent to corresponding service node, reasonably by task distribute to
Different service nodes；Meanwhile receiving task and being executed from the task of distribution by different functional modules, phase between different function module
It is mutually independent, even if task is unable to get processing, it still is able to receive new task requests, avoids omitting new task requests,
Likewise, still being able to be allocated existing task, being effectively prevented from single function even if new task requests can not be received
Can module mistake and influence to other functional modules, accelerate the allocative efficiency of task, improve the treatment effeciency of task.
The embodiment of above-mentioned method for allocating tasks may be implemented in computer readable storage medium provided in an embodiment of the present invention,
Concrete function realizes the explanation referred in embodiment of the method, and details are not described herein.
In addition, the present invention also provides a kind of servers in another embodiment, as shown in figure 4, the server includes
The devices such as processor 403, memory 405, input unit 407 and display unit 409.It will be understood by those skilled in the art that
Structure devices shown in Fig. 4 do not constitute the restriction to Servers-all, may include components more more or fewer than diagram, or
Person combines certain components.Memory 405 can be used for storing computer program 401 and each functional module, and the operation of processor 403 is deposited
The computer program 401 in memory 405 is stored up, thereby executing the various function application and data processing of equipment.Memory 405
It can be built-in storage or external memory, or including both built-in storage and external memory.Built-in storage may include read-only
Memory (ROM), programming ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), quick flashing
Memory or random access memory.External memory may include hard disk, floppy disk, ZIP disk, USB flash disk, tape etc..It is presently disclosed
Memory include but is not limited to these types memory.Memory 405 disclosed in this invention is only used as example rather than makees
To limit.
Input unit 407 is used to receive the input of signal and receives the input of user, and input unit 407 may include touch surface
Plate and other input equipments, touch panel collect user on it or nearby touch operation (such as user using finger,
The operation of any suitable object or attachment such as stylus on touch panel or near touch panel), and according to presetting
The corresponding attachment device of driven by program；Other input equipments can include but is not limited to physical keyboard, function key (for example plays
Control button, switch key etc.), trace ball, mouse, one of operating stick etc. or a variety of.Display unit 409 can be used for showing
The information of user's input is supplied to the information of user and the various menus of computer equipment.Liquid can be used in display unit 409
The forms such as crystal display, Organic Light Emitting Diode.Processor 403 is the control centre of computer equipment, using various interfaces and
The various pieces of the entire computer of connection, by running or executing the software program being stored in memory 403 and/or mould
Block, and the data being stored in memory are called, perform various functions and handle data.
In one embodiment, the server includes one or more processors 403, and one or more storages
Device 405, one or more computer programs 401, wherein one or more of computer programs 401 are stored in memory
It in 405 and is configured as being executed by one or more of processors 403, one or more of computer programs 401 configure
For executing method for allocating tasks described in above embodiments.One or more processors 403 shown in Fig. 4 are able to carry out,
Realize that task shown in Fig. 3 collects module 10, data obtaining module 20, task matching module 30, task pushing module 40
Function.
A kind of server provided in an embodiment of the present invention, it can be achieved that receive task initiator initiate task requests, according to
The task requests generate corresponding task；Obtain the processing information of preset service node；The task is parsed, task is obtained
Basic information, corresponding service node is matched according to the basic information based on preset matching rule；The task is sent out
It send to corresponding service node.Reasonable distribution is carried out to task by providing a kind of task based access control sources and big data scheme
Method generate corresponding task according to the task requests, so after the task requests for receiving receipts task initiator initiation
It is to be allocated that task is collected into backstage etc. afterwards, while obtaining the processing information of preset service node, the place of service node in real time
Reason information includes the current task quantity of service node, and the task processing of the task treatment effeciency of service node, service node is full
Meaning degree, the priority level of service node, the Permission Levels of service node, the information such as business personnel that service node includes are being incited somebody to action
Task is distributed to before service node, and the basic information of task is obtained, based on preset matching rule according to the basic information
Corresponding service node is matched, the task is sent to corresponding service node, reasonably distributes task to different industry
Business node；Meanwhile receiving task and being executed from the task of distribution by different functional modules, it is mutually indepedent between different function module,
Even if task is unable to get processing, it still is able to receive new task requests, avoids omitting new task requests, likewise,
Even if new task requests can not be received, it still is able to be allocated existing task, is effectively prevented from simple function module
Mistake and influence to other functional modules, accelerate the allocative efficiency of task, improve the treatment effeciency of task
The embodiment of the method for allocating tasks of above-mentioned offer, specific function may be implemented in server provided in an embodiment of the present invention
It is able to achieve the explanation referred in embodiment of the method, details are not described herein.
The above is only some embodiments of the invention, it is noted that for the ordinary skill people of the art
For member, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also answered
It is considered as protection scope of the present invention.
Claims (10)
1. a kind of method for allocating tasks characterized by comprising
The task requests that reception task initiator initiates generate corresponding task according to the task requests；
Obtain the processing information of preset service node；
The task is parsed, the basic information of task is obtained, based on preset matching rule according to basic information matching pair
The service node answered；
The task is sent to corresponding service node.
2. the method according to claim 1, wherein described believed based on preset matching rule according to the basis
Breath matches corresponding service node, comprising:
Corresponding multiple service nodes are matched according to the basic information based on preset matching rule, to the multiple business section
Point is ranked up；
It is described that the task is sent to corresponding service node, comprising:
The preceding service node that sorts is obtained from the multiple service node；Judge the service node obtained works as predecessor
Business load distributes task to next industry of sequence if the current task load of the service node of the acquisition is greater than preset value
Business node.
3. according to the method described in claim 2, it is characterized in that, described be ranked up the multiple service node, comprising:
It obtains each service node in the multiple business section task schedule within a preset time, task completion rate, appoint
The feedback information of satisfaction and task scoring is completed in business, and the influent factor of the ordering rule as service node is wanted according to influence
Element adjusts the sequence of the multiple service node.
4. according to the method described in claim 2, it is characterized in that, it is described by the task be sent to corresponding service node it
Afterwards, further includes:
Service node is tracked to the feedback of the task, if being not received by service node in preset time to the anti-of the task
When feedback, task is distributed to next service node of sequence.
5. according to the method described in claim 3, it is characterized in that, each service node obtained in the multiple business section
Task schedule within a preset time, task completion rate, task complete the feedback information of satisfaction and task scoring, as
The influent factor of the ordering rule of service node adjusts the sequence of the multiple service node according to influent factor, comprising:
Obtain the feedback information of the business in the preset time of each service node in the multiple business section；According to preset time
Interior task schedule obtains average schedule, obtains the first score value multiplied by the first coefficient；According to appointing in preset time
Business completion rate obtains average completion rate, obtains the second score value multiplied by the second coefficient；Satisfaction is completed according to the task in preset time
Degree obtains average satisfaction, obtains third score value multiplied by third coefficient；It is scored according to the task in preset time and is averagely commented
Point, quartile is obtained multiplied by the 4th coefficient；First score value, the second score value, third score value, quartile are added, obtained total
Score value adjusts the sequence of the multiple service node according to the sequence of total score from big to small.
6. the method according to claim 1, wherein the processing information for obtaining preset service node it
Afterwards, further includes:
Judge service node with the presence or absence of relationship between superior and subordinate according to the processing information of the service node；
If there are relationships between superior and subordinate between service node, judge whether junior's service node follows the matching of higher level's service node to advise
Then；
If so, junior's service node matching rule is determined according to the matching rule of higher level's service node；If it is not, junior's business section
The matching rule of point is determined according to the matching rule of own service node.
7. a kind of task allocation apparatus characterized by comprising
Task collects module: for receiving the task requests of task initiator initiation, being generated according to the task requests corresponding
Task；
Data obtaining module: for obtaining the processing information of preset service node；
Task matching module: for parsing the task, the basic information of task is obtained, based on preset matching rule according to institute
It states basic information and matches corresponding service node；
Task pushing module: for the task to be sent to corresponding service node.
8. device according to claim 7, which is characterized in that the task matching module further includes executing:
Corresponding multiple service nodes are matched according to the basic information based on preset matching rule, to the multiple business section
Point is ranked up；
The task pushing module further includes executing:
The preceding service node that sorts is obtained from the multiple service node；Judge the service node obtained works as predecessor
Business load distributes task to next industry of sequence if the current task load of the service node of the acquisition is greater than preset value
Business node.
9. a kind of computer readable storage medium, which is characterized in that be stored with computer on the computer readable storage medium
Program, the computer program realize method for allocating tasks as claimed in any one of claims 1 to 6 when being executed by processor.
10. a kind of server characterized by comprising
One or more processors；
Memory；
One or more computer programs, wherein one or more of computer programs are stored in the memory and quilt
It is configured to be executed by one or more of processors, one or more of computer programs are configured to carry out according to right
It is required that 1 to 6 described in any item method for allocating tasks.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811536043.6A CN109784646A (en) | 2018-12-14 | 2018-12-14 | Method for allocating tasks, device, storage medium and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811536043.6A CN109784646A (en) | 2018-12-14 | 2018-12-14 | Method for allocating tasks, device, storage medium and server |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109784646A true CN109784646A (en) | 2019-05-21 |
Family
ID=66497018
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811536043.6A Pending CN109784646A (en) | 2018-12-14 | 2018-12-14 | Method for allocating tasks, device, storage medium and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109784646A (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110264039A (en) * | 2019-05-22 | 2019-09-20 | 深圳壹账通智能科技有限公司 | A kind of generation method and equipment of working report |
| CN110264156A (en) * | 2019-05-31 | 2019-09-20 | 深圳市元征科技股份有限公司 | A kind of project management method, device, electronic equipment and storage medium |
| CN110908806A (en) * | 2019-12-02 | 2020-03-24 | 北京蜜莱坞网络科技有限公司 | Mixed flow task management method, device, equipment and storage medium |
| CN111311053A (en) * | 2019-12-17 | 2020-06-19 | 武汉空心科技有限公司 | Pre-allocation method for potential tasks of working platform |
| CN111310967A (en) * | 2019-12-17 | 2020-06-19 | 武汉空心科技有限公司 | Working platform service resource pre-scheduling method |
| CN111382178A (en) * | 2020-03-10 | 2020-07-07 | 澳克多普有限公司 | Network task allocation method, system, equipment and storage medium |
| CN111427682A (en) * | 2020-03-11 | 2020-07-17 | 支付宝(杭州)信息技术有限公司 | Task allocation method, system, device and equipment |
| CN111539631A (en) * | 2020-04-24 | 2020-08-14 | 苏州细无声信息科技服务有限公司 | Comprehensive intellectual property business management method and device, computer and storage medium |
| CN111880921A (en) * | 2020-07-31 | 2020-11-03 | 平安国际智慧城市科技股份有限公司 | Job processing method and device based on rule engine and computer equipment |
| CN112099949A (en) * | 2020-09-11 | 2020-12-18 | 北京奇艺世纪科技有限公司 | Task distribution control method and device, electronic equipment and storage medium |
| CN112613769A (en) * | 2020-12-28 | 2021-04-06 | 厦门市美亚柏科信息股份有限公司 | Intelligent scheduling method based on laboratory forensics task allocation, terminal equipment and medium |
| CN112650748A (en) * | 2019-10-09 | 2021-04-13 | 浙江大搜车软件技术有限公司 | Business clue distribution method and device, electronic equipment and readable storage medium |
| CN112700169A (en) * | 2021-01-14 | 2021-04-23 | 上海交通大学 | Business process task allocation method and system based on prediction and personnel feedback |
| CN113076547A (en) * | 2021-03-31 | 2021-07-06 | 重庆风云际会智慧科技有限公司 | Illegal evidence tracing system based on block chain |
| CN113139795A (en) * | 2021-01-28 | 2021-07-20 | 江阴逐日信息科技有限公司 | Business process task scheduling system, equipment and method based on personal schedule assistant |
| CN114358506A (en) * | 2021-12-09 | 2022-04-15 | 广东精工智能系统有限公司 | Task allocation method and system for intelligent transformation service platform |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105847358A (en) * | 2016-03-24 | 2016-08-10 | 广东三盟信息科技有限公司 | Method for realizing big data node distribution in cloud computing environment and system thereof |
| US9794136B1 (en) * | 2015-01-21 | 2017-10-17 | Pivotal Software, Inc. | Distributed resource allocation |
| CN107291545A (en) * | 2017-08-07 | 2017-10-24 | 星环信息科技（上海）有限公司 | The method for scheduling task and equipment of multi-user in computing cluster |
| CN107818407A (en) * | 2017-10-20 | 2018-03-20 | 平安科技（深圳）有限公司 | Method for allocating tasks, device, storage medium and computer equipment |
| CN108764868A (en) * | 2018-05-25 | 2018-11-06 | 全链通有限公司 | Block chain node-agent account checking method and block reconciliation agent node |
| CN108829509A (en) * | 2018-05-03 | 2018-11-16 | 山东汇贸电子口岸有限公司 | Distributed container cluster framework resources management method based on domestic CPU and operating system |
-
2018
- 2018-12-14 CN CN201811536043.6A patent/CN109784646A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9794136B1 (en) * | 2015-01-21 | 2017-10-17 | Pivotal Software, Inc. | Distributed resource allocation |
| CN105847358A (en) * | 2016-03-24 | 2016-08-10 | 广东三盟信息科技有限公司 | Method for realizing big data node distribution in cloud computing environment and system thereof |
| CN107291545A (en) * | 2017-08-07 | 2017-10-24 | 星环信息科技（上海）有限公司 | The method for scheduling task and equipment of multi-user in computing cluster |
| CN107818407A (en) * | 2017-10-20 | 2018-03-20 | 平安科技（深圳）有限公司 | Method for allocating tasks, device, storage medium and computer equipment |
| CN108829509A (en) * | 2018-05-03 | 2018-11-16 | 山东汇贸电子口岸有限公司 | Distributed container cluster framework resources management method based on domestic CPU and operating system |
| CN108764868A (en) * | 2018-05-25 | 2018-11-06 | 全链通有限公司 | Block chain node-agent account checking method and block reconciliation agent node |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110264039A (en) * | 2019-05-22 | 2019-09-20 | 深圳壹账通智能科技有限公司 | A kind of generation method and equipment of working report |
| CN110264156A (en) * | 2019-05-31 | 2019-09-20 | 深圳市元征科技股份有限公司 | A kind of project management method, device, electronic equipment and storage medium |
| CN112650748A (en) * | 2019-10-09 | 2021-04-13 | 浙江大搜车软件技术有限公司 | Business clue distribution method and device, electronic equipment and readable storage medium |
| CN110908806A (en) * | 2019-12-02 | 2020-03-24 | 北京蜜莱坞网络科技有限公司 | Mixed flow task management method, device, equipment and storage medium |
| CN111311053A (en) * | 2019-12-17 | 2020-06-19 | 武汉空心科技有限公司 | Pre-allocation method for potential tasks of working platform |
| CN111310967A (en) * | 2019-12-17 | 2020-06-19 | 武汉空心科技有限公司 | Working platform service resource pre-scheduling method |
| CN111382178A (en) * | 2020-03-10 | 2020-07-07 | 澳克多普有限公司 | Network task allocation method, system, equipment and storage medium |
| CN111427682A (en) * | 2020-03-11 | 2020-07-17 | 支付宝(杭州)信息技术有限公司 | Task allocation method, system, device and equipment |
| CN111427682B (en) * | 2020-03-11 | 2023-09-01 | 支付宝(杭州)信息技术有限公司 | Task allocation method, system, device and equipment |
| CN111539631A (en) * | 2020-04-24 | 2020-08-14 | 苏州细无声信息科技服务有限公司 | Comprehensive intellectual property business management method and device, computer and storage medium |
| CN111880921A (en) * | 2020-07-31 | 2020-11-03 | 平安国际智慧城市科技股份有限公司 | Job processing method and device based on rule engine and computer equipment |
| CN112099949A (en) * | 2020-09-11 | 2020-12-18 | 北京奇艺世纪科技有限公司 | Task distribution control method and device, electronic equipment and storage medium |
| CN112099949B (en) * | 2020-09-11 | 2023-09-05 | 北京奇艺世纪科技有限公司 | Task distribution control method and device, electronic equipment and storage medium |
| CN112613769A (en) * | 2020-12-28 | 2021-04-06 | 厦门市美亚柏科信息股份有限公司 | Intelligent scheduling method based on laboratory forensics task allocation, terminal equipment and medium |
| CN112700169A (en) * | 2021-01-14 | 2021-04-23 | 上海交通大学 | Business process task allocation method and system based on prediction and personnel feedback |
| CN113139795A (en) * | 2021-01-28 | 2021-07-20 | 江阴逐日信息科技有限公司 | Business process task scheduling system, equipment and method based on personal schedule assistant |
| CN113076547A (en) * | 2021-03-31 | 2021-07-06 | 重庆风云际会智慧科技有限公司 | Illegal evidence tracing system based on block chain |
| CN114358506A (en) * | 2021-12-09 | 2022-04-15 | 广东精工智能系统有限公司 | Task allocation method and system for intelligent transformation service platform |
| CN114358506B (en) * | 2021-12-09 | 2022-09-30 | 广东精工智能系统有限公司 | Task allocation method and system for intelligent transformation service platform |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109784646A (en) | Method for allocating tasks, device, storage medium and server | |
| US9407572B2 (en) | Multiple cloud marketplace aggregation | |
| US8782233B2 (en) | Embedding a cloud-based resource request in a specification language wrapper | |
| US20140278652A1 (en) | Hybrid system and method for selecting and deploying field technicians in a facilities management hybrid workforce | |
| CN109978356A (en) | Mark method for allocating tasks, device, medium and computer equipment | |
| CN104580284B (en) | Traffic assignments device and method for distributing business | |
| CN109471710A (en) | Processing method, device, processor, terminal and the server of task requests | |
| CN105809323A (en) | Task allocation method and system | |
| CN101223507A (en) | Data processing network | |
| CN105930920A (en) | Logistics distribution management method and logistics distribution management apparatus | |
| CN109740851A (en) | Design for Automatic Control Engineering work management method, platform and the system quickly delivered | |
| US20130030858A1 (en) | Dynamically facilitating project assembly | |
| CN105321137A (en) | Interpretation request management system, method for controlling the same, interpretation request management apparatus, method for controlling the same | |
| US20180322439A1 (en) | Systems and methods for generating activities across an enterprise | |
| CN109919342A (en) | Meeting room preordering method, device, storage medium and terminal device | |
| US9436509B2 (en) | Pre-provisioned web application platform site collections | |
| CN104615719A (en) | Intelligent application distributing method and device | |
| CN108874520A (en) | Calculation method and device | |
| CN112965803A (en) | AI model generation method and electronic equipment | |
| CN104871149A (en) | Asset assignment having unique skills and/or capabilities | |
| CN104580495B (en) | Network request treating method and apparatus | |
| CN109324913A (en) | A kind of management method and device for more OpenStack cloud platforms | |
| CN106992901B (en) | Method and apparatus for resource scheduling analog pressure | |
| CN104735134B (en) | A kind of method and apparatus serviced for providing calculating | |
| Martonosi | Dynamic server allocation at parallel queues |
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 |