CN104601704B - The colony dispatching data processing method and system of a kind of task based access control - Google Patents

The colony dispatching data processing method and system of a kind of task based access control Download PDF

Info

Publication number
CN104601704B
CN104601704B CN201510024925.4A CN201510024925A CN104601704B CN 104601704 B CN104601704 B CN 104601704B CN 201510024925 A CN201510024925 A CN 201510024925A CN 104601704 B CN104601704 B CN 104601704B
Authority
CN
China
Prior art keywords
subtask
terminal
task
dispatch
condition
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.)
Active
Application number
CN201510024925.4A
Other languages
Chinese (zh)
Other versions
CN104601704A (en
Inventor
杜飞
曾远芳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Putian Yitonge Technology Ltd By Share Ltd
Original Assignee
Shenzhen Putian Yitonge Technology Ltd By Share Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Putian Yitonge Technology Ltd By Share Ltd filed Critical Shenzhen Putian Yitonge Technology Ltd By Share Ltd
Priority to CN201510024925.4A priority Critical patent/CN104601704B/en
Publication of CN104601704A publication Critical patent/CN104601704A/en
Application granted granted Critical
Publication of CN104601704B publication Critical patent/CN104601704B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The colony dispatching data processing method and system, the method for a kind of task based access control provided by the present invention specifically include:It is set at dispatch server end and prestores pending task;The pending task is preset into regular partition as multiple subtasks according to one, and multiple schedulable conditions and weight parameter corresponding with schedulable condition are set for each subtask;When dispatch server end detects that pending task occurs, according to the schedulable condition and weight parameter corresponding with schedulable condition, it is calculated according to a pre-defined algorithm and performs the corresponding optimal scheduling terminal in each subtask, then subtask information is pushed to the corresponding optimal scheduling terminal in each subtask;The optimal scheduling terminal receives the subtask information, and respective handling is made to the subtask, and task completes backward dispatch server end and submits handling result.Present invention optimizes task scheduling flow, the efficiency of task scheduling is improved.

Description

The colony dispatching data processing method and system of a kind of task based access control
Technical field
The present invention relates to colony dispatching technical field more particularly to a kind of colony dispatching data processing methods of task based access control And system.
Background technology
Trunked Radio System is a kind of mobile communication system for group communication command scheduling, is mainly used in professional shifting The dynamic communications field, such as police service, electric power, civil aviaton's industry.Existing Trunked Radio System mainly includes voice scheduling, video dispatching With position tracking scheduling etc. functions.Trunked Radio System generally includes dispatching desk, three parts of dispatch terminal and dispatch server. The workflow of scheduling system is typically:Dispatcher or administrative staff create group on dispatching desk, and dispatcher monitors each group The state of each member of group, certain event occurs during monitoring, dispatcher's analysis and judge should be to group that event is handled Or it is personal, to group or personal initiation group is exhaled or individual calling, commands and dispatches group or individual is responded and handled to event.
Existing task scheduling flow is:After the task that detects occurs, it is necessary to by dispatcher to the analysis of task and Judge to determine the treatment people of task, and implement task scheduling;Or exhaled by dispatcher's initiation group, wait corresponding processing Personnel exhale group carry out response after, to treatment people allocation schedule task.
Therefore, there are following defects for existing implementation:Due to needing through analysis of the dispatcher to task, judgement And scheduling, therefore exist to task low-response, handle risk not in time;For some promptly happening suddenly for tasks, may lead Cause task is dealt with improperly.
Therefore, the prior art has yet to be improved and developed.
The content of the invention
The technical problem to be solved in the present invention is, for the drawbacks described above of the prior art, provides a kind of task based access control Colony dispatching data processing method and system, it is intended to by real-time optimization task scheduling flow of the present invention, solve in the prior art Existing the defects of handling task low-response, processing not in time, so as to improve the efficiency of colony dispatching task response.
The technical proposal for solving the technical problem of the invention is as follows:
A kind of colony dispatching data processing method of task based access control, wherein, including step:
S1, set at dispatch server end and prestore pending task;
S2, the pending task is preset into regular partition as multiple subtasks according to one, and appointed for each son Business sets multiple schedulable conditions and weight parameter corresponding with schedulable condition;
S3, when dispatch server end detects that pending task occurs, according to the schedulable condition and with dispatching item The corresponding weight parameter of part calculates according to a pre-defined algorithm and performs the corresponding optimal scheduling terminal in each subtask, then to every The corresponding optimal scheduling terminal push subtask information in one subtask;
S4, the optimal scheduling terminal receive the subtask information, make respective handling to the subtask, task is complete Handling result is submitted into backward dispatch server end.
The colony dispatching data processing method of the task based access control, wherein, the step S2 is further included:
S21, weight parameter corresponding with schedulable condition, the weight are set for the different schedulable conditions of each subtask Parameter is used to choose the schedulable condition for needing to meet successively according to the height of weight parameter value when deployed.
The colony dispatching data processing method of the task based access control, wherein, the step S3 specifically includes step:
S31, pre-set and store the adaptation index that dispatch terminal corresponds to each subtask difference schedulable condition;
S32, when dispatch server end detects that pending task occurs, select in each subtask weight parameter most Schedulable condition corresponding to height, and highest in pre-stored adaptation index dispatch eventually is searched according to the schedulable condition of selection End;
If it S33, is according to highest dispatch terminal in the pre-stored adaptation index of the schedulable condition of selection lookup Idle state then sets the idle dispatch terminal as the corresponding optimal scheduling terminal in the subtask;
If it S34, is according to highest dispatch terminal in the pre-stored adaptation index of the schedulable condition of selection lookup Busy state then further searches for the high idle dispatch terminal of adaptation index time;If without the free time under current scheduling condition Dispatch terminal, then the further schedulable condition corresponding to selection weight parameter time height, repeats step S33;
If S35, searched according to the schedulable condition of selection the pre-stored highest dispatch terminal of adaptation index have it is multiple, Then further adaptation index of more the multiple dispatch terminal under time high schedulable condition of weight, repeats S33 and S34.
The colony dispatching data processing method of the task based access control, wherein, the step S3 is further included:The scheduling clothes Device end be engaged in the corresponding optimal scheduling terminal push subtask information in each subtask, including short message or audio call form.
The colony dispatching data processing method of the task based access control, wherein, the step S4 specifically includes step:
S41, the corresponding optimal scheduling terminal in subtask receive the subtask information, and the subtask are made accordingly Processing after having handled task, sends subtask performance to the dispatch server end and optimal scheduling terminal performs feelings Condition confirms the processing to subtask;
S42, the dispatch server end according to the subtask performance to the schedulable condition of corresponding subtask and with The corresponding weight parameter of schedulable condition is modified and is preserved;
S43, the dispatch server end correspond to subtask according to the dispatch terminal implementation status to corresponding dispatch terminal The adaptation index of different schedulable conditions is modified and is preserved.
A kind of colony dispatching data handling system of task based access control, wherein, including:
Task preprocessing module, for being set at dispatch server end and prestoring pending task;
Subtask decomposing module is appointed for the pending task to be preset regular partition according to one for multiple sons Business, and multiple schedulable conditions and weight parameter corresponding with schedulable condition are set for each subtask;
Dispatch terminal determining module, for when dispatch server end detects that pending task occurs, according to described It is corresponding most to calculate each subtask of execution according to a pre-defined algorithm for schedulable condition and weight parameter corresponding with schedulable condition Excellent dispatch terminal, then push subtask information to the corresponding optimal scheduling terminal in each subtask;
Task processing module receives the subtask information for the optimal scheduling terminal, the subtask is made Respective handling, task complete backward dispatch server end and submit handling result.
The colony dispatching data handling system of the task based access control, wherein, the subtask decomposing module further includes:
Schedulable condition priority level initializing unit, for for the different schedulable conditions of each subtask setting and schedulable condition Corresponding weight parameter, the weight parameter need what is met for being chosen successively according to the height of weight parameter value when deployed Schedulable condition.
The colony dispatching data handling system of the task based access control, wherein, the dispatch terminal determining module is specifically wrapped It includes:
Dispatch terminal pretreatment unit corresponds to each subtask difference schedulable condition for pre-setting and storing dispatch terminal Adaptation index;
Detection unit, for when dispatch server end detects that pending task occurs, selecting in each subtask Schedulable condition corresponding to weight parameter highest, and searched according to the schedulable condition of selection in pre-stored adaptation index most High dispatch terminal;
First identifying unit, if highest in pre-stored adaptation index for being searched according to the schedulable condition of selection Dispatch terminal is in idle condition, then sets the idle dispatch terminal as the corresponding optimal scheduling terminal in the subtask;
Second identifying unit, if highest in pre-stored adaptation index for being searched according to the schedulable condition of selection Dispatch terminal is in busy state, then further searches for the high idle dispatch terminal of adaptation index time;If in current scheduling item There is no idle dispatch terminal under part, then further select the schedulable condition corresponding to weight parameter time height;
3rd identifying unit, if for searching the pre-stored highest tune of adaptation index according to the schedulable condition of selection Degree terminal has multiple, then further adaptation index of more the multiple dispatch terminal under time high schedulable condition of weight.
The colony dispatching data handling system of the task based access control, wherein, the task processing module specifically includes:
Task handles confirmation unit, and the subtask information is received for the corresponding optimal scheduling terminal in subtask, and right Respective handling is made in the subtask, after having handled task, to the dispatch server end send subtask performance and Optimal scheduling terminal implementation status confirms the processing to subtask;
First modification unit, for the dispatch server end according to the subtask performance to corresponding subtask Schedulable condition and weight parameter corresponding with schedulable condition are modified and are preserved;
Second modification unit, for the dispatch server end according to the dispatch terminal implementation status to accordingly dispatching end The adaptation index of the corresponding subtask difference schedulable condition in end is modified and is preserved.
The colony dispatching data handling system of the task based access control, wherein, the dispatch terminal determining module further includes: The dispatch server end pushes subtask information to the corresponding optimal scheduling terminal in each subtask, is exhaled including short message or voice It is form.
The colony dispatching data processing method and system, the method for a kind of task based access control provided by the present invention are specifically wrapped It includes:It is set at dispatch server end and prestores pending task;The pending task is preset according to one Regular partition is multiple subtasks, and sets multiple schedulable conditions and weight corresponding with schedulable condition ginseng for each subtask Number;When dispatch server end detects that pending task occurs, according to the schedulable condition and corresponding with schedulable condition Weight parameter calculates according to a pre-defined algorithm and performs the corresponding optimal scheduling terminal in each subtask, then to each subtask Corresponding optimal scheduling terminal pushes subtask information;The optimal scheduling terminal receives the subtask information, to the son Task makes respective handling, and task completes backward dispatch server end and submits handling result.Real-time optimization of the present invention task tune Flow is spent, the scheduling flow that ensure that task is the optimal process that current system can complete the scheduler task, so as to reach task Processing is corresponding quickly, handles timely effect;And carry out voice and video scheduling progress to conventional cluster dispatching method is only simple Extension, while also extend colony dispatching uses field.
Description of the drawings
Fig. 1 is the flow chart of the first preferred embodiment of the colony dispatching data processing method the present invention is based on task.
Fig. 2 is the flow chart of the second preferred embodiment of the colony dispatching data processing method the present invention is based on task.
Fig. 3 is the function module of the first preferred embodiment of the colony dispatching data handling system the present invention is based on task Figure.
Fig. 4 is that the dispatch terminal of the first preferred embodiment of the colony dispatching data handling system the present invention is based on task is true The cut-away view of cover half block.
Fig. 5 is the task processing mould of the first preferred embodiment of the colony dispatching data handling system the present invention is based on task The cut-away view of block.
Specific embodiment
The invention discloses colony dispatching data processing method, the system of a kind of task based access control, for make the purpose of the present invention, Technical solution and advantage are clearer, clear and definite, and the present invention is described in more detail for the embodiment that develops simultaneously referring to the drawings.It should Understand, the specific embodiments described herein are merely illustrative of the present invention, is not intended to limit the present invention.
Fig. 1 is referred to, Fig. 1 is the first preferred embodiment of the colony dispatching data processing method the present invention is based on task Flow chart.The colony dispatching data processing method of task based access control shown in FIG. 1, including:
Step S101, set at dispatch server end and prestore pending task.
Step S102, the pending task is preset into regular partition as multiple subtasks according to one, and is every One subtask sets multiple schedulable conditions and weight parameter corresponding with schedulable condition.
, it is necessary to be set at dispatch server end and prestore pending task in the embodiment of the present invention, afterwards according to One sets rule by the pending Task-decomposing as multiple subtasks.For example, the line maintenance of certain electric power saving overhauling company Line maintenance task is divided into multiple subtasks by task, dispatcher by section, and such as setting is divided into one section every 50KM, then sets 100KM-150KM is a maintenance subtask, and 150KM-200KM is a maintenance subtask, and the rest may be inferred for remaining.
Dispatch server pre-allocates schedulable condition and weight parameter corresponding with schedulable condition for these subtasks afterwards, can To distribute multiple conditions, each condition configures a corresponding weight parameter.Such as:Dispatcher is according to each maintenance section geographical conditions Or actual conditions distribute weight parameter, such as two scheduling items of each maintenance cross-talk task setting for the subtask of these segmentations Part, is respectively technical ability index and environmental index, and the technical ability exponential representation performs the technical ability of this section maintenance required by task to master Proficiency;The environmental index represent to perform this section maintenance task apart from degree.In detail, 100KM-150KM sections are set The weight parameter of technical ability index is 0.2, and the weight parameter of environmental index is 0.1;The weight of 150KM-200KM sections of technical ability index Parameter is 0.1, and the weight parameter of environmental index is 0.2.
Further, it is the different schedulable conditions setting of each subtask and schedulable condition phase in the embodiment of the present invention The weight parameter answered, the weight parameter are used to choose the tune for needing to meet successively according to the height of weight parameter value when deployed Degree condition, i.e. the schedulable condition priority in subtask is according to corresponding weight parameter value height successively sequencing selection.Example Such as, the schedulable condition priority ranking of 100KM-150KM sections of subtask is more than environmental index for technical ability index;And 150KM- 200KM sections of schedulable condition priority ranking is more than technical ability index for environmental index.
Step S103, when dispatch server end detects that pending task occurs, according to the schedulable condition and with The corresponding weight parameter of schedulable condition calculates according to a pre-defined algorithm and performs the corresponding optimal scheduling terminal in each subtask, Again subtask information is pushed to the corresponding optimal scheduling terminal in each subtask.
In the embodiment of the present invention, the step S103 specifically includes step:
S31, pre-set and store the adaptation index that dispatch terminal corresponds to each subtask difference schedulable condition;
S32, when dispatch server end detects that pending task occurs, select in each subtask weight parameter most Schedulable condition corresponding to height, and highest in pre-stored adaptation index dispatch eventually is searched according to the schedulable condition of selection End;
If it S33, is according to highest dispatch terminal in the pre-stored adaptation index of the schedulable condition of selection lookup Idle state then sets the idle dispatch terminal as the corresponding optimal scheduling terminal in the subtask;
If it S34, is according to highest dispatch terminal in the pre-stored adaptation index of the schedulable condition of selection lookup Busy state then further searches for the high idle dispatch terminal of adaptation index time;If without the free time under current scheduling condition Dispatch terminal, then the further schedulable condition corresponding to selection weight parameter time height, repeats step S33;
If S35, searched according to the schedulable condition of selection the pre-stored highest dispatch terminal of adaptation index have it is multiple, Then further adaptation index of more the multiple dispatch terminal under time high schedulable condition of weight, repeats S33 and S34.
I.e.:The adaptation that dispatch terminal corresponds to each subtask difference schedulable condition is pre-set and stored in dispatch server Index, dispatcher receive maintenance task, task are submitted to maintenance dispatch server, maintenance dispatch server is pre-set This maintenance task and its multiple subtasks decomposed are found in task;Dispatch server is overhauled afterwards according to each subtask Schedulable condition and weight parameter, calculate the corresponding idle dispatch terminal of subtasking according to predefined algorithm, mark it For optimal scheduling terminal.For example, when setting performs the 100KM-150KM sections of terminals for overhauling task, the weight of technical ability index is high, excellent First selection meets the terminal of technical ability index, and the technical ability index that pre-stored terminal A completes 100KM-150KM cross-talk tasks is The technical ability index that 0.3, dispatch terminal B complete the cross-talk task is 0.1, then maintenance scheduling system can be this scheduling subtask It is automatically assigned to dispatch terminal A completions;If dispatch terminal A is in busy state(Such as:Dispatch terminal A is carrying out certain A task or dispatch terminal A be online, can not call scheduling), then the further scheduling corresponding to selection weight parameter time height Condition, i.e. environmental index continue to judge under environmental index the adaptation index highest of each dispatch terminal and to be idle.For another example, When setting performs the 150KM-200KM sections of terminals for overhauling task, environmental index weight is high, preferentially meets environmental index, if in advance The non-occupied terminal C of storage performs distance location apart from subtask and then represents adaptation index highests of the C to environmental index recently, therefore Selection terminal C completes this task.If under present weight parameter, multiple dispatch terminals correspond to each subtask difference schedulable condition Be adapted to index it is identical, the distance of even terminal C and D is identical, at this time further more the multiple dispatch terminal in weight parameter The adaptation index of each subtask difference schedulable condition of correspondence of secondary relative superiority or inferiority judges the technical ability index of two terminals, if the skill of terminal D Can skillfully better than terminal C, then optimal scheduling terminal of the terminal D as the subtask be selected at this time by index.
Preferably, the optimal scheduling terminal of each subtask can be weaved into group by dispatch server.If some task has Multiple subtasks then need to dispatch multiple and different terminals and go to perform, and dispatch server can add these dispatch terminals at this time Enter into a scheduling group to be coordinated between terminal.
Step S104, described optimal scheduling terminal receives the subtask information, and respective handling is made to the subtask, Task completes backward dispatch server end and submits handling result.
In the embodiment of the present invention, the step S104 specifically includes step:
S41, the corresponding optimal scheduling terminal in subtask receive the subtask information, and the subtask are made accordingly Processing after having handled task, sends subtask performance to the dispatch server end and optimal scheduling terminal performs feelings Condition confirms the processing to subtask;
S42, the dispatch server end according to the subtask performance to the schedulable condition of corresponding subtask and with The corresponding weight parameter of schedulable condition is modified and is preserved;
S43, the dispatch server end correspond to subtask according to the dispatch terminal implementation status to corresponding dispatch terminal The adaptation index of different schedulable conditions is modified and is preserved.
That is, dispatch server pushes subtask information according to result of calculation to each optimal scheduling terminal, it is preferable that push Subtask information uses short message or audio call form;Dispatch terminal receives task, and affiliated staff views task And perform task;Staff has performed task, feeds back implementation status;Server adjusts subtask according to subtask performance Schedulable condition and corresponding weight parameter, subtask scheduling condition sequence when data after adjustment are as next execution task Condition;The adaptation index of some subtask scheduling condition of terminal-pair is adjusted according to implementation status simultaneously, the data after adjustment can be made For the sort criteria of next dispatch terminal.
Such as after the completion of 100KM-150KM sections of maintenance subtask, server is by the weight of the cross-talk task technical ability index Parameter adjustment is 0.1, and the weight parameter of environmental index is adjusted to 0.2, represents to dispatch section maintenance priority of task selection pair next time The terminal that environmental condition is most adapted to;For another example, if dispatch terminal B is assigned the maintenance task of 100KM-150KM sections of completion, after finishing Terminal B is adjusted to 0.2 by 0.1 in the skilled index of technical ability of this section, represents terminal B in this section by system according to performance Maintenance technical ability increases.
It below will the present invention will be further described by specific Application Example.Fig. 2 is that the present invention is based on tasks Second preferred embodiment flow chart of colony dispatching data processing method.As shown in Fig. 2, including step:
It is pre-set on S20, dispatch server and stores pending task.
S21, on dispatch server by task predecomposition it is one or more subtasks.
The decomposition can be according to actual conditions, such as the line maintenance task of certain electric power saving overhauling company, dispatcher can incite somebody to action Line maintenance task is divided into subtask by section.Such as set and be divided into one section every 50KM, then 100KM-150KM is set as one A maintenance subtask, 150KM-200KM are a maintenance subtask, and the rest may be inferred for remaining.
S22, multiple schedulable conditions and corresponding weight parameter are pre-allocated for these subtasks on the server.
The schedulable condition of the subtask can be one or more, and each condition configures a corresponding weight parameter.Example Such as:Dispatcher distributes weight parameter according to each maintenance section geographical conditions or actual conditions for the subtask of these segmentations, such as often One maintenance cross-talk two schedulable condition of task setting, is respectively technical ability index and environmental index, the technical ability exponential representation is held The skill proficiency of row this section maintenance required by task to master;The environmental index represents to perform the distance of this section maintenance task. In detail, 100KM-150KM sections of technical ability index is set as 0.2, environmental index 0.1;150KM-200KM sections of technical ability index For 0.1, environmental index 0.2.
Further, weight parameter corresponding with schedulable condition, institute are set for the different schedulable conditions of each subtask Weight parameter is stated for choosing the schedulable condition for needing to meet successively according to the height of weight parameter value when deployed, i.e. son is appointed Schedulable condition priority in business is according to corresponding weight parameter value height successively sequencing selection.For example, 100KM-150KM The schedulable condition priority ranking of the subtask of section is more than environmental index for technical ability index;And 150KM-200KM sections of scheduling item Part priority ranking is more than technical ability index for environmental index.
S23 while the adaptation index that corresponding subtask difference schedulable condition is set on the server for dispatch terminal.
S24, dispatcher, which detect, to be needed to perform scheduler task, and pre-set task is selected from server, is looked into simultaneously Ask the subtask of the task and the schedulable condition of subtask and with the corresponding weight parameter of schedulable condition.
The corresponding schedulable condition of highest weighting parameter in S25, server selection subtask.
S26, server search the highest scheduling of adaptation index of the corresponding schedulable condition eventually according to the schedulable condition of selection End.
S27, judge whether the dispatch terminal is in idle condition under this schedulable condition.
If S28, the dispatch terminal are in busy state, the secondary high terminal of mobile terminal adaptation index is selected;It if should All dispatch terminals are in busy state under schedulable condition, then the schedulable condition for selecting weight parameter time high repeats S26.
If S29, the dispatch terminal are in idle condition, judge that the dispatch terminal for optimal scheduling terminal, services afterwards The optimal scheduling terminal of each subtask is weaved into group by device, and by pending mission dispatching to dispatch terminal group.
That is, the rule of the optimal idle dispatch terminal of calculating in the present embodiment is:It is set in advance at dispatch server end And store the adaptation index that each dispatch terminal corresponds to subtask scheduling condition;When dispatch server end detects pending task During generation, according to the schedulable condition weight parameter selection scheduling condition of the subtask of setting, by pre-stored each dispatch terminal The adaptation index for selecting subtask scheduling condition is compared;The idle and adaptation highest dispatch terminal of index is selected, and The adaptation highest dispatch terminal of index is set as the corresponding optimal scheduling terminal in subtask.If it is adapted to the highest scheduling of index When terminal is in busy state, then the secondary high schedulable condition of weight parameter is further selected, this step is repeated, until selecting Schedulable terminal.
For example, when setting performs the 100KM-150KM sections of terminals for overhauling task, preferentially meet technical ability index, prestore Terminal A complete 100KM-150KM cross-talk tasks technical ability adaptation index be 0.3, dispatch terminal B completes the skill of the cross-talk task Index can be adapted to as 0.1, then this scheduling subtask can be automatically assigned to dispatch terminal A and completed by maintenance scheduling system;Such as When fruit dispatch terminal A is carrying out other tasks or can not call, then the further scheduling corresponding to selection weight parameter time height Condition, i.e. environmental index continue to judge that the adaptation index of each dispatch terminal is highest under environmental index.For another example, setting performs 150KM-200KM sections maintenance task terminal when, preferentially meet environmental index, if pre-stored non-occupied terminal C environment be adapted to Index highest, then select C.If the environment adaptation index of terminal C and D is identical, further compare technical ability exponential quantity, if terminal D The skilled index of technical ability is better than terminal C, then selects optimal scheduling terminal of the terminal D as the subtask at this time.
S30, dispatch terminal group receive task, its affiliated staff is notified to perform task.
S31, staff have performed task, by dispatch terminal to server feedback implementation status.
S32, server adjust the weight parameter of subtask according to implementation status, while complete according to implementation status adjustment terminal Into the adaptation index of subtask.
In the present embodiment, dispatch terminal feeds back corresponding implementation status after having performed task, and server is complete according to subtask Schedulable condition and corresponding weight parameter into situation adjustment subtask, the son when data after adjustment are used as next execution task The condition of task priority sequence, while terminal is adjusted according to implementation status and completes some adaptation index for dispatching subtask;It adjusts Data after whole can be as the sort criteria of next dispatch terminal.
Such as after the completion of 100KM-150KM sections of maintenance subtask, server is by the weight of the cross-talk task technical ability index Parameter adjustment is 0.1, and the weight parameter of environmental index is 0.2, represents to dispatch the requirement of this section maintenance task technical ability index next time It reduces, adjusts the distance and wait the rise of environmental indexs priority;For another example, if dispatch terminal B is assigned the maintenance of 100KM-150KM sections of completion Task, after finishing system terminal B is adjusted to 0.3 by 0.2 in the technical ability adaptation index of this section, is represented eventually according to performance End B increases in the maintenance technical ability of this section.
Therefore real-time optimization of the present invention task scheduling flow, the scheduling flow that ensure that task are current systems The optimal process of the scheduler task can be completed, and only simple progress voice and video scheduling carries out to conventional cluster dispatching method Extension, while also extend the efficiency for using field, improving task scheduling of colony dispatching.The method overcomes the prior art Present in task processing low-response, processing not in time the defects of, have rapid timely excellent to the response of colony dispatching task Point.
Based on above-described embodiment, the present invention also provides a kind of colony dispatching data handling system of task based access control, such as Fig. 3 institutes Show, including:
Task preprocessing module 100, for being set at dispatch server end and prestoring pending task;Specifically such as It is upper described.
Subtask decomposing module 200 is multiple for the pending task to be preset regular partition according to one Subtask, and multiple schedulable conditions and weight parameter corresponding with schedulable condition are set for each subtask;As detailed above.
Dispatch terminal determining module 300, for when dispatch server end detects that pending task occurs, according to institute Schedulable condition and weight parameter corresponding with schedulable condition are stated, it is corresponding to calculate each subtask of execution according to a pre-defined algorithm Optimal scheduling terminal, then push subtask information to the corresponding optimal scheduling terminal in each subtask;As detailed above.
Task processing module 400 receives the subtask information for the optimal scheduling terminal, the subtask is made Go out respective handling, task completes backward dispatch server end and submits processing knot;As detailed above.
Further, the subtask decomposing module further includes:
Schedulable condition priority level initializing unit, for for the different schedulable conditions of each subtask setting and schedulable condition Corresponding weight parameter, the weight parameter need what is met for being chosen successively according to the height of weight parameter value when deployed Schedulable condition;As detailed above.
Further, the colony dispatching data handling system of the task based access control, as shown in figure 4, the dispatch terminal is true Cover half block 300 further includes:
Dispatch terminal pretreatment unit 310 corresponds to the different scheduling in each subtask for pre-setting and storing dispatch terminal The adaptation index of condition;As detailed above.
Detection unit 320, for when dispatch server end detects that pending task occurs, selecting each subtask In schedulable condition corresponding to weight parameter highest, and searched according to the schedulable condition of selection in pre-stored adaptation index Highest dispatch terminal;As detailed above.
First identifying unit 330, if for being searched according to the schedulable condition of selection in pre-stored adaptation index most High dispatch terminal is in idle condition, then it is whole as the corresponding optimal scheduling in the subtask to set the idle dispatch terminal End;As detailed above.
Second identifying unit 340, if for being searched according to the schedulable condition of selection in pre-stored adaptation index most High dispatch terminal is in busy state, then further searches for the high idle dispatch terminal of adaptation index time;If it is adjusted currently There is no idle dispatch terminal under the conditions of degree, then further select the schedulable condition corresponding to weight parameter time height;Specifically as above It is described.
3rd identifying unit 350, if for searching pre-stored adaptation index highest according to the schedulable condition of selection Dispatch terminal have multiple, then further adaptation of more the multiple dispatch terminal under time high schedulable condition of weight refers to Number;As detailed above.
Further, the colony dispatching data handling system of the task based access control, as shown in figure 5, the task handles mould Block 400 specifically includes:
Task handles confirmation unit 410, and the subtask information is received for the corresponding optimal scheduling terminal in subtask, and Respective handling is made to the subtask, after having handled task, to the dispatch server end send subtask performance with And optimal scheduling terminal implementation status confirms the processing to subtask;As detailed above.
First modification unit 420, appoints corresponding son according to the subtask performance for the dispatch server end The schedulable condition of business and weight parameter corresponding with schedulable condition are modified and are preserved;As detailed above.
Second modification unit 430, for the dispatch server end according to the dispatch terminal implementation status to accordingly adjusting Degree terminal-pair answers the adaptation index of subtask difference schedulable condition to modify and preserve;As detailed above.
Further, the dispatch terminal determining module further includes:The dispatch server end is corresponded to each subtask Optimal scheduling terminal push subtask information, including short message or audio call form.
In conclusion the colony dispatching data processing method and system of a kind of task based access control provided by the present invention, described Method specifically includes:It is set at dispatch server end and prestores pending task;By the pending task according to One presets regular partition as multiple subtasks, and sets multiple schedulable conditions and corresponding to schedulable condition for each subtask Weight parameter;When dispatch server end detects that pending task occurs, according to the schedulable condition and with dispatching item The corresponding weight parameter of part calculates according to a pre-defined algorithm and performs the corresponding optimal scheduling terminal in each subtask, then to every The corresponding optimal scheduling terminal push subtask information in one subtask;The optimal scheduling terminal receives the subtask information, Respective handling is made to the subtask, task completes backward dispatch server end and submits handling result.Real-time optimization of the present invention Task scheduling flow, the scheduling flow that ensure that task are the optimal processes that current system can complete the scheduler task, and right Only simple progress voice and video scheduling is extended conventional cluster dispatching method, while also extends the use of colony dispatching Field.The method overcomes the defects of handling task low-response, processing not in time in the prior art, has to cluster The advantages of scheduler task response is rapid timely.
It should be appreciated that the application of the present invention is not limited to the above, it for those of ordinary skills, can To be improved or converted according to the above description, all these modifications and variations should all belong to the guarantor of appended claims of the present invention Protect scope.

Claims (6)

1. the colony dispatching data processing method of a kind of task based access control, which is characterized in that including step:
S1, set at dispatch server end and prestore pending task;
S2, the pending task is preset into regular partition as multiple subtasks according to one, and is set for each subtask Put multiple schedulable conditions and weight parameter corresponding with schedulable condition;
S3, when dispatch server end detects that pending task occurs, according to the schedulable condition and with schedulable condition phase The weight parameter answered calculates according to a pre-defined algorithm and performs the corresponding optimal scheduling terminal in each subtask, then to each son The corresponding optimal scheduling terminal push subtask information of task;
S4, the optimal scheduling terminal receive the subtask information, make respective handling to the subtask, after the completion of task Handling result is submitted to dispatch server end;
The step S2 is further included:
S21, weight parameter corresponding with schedulable condition, the weight parameter are set for the different schedulable conditions of each subtask For choosing the schedulable condition for needing to meet successively according to the height of weight parameter value when deployed;
The step S3 specifically includes step:
S31, pre-set and store the adaptation index that dispatch terminal corresponds to each subtask difference schedulable condition;
S32, when dispatch server end detects that pending task occurs, select weight parameter highest institute in each subtask Corresponding schedulable condition, and highest dispatch terminal in pre-stored adaptation index is searched according to the schedulable condition of selection;
If the free time S33, is according to highest dispatch terminal in the pre-stored adaptation index of the schedulable condition of selection lookup State then sets the idle dispatch terminal as the corresponding optimal scheduling terminal in the subtask;
If non-empty S34, is according to highest dispatch terminal in the pre-stored adaptation index of the schedulable condition of selection lookup Not busy state then further searches for the high idle dispatch terminal of adaptation index time;If there is no idle tune under current scheduling condition Terminal is spent, then further selects the schedulable condition corresponding to weight parameter time height, repeats step S33;
If S35, searched according to the schedulable condition of selection the pre-stored highest dispatch terminal of adaptation index have it is multiple, into Adaptation index of more the multiple dispatch terminal of one step under the high schedulable condition of weight time, repeats S33 and S34;
The step S3 is further included:The optimal scheduling terminal of each subtask is weaved into group by dispatch server.
2. the colony dispatching data processing method of task based access control according to claim 1, which is characterized in that the step S3 It further includes:The dispatch server end pushes subtask information to the corresponding optimal scheduling terminal in each subtask, including short message Or audio call form.
3. the colony dispatching data processing method of task based access control according to claim 1, which is characterized in that the step S4 Specifically include step:
S41, the corresponding optimal scheduling terminal in subtask receive the subtask information, and make corresponding position to the subtask After having handled task, subtask performance and optimal scheduling terminal implementation status are sent to the dispatch server end for reason Confirm the processing to subtask;
S42, the dispatch server end according to the subtask performance to the schedulable condition of corresponding subtask and with scheduling The corresponding weight parameter of condition is modified and is preserved;
S43, the dispatch server end correspond to corresponding dispatch terminal according to the dispatch terminal implementation status subtask difference The adaptation index of schedulable condition is modified and is preserved.
4. a kind of colony dispatching data handling system of task based access control, which is characterized in that including:
Task preprocessing module, for being set at dispatch server end and prestoring pending task;
Subtask decomposing module, for the pending task to be preset regular partition for multiple subtasks according to one, And multiple schedulable conditions and weight parameter corresponding with schedulable condition are set for each subtask;
Dispatch terminal determining module, for when dispatch server end detects that pending task occurs, according to the scheduling Condition and weight parameter corresponding with schedulable condition calculate according to a pre-defined algorithm and perform the corresponding optimal tune in each subtask Terminal is spent, then subtask information is pushed to the corresponding optimal scheduling terminal in each subtask;
Task processing module receives the subtask information for the optimal scheduling terminal, the subtask is made accordingly Processing, task complete backward dispatch server end and submit handling result;
The subtask decomposing module further includes:
Schedulable condition priority level initializing unit, it is corresponding to schedulable condition for being set for the different schedulable conditions of each subtask Weight parameter, the weight parameter needs the scheduling that meets for being chosen successively according to the height of weight parameter value when deployed Condition;
The dispatch terminal determining module specifically includes:
Dispatch terminal pretreatment unit corresponds to the suitable of each subtask difference schedulable condition for pre-setting and storing dispatch terminal With index;
Detection unit, for when dispatch server end detects that pending task occurs, selecting weight in each subtask Schedulable condition corresponding to parameter highest, and according to highest in the pre-stored adaptation index of the schedulable condition of selection lookup Dispatch terminal;
First identifying unit, if for searching highest scheduling in pre-stored adaptation index according to the schedulable condition of selection Terminal is in idle condition, then sets the idle dispatch terminal as the corresponding optimal scheduling terminal in the subtask;
Second identifying unit, if for searching highest scheduling in pre-stored adaptation index according to the schedulable condition of selection Terminal is in busy state, then further searches for the high idle dispatch terminal of adaptation index time;If under current scheduling condition Without idle dispatch terminal, then the schedulable condition corresponding to weight parameter time height is further selected;
3rd identifying unit, if for searching the highest scheduling of pre-stored adaptation index eventually according to the schedulable condition of selection There is multiple, then further adaptation index of more the multiple dispatch terminal under time high schedulable condition of weight at end;
The optimal scheduling terminal of each subtask is weaved into group by dispatch server.
5. the colony dispatching data handling system of task based access control according to claim 4, which is characterized in that the task processing Module specifically includes:
Task handles confirmation unit, and the subtask information is received for the corresponding optimal scheduling terminal in subtask, and to described Respective handling is made in subtask, and after having handled task, subtask performance and optimal is sent to the dispatch server end Dispatch terminal implementation status confirms the processing to subtask;
First modification unit, for the dispatch server end according to scheduling of the subtask performance to corresponding subtask Condition and weight parameter corresponding with schedulable condition are modified and are preserved;
Second modification unit, for the dispatch server end according to the dispatch terminal implementation status to corresponding dispatch terminal pair The adaptation index of subtask difference schedulable condition is answered to modify and preserve.
6. the colony dispatching data handling system of task based access control according to claim 4, which is characterized in that the dispatch terminal Determining module further includes:The dispatch server end pushes subtask information to the corresponding optimal scheduling terminal in each subtask, Including short message or audio call form.
CN201510024925.4A 2015-01-19 2015-01-19 The colony dispatching data processing method and system of a kind of task based access control Active CN104601704B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510024925.4A CN104601704B (en) 2015-01-19 2015-01-19 The colony dispatching data processing method and system of a kind of task based access control

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510024925.4A CN104601704B (en) 2015-01-19 2015-01-19 The colony dispatching data processing method and system of a kind of task based access control

Publications (2)

Publication Number Publication Date
CN104601704A CN104601704A (en) 2015-05-06
CN104601704B true CN104601704B (en) 2018-05-18

Family

ID=53127197

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510024925.4A Active CN104601704B (en) 2015-01-19 2015-01-19 The colony dispatching data processing method and system of a kind of task based access control

Country Status (1)

Country Link
CN (1) CN104601704B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107025131B (en) * 2016-02-01 2020-12-29 腾讯科技(深圳)有限公司 Task scheduling method and device
CN109344079A (en) * 2018-10-31 2019-02-15 广东高云半导体科技股份有限公司 Placement-and-routing's regression testing method, system, equipment and storage medium
CN111104223B (en) * 2019-12-17 2023-06-09 腾讯科技(深圳)有限公司 Task processing method, device, computer readable storage medium and computer equipment

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101510280A (en) * 2009-02-25 2009-08-19 中国网络通信集团公司 Platform for optimizing and scheduling task
CN102339233A (en) * 2010-07-15 2012-02-01 戴元顺 Cloud computing centralized management platform
CN103336709A (en) * 2013-06-01 2013-10-02 北京华胜天成科技股份有限公司 Method and system for realizing virtual distributed unified management in cluster
CN103902379A (en) * 2012-12-25 2014-07-02 中国移动通信集团公司 Task scheduling method and device and server cluster

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050070320A1 (en) * 2003-09-26 2005-03-31 Dent Paul W. Method and apparatus to reduce dispatch delays in dispatch communication networks

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101510280A (en) * 2009-02-25 2009-08-19 中国网络通信集团公司 Platform for optimizing and scheduling task
CN102339233A (en) * 2010-07-15 2012-02-01 戴元顺 Cloud computing centralized management platform
CN103902379A (en) * 2012-12-25 2014-07-02 中国移动通信集团公司 Task scheduling method and device and server cluster
CN103336709A (en) * 2013-06-01 2013-10-02 北京华胜天成科技股份有限公司 Method and system for realizing virtual distributed unified management in cluster

Also Published As

Publication number Publication date
CN104601704A (en) 2015-05-06

Similar Documents

Publication Publication Date Title
CN108345501A (en) A kind of distributed resource scheduling method and system
US10313527B2 (en) System for scheduling routing rules in a contact center based on forecasted and actual interaction load and staffing requirements
US6639982B1 (en) Method and apparatus for agent forcing and call distribution for large team call servicing
US8675860B2 (en) Training optimizer for contact center agents
CN104601704B (en) The colony dispatching data processing method and system of a kind of task based access control
CN107767080A (en) A kind of bank outlets' Service Source dispatching method and device
CN104754153B (en) Customer service system and its customer service method
CA2882699A1 (en) Hierarchical based sequencing machine learning model
CN112000388B (en) Concurrent task scheduling method and device based on multi-edge cluster cooperation
US20120197678A1 (en) Methods and Apparatus for Managing Interaction Processing
CN109934986A (en) Queuing strategy, device, equipment and readable storage medium storing program for executing based on terminal
CN103064743B (en) A kind of resource regulating method and its resource scheduling system for multirobot
US7184541B2 (en) Method and apparatus for selecting an agent to handle a call
US20130243179A1 (en) Contact center agent filtering and relevancy ranking
CN107786759A (en) Call queuing method and device based on Session Initiation Protocol
CN109858782A (en) Dispatching method, device and the electronic equipment of service role
CN110991846A (en) Service personnel task allocation method, device, equipment and storage medium
Lam et al. A simulation approach to restructuring call centers
CN111950831A (en) Order assignment method and device, readable storage medium and electronic equipment
CN108694544A (en) A kind of order dispatch processing method and processing device
WO2020062047A1 (en) Scheduling rule updating method, device, system, storage medium and terminal
CN109739958A (en) A kind of specification handbook answering method and system
CN116902712A (en) Elevator dispatching method, elevator dispatching device and electronic equipment
CN110232488B (en) Work order processing method, system and equipment
CN113379229A (en) Resource scheduling method and device

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
CB02 Change of applicant information

Address after: 518054 Guangdong city of Shenzhen province Nanshan District Nanyou Avenue West Coast Building 18 layer 1801

Applicant after: Shenzhen Putian yitonge technology Limited by Share Ltd

Address before: 518054 Guangdong city of Shenzhen province Nanshan District Nanyou Avenue West Coast Building 18 layer 1801

Applicant before: SHENZHEN PTYT TECHNOLOGY CO., LTD.

COR Change of bibliographic data
GR01 Patent grant
GR01 Patent grant