CN109829598A - A kind of candidate's preemptive type method for allocating tasks and system - Google Patents
A kind of candidate's preemptive type method for allocating tasks and system Download PDFInfo
- Publication number
- CN109829598A CN109829598A CN201811385893.0A CN201811385893A CN109829598A CN 109829598 A CN109829598 A CN 109829598A CN 201811385893 A CN201811385893 A CN 201811385893A CN 109829598 A CN109829598 A CN 109829598A
- Authority
- CN
- China
- Prior art keywords
- candidate
- task
- distribution
- tasks
- computer
- 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
Abstract
This application discloses a kind of candidate's preemptive type method for allocating tasks and systems, which comprises S2: selection candidate and the task method of salary distribution；S4: release tasks；S6: the task is made a response；S8: the task is distributed according to the method for salary distribution and the response.This method is analyzed according to user demand, provides interface and task allocator is allowed to select candidate and Task Assigned Policy, then candidate makes feedback to candidate tasks, under the premise of only spending more time taking, scientific and reasonable assigns tasks to candidate, improves working efficiency.Generally speaking candidate's preemptive type Mechanism of Task Allocation increases the science of task distribution, reasonability, Democracy, increases the enthusiasm that employee corresponds to work, and initiative reduces mistake distribution task bring manpower loss and time loss.
Description
Technical field
This application involves a kind of distribution methods, more particularly to a kind of candidate's preemptive type method for allocating tasks.
Background technique
Task distribution be applied to various operative scenarios in, it is any there is multinomial need of work to distribute to multiple people in the case where,
Require the distribution of carry out task.In order to improve the utilization rate of human resources, most suitable people is distributed into most suitable work,
In reality, task allocator mainly uses following methods:
According to previous experience mode, which needs task allocator to know quite well the passing experience of candidate, interest institute
The information such as current free time, to task, allocator is more demanding；
Exchange way respectively, which is recognized that the subjective desire of candidate, but can expend more time；
Candidate's brainstorming mode, which is since more people participate in and there are competitive relations, to candidate quality itself
It there are certain requirements, be otherwise easy to cause contradiction；
In order to solve these problems, the application will introduce a kind of candidate's preemptive type Mechanism of Task Allocation, be described below several
A important concept:
Candidate: the people of task dividable dispensing, allocator think the competent people that has the ability, usually have multiple.
Task allocator: the policymaker for determining each task by which people to complete.
Candidate tasks: hanging over the same task of multiple candidates under one's name, multiple candidates it can be seen that.
Summary of the invention
The application's aims to overcome that the above problem or at least is partially solved or alleviates the above problem.
According to the one aspect of the application, a kind of candidate's preemptive type method for allocating tasks is provided, is included the following steps:
S2: selection candidate and the task method of salary distribution；S4: release tasks；S6: the task is made a response；S8: according to the distribution
Mode and the response distribute the task.
Optionally, the step S6 include: when the method for salary distribution be the first allocation strategy, and the assignment response be rob
When accounting for task, the task is changed to the Pending tasks of the candidate, and distribution terminates；When the method for salary distribution is the second distribution
Strategy, and the assignment response is when seizing task, the possibility executor of the task adds 1 and records what the candidate filled in
Seize reason.
Optionally, further includes: S10: if the candidate abandons candidate tasks, record the candidate abandons reason.
Optionally, when the method for salary distribution is the second allocation strategy, and the assignment response is when seizing task, all
Candidate handles candidate tasks or after time-out abandons automatically, by finally distribute times according to seizing the reasons why candidate fills in
Business.
According to further aspect of the application, a kind of candidate's preemptive type task distribution system is additionally provided, using as above
State distribution method described in any one.
According to further aspect of the application, a kind of computer equipment, including memory, processor and storage are additionally provided
In the memory and the computer program that can be run by the processor, when the processor executes the computer program
Realize method as described in any one of the above embodiments.
According to further aspect of the application, a kind of computer readable storage medium is additionally provided, it is preferably non-volatile
Readable storage medium storing program for executing, is stored with computer program, and the computer program realizes such as above-mentioned when executed by the processor
Method described in one.
According to further aspect of the application, a kind of computer program product, including computer-readable code are additionally provided,
When the computer-readable code is executed by computer equipment, the computer equipment is caused to execute described in any of the above embodiments
Method.
This method is analyzed according to user demand, provides interface and task allocator is allowed to select candidate and task point
With strategy, then candidate makes feedback to candidate tasks, and under the premise of only spending more time taking, scientific and reasonable distribution is appointed
It is engaged in improving working efficiency to candidate.
Generally speaking candidate's preemptive type Mechanism of Task Allocation increases the science of task distribution, reasonability, Democracy,
The enthusiasm that employee corresponds to work is increased, initiative reduces mistake distribution task bring manpower loss and time loss.
Detailed description of the invention
Some specific embodiments of the application are described in detail by way of example and not limitation with reference to the accompanying drawings hereinafter.
Identical appended drawing reference denotes same or similar part or part in attached drawing.It should be appreciated by those skilled in the art that these
What attached drawing was not necessarily drawn to scale.In attached drawing:
Fig. 1 is the flow diagram of candidate's preemptive type method for allocating tasks in one embodiment of the application；
Fig. 2 is the effect diagram of candidate's preemptive type method for allocating tasks in one embodiment of the application；
Fig. 3 is the effect diagram of candidate's preemptive type method for allocating tasks in one embodiment of the application；
Fig. 4 is the schematic diagram of computer equipment in one embodiment of the application；
Fig. 5 is the schematic diagram of computer readable storage medium in one embodiment of the application.
Specific embodiment
Please refer to Fig. 1, in one embodiment of the application, candidate's preemptive type method for allocating tasks includes the following steps: S2:
Select candidate and the task method of salary distribution；S4: release tasks；S6: the task is made a response；S8: according to the distribution side
Formula and the response distribute the task.
In one embodiment of the application, the step S6 include: when the method for salary distribution is the first allocation strategy, and it is described
Assignment response is when seizing task, and the task is changed to the Pending tasks of the candidate, and distribution terminates；When the distribution side
Formula is the second allocation strategy, and the assignment response is when seizing task, and the possibility executor of the task adds described in 1 and record
What candidate filled in seizes reason.
In one embodiment of the application, further includes: S10: if the candidate abandons candidate tasks, recording the candidate
Abandon reason.
In one embodiment of the application, when the method for salary distribution be the second allocation strategy, and the assignment response be seize
When task, after all candidates handle candidate tasks or time-out is abandoned automatically, seize what candidate filled in by basis
Reason finally distributes task.
Present invention also provides a kind of candidate's preemptive type task distribution systems, use distribution described in above-mentioned any one
Method.
In order to achieve the above objectives, present applicant proposes a kind of scheme of candidate's preemptive type task distribution, main realities
It is existing that steps are as follows:
Task allocator selects candidate and the task method of salary distribution.
Task candidate's release tasks.
Candidate sees candidate tasks, and reacts to candidate tasks.
If candidate seizes task, the Task Assigned Policy being arranged in 1 is that ' seizing direct distribution ' task is changed to
The Pending tasks of the candidate, distribution terminate；If candidate seizes task, the Task Assigned Policy being arranged in 1 is ' to collect final
Distribution ' then the possibility executor of the task adds 1 and record that the candidate fills in seizes reason.
If candidate tasks are abandoned in candidate's selection, record the candidate abandons reason.
Task Assigned Policy is the candidate tasks of ' collecting final distribution ', is handled in all candidates candidate tasks
After (or time-out is abandoned automatically), task is finally distributed according to the reasons why candidate fills in is seized by task allocator.Specific stream
Journey is as shown in Figure 1.
Firstly, the mechanism is supplied to task assigner one succinctly, easy to use interface is for selecting candidate or candidate
User group, and setting Task Assigned Policy；
Then, we create candidate tasks according to the candidate or candidate's user group of task assigner setting, candidate
All candidates of task seize task as it can be seen that candidate can click ' seizing ' button；' abandoning button ' can also be clicked, is put
Abandoning task requires to fill in reason no matter seizing and being also to give up；
Finally, after a candidate seizes task if being ' seizing direct distribution ' if the allocation strategy of task assigner setting
Task distributes to the candidate, and distribution terminates；If the allocation strategy of task assigner setting is ' collecting final distribution ', wait
After owner handles candidate tasks or after time-out abandons automatically, the reasons why task assigner fills according to candidate into
Row distribution task then therefrom selects the most abundant person of reason if there is task is seized in more personal choices；If nobody's selection is seized
Whether task then judges the difficult point of the task according to feedback reason or is since personnel lack；
The application of candidate's preemptive type Mechanism of Task Allocation
Referring to figure 2., application scenarios 1: task allocator wants a task distributing to first time for seizing task
It chooses；It is only needed at this time ' task distribution ' link chooses candidate or candidate to be grouped, and it is ' to rob that allocation strategy, which is then arranged,
Account for direct distribution ', task is immediately assigned to the candidate after some candidate seizes task, other candidates will receive
The message that task has been got.
Referring to figure 3., application scenarios 2: user needs extended model designer, increases cashier's node and condition node；This
When only need to choose alive packet, right button selection increases, then in pop-up box input cashier node title, code, icon
With the position of svg, and the attribute etc. that cashier's node includes, clicks and determines, effect is as schemed:
Application scenarios 2: task allocator wants to obtain all candidates to the feedback of the task, then makes a policy；This
When only need ' task distribution ' link chooses candidate or candidate to be grouped, and it is ' to collect final that allocation strategy, which is then arranged,
Distribution ', it needs to fill in the advantage for completing the task when some candidate seizes task, needs to fill in when abandoning the task
Reason, after all candidates have handled (or time-out is abandoned automatically), which returns to task allocator there, is distributed by task
Person finally determines；Effect is as schemed:
By being analyzed above it can be concluded that can simply and easily be given task using technical assignment allocator
Most suitable candidate rationally utilizes human resources, and takes into account candidate personal inclination, improves the completion efficiency of work.
Present invention also provides a kind of computer equipment (referring to figure 4.), including memory, processor and it is stored in described
In memory and the computer program that can be run by the processor, which is characterized in that the processor execution computer
Method described in any of the above embodiments is realized when program.
Present invention also provides a kind of computer readable storage medium (referring to figure 5.), and preferably non-volatile readable is deposited
Storage media is stored with computer program, which is characterized in that the computer program is realized above-mentioned when executed by the processor
Method described in any one.
Present invention also provides a kind of computer program products, including computer-readable code, when described computer-readable
When code is executed by computer equipment, the computer equipment is caused to execute method described in any of the above embodiments.
This method is analyzed according to user demand, provides interface and task allocator is allowed to select candidate and task point
With strategy, then candidate makes feedback to candidate tasks, and under the premise of only spending more time taking, scientific and reasonable distribution is appointed
It is engaged in improving working efficiency to candidate.
Generally speaking candidate's preemptive type Mechanism of Task Allocation increases the science of task distribution, reasonability, Democracy,
The enthusiasm that employee corresponds to work is increased, initiative reduces mistake distribution task bring manpower loss and time loss.
Although the step of method in the application is the execution numbered according to numerical order, but be not meant to each step
Sequence has to carry out according to the sequence of number.It can be the relationship executed side by side between some steps, it might even be possible to overturn suitable
Sequence executes, in the range of belonging to protection required by the application.
In the above-described embodiments, can come wholly or partly by software, hardware, firmware or any combination thereof real
It is existing.When implemented in software, it can entirely or partly realize in the form of a computer program product.The computer program
Product includes one or more computer instructions.When computer loads and executes the computer program instructions, whole or portion
Ground is divided to generate according to process or function described in the embodiment of the present application.The computer can be general purpose computer, dedicated computing
Machine, computer network obtain other programmable devices.The computer instruction can store in computer readable storage medium
In, or from a computer readable storage medium to the transmission of another computer readable storage medium, for example, the computer
Instruction can pass through wired (such as coaxial cable, optical fiber, number from a web-site, computer, server or data center
User's line (DSL)) or wireless (such as infrared, wireless, microwave etc.) mode to another web-site, computer, server or
Data center is transmitted.The computer readable storage medium can be any usable medium that computer can access or
It is comprising data storage devices such as one or more usable mediums integrated server, data centers.The usable medium can be with
It is magnetic medium, (for example, floppy disk, hard disk, tape), optical medium (for example, DVD) or semiconductor medium (such as solid state hard disk
Solid State Disk (SSD)) etc..
Professional should further appreciate that, in conjunction with each example of embodiment description disclosed herein
Unit and algorithm steps, can be realized with electronic hardware, computer software, or a combination of the two, in order to clearly demonstrate
The interchangeability of hardware and software generally describes each exemplary composition and step according to function in the above description
Suddenly.These functions are implemented in hardware or software actually, the specific application and design constraint item depending on technical solution
Part.Professional technician can use different methods to achieve the described function each specific application, but this
It realizes it is not considered that exceeding scope of the present application.
Those of ordinary skill in the art will appreciate that implement the method for the above embodiments be can be with
By program come instruction processing unit completion, the program be can store in computer readable storage medium, and the storage is situated between
Matter is non-transitory (English: non-transitory) medium, such as random access memory, read-only memory, flash
Device, hard disk, solid state hard disk, tape (English: magnetic tape), floppy disk (English: floppy disk), CD (English:
Optical disc) and any combination thereof.
The preferable specific embodiment of the above, only the application, but the protection scope of the application is not limited thereto,
Within the technical scope of the present application, any changes or substitutions that can be easily thought of by anyone skilled in the art,
Should all it cover within the scope of protection of this application.Therefore, the protection scope of the application should be with scope of protection of the claims
Subject to.
Claims (8)
1. a kind of candidate's preemptive type method for allocating tasks, which comprises the steps of:
S2: selection candidate and the task method of salary distribution；
S4: release tasks；
S6: the task is made a response；
S8: the task is distributed according to the method for salary distribution and the response.
2. candidate's preemptive type method for allocating tasks according to claim 1, which is characterized in that
The step S6 includes: when the method for salary distribution is the first allocation strategy, and the assignment response is institute when seizing task
The task of stating is changed to the Pending tasks of the candidate, and distribution terminates；It is and described when the method for salary distribution is the second allocation strategy
Assignment response is when seizing task, and the possibility executor of the task adds 1 and record that the candidate fills in seizes reason.
3. candidate's preemptive type method for allocating tasks according to claim 2, which is characterized in that further include:
S10: if the candidate abandons candidate tasks, record the candidate abandons reason.
4. candidate's preemptive type method for allocating tasks according to claim 3, which is characterized in that when the method for salary distribution is
Second allocation strategy, and the assignment response is when seizing task handle candidate tasks or overtime in all candidates
Automatically after abandoning, the reasons why candidate fills in is seized by basis and finally distributes task.
5. a kind of candidate's preemptive type task distribution system, which is characterized in that using as described in claim 1-4 any one
Distribution method.
6. a kind of computer equipment, including memory, processor and storage can be transported in the memory and by the processor
Capable computer program, which is characterized in that the processor is realized when executing the computer program as appointed in claim 1-4
Method described in one.
7. a kind of computer readable storage medium, preferably non-volatile readable storage medium, are stored with computer program,
It is characterized in that, the computer program realizes such as method of any of claims 1-4 when executed by the processor.
8. a kind of computer program product, including computer-readable code, which is characterized in that when the computer-readable code by
When computer equipment executes, the computer equipment perform claim is caused to require method described in any one of 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811385893.0A CN109829598A (en) | 2018-11-20 | 2018-11-20 | A kind of candidate's preemptive type method for allocating tasks and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811385893.0A CN109829598A (en) | 2018-11-20 | 2018-11-20 | A kind of candidate's preemptive type method for allocating tasks and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109829598A true CN109829598A (en) | 2019-05-31 |
Family
ID=66859808
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811385893.0A Pending CN109829598A (en) | 2018-11-20 | 2018-11-20 | A kind of candidate's preemptive type method for allocating tasks and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109829598A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111080061A (en) * | 2019-11-11 | 2020-04-28 | 无锡文思海辉信息技术有限公司 | Task allocation method and device, computer equipment and storage medium |
| CN111754203A (en) * | 2020-06-30 | 2020-10-09 | 武汉虹信技术服务有限责任公司 | Workflow-based task candidate processing method and system and storage medium |
| CN114971594A (en) * | 2022-07-28 | 2022-08-30 | 北京有生深境技术有限公司 | Workflow engine based on preemptive office mode |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6571215B1 (en) * | 1997-01-21 | 2003-05-27 | Microsoft Corporation | System and method for generating a schedule based on resource assignments |
| CN101082970A (en) * | 2007-07-05 | 2007-12-05 | 山东浪潮齐鲁软件产业股份有限公司 | Method for realizing government affairs examination and approval workflow engines system |
| CN101645148A (en) * | 2009-06-19 | 2010-02-10 | 中国科学院声学研究所 | Construction order management method applied to operation support system and management system thereof |
| CN107784424A (en) * | 2017-06-26 | 2018-03-09 | 平安科技（深圳）有限公司 | Task management method, device, computer equipment and storage medium |
| CN107958349A (en) * | 2017-12-19 | 2018-04-24 | 金蝶软件（中国）有限公司 | Method for allocating tasks, device, computer equipment and storage medium |
-
2018
- 2018-11-20 CN CN201811385893.0A patent/CN109829598A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6571215B1 (en) * | 1997-01-21 | 2003-05-27 | Microsoft Corporation | System and method for generating a schedule based on resource assignments |
| CN101082970A (en) * | 2007-07-05 | 2007-12-05 | 山东浪潮齐鲁软件产业股份有限公司 | Method for realizing government affairs examination and approval workflow engines system |
| CN101645148A (en) * | 2009-06-19 | 2010-02-10 | 中国科学院声学研究所 | Construction order management method applied to operation support system and management system thereof |
| CN107784424A (en) * | 2017-06-26 | 2018-03-09 | 平安科技（深圳）有限公司 | Task management method, device, computer equipment and storage medium |
| CN107958349A (en) * | 2017-12-19 | 2018-04-24 | 金蝶软件（中国）有限公司 | Method for allocating tasks, device, computer equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 刘诗薇: "电信行业客户投诉集中受理系统的设计与实现", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111080061A (en) * | 2019-11-11 | 2020-04-28 | 无锡文思海辉信息技术有限公司 | Task allocation method and device, computer equipment and storage medium |
| CN111080061B (en) * | 2019-11-11 | 2024-02-06 | 文思海辉智科科技有限公司 | Task allocation method, device, computer equipment and storage medium |
| CN111754203A (en) * | 2020-06-30 | 2020-10-09 | 武汉虹信技术服务有限责任公司 | Workflow-based task candidate processing method and system and storage medium |
| CN111754203B (en) * | 2020-06-30 | 2023-02-28 | 武汉虹信技术服务有限责任公司 | Workflow-based task candidate processing method and system and storage medium |
| CN114971594A (en) * | 2022-07-28 | 2022-08-30 | 北京有生深境技术有限公司 | Workflow engine based on preemptive office mode |
| CN114971594B (en) * | 2022-07-28 | 2022-10-25 | 北京有生深境技术有限公司 | Workflow engine based on preemptive office mode |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101719931B (en) | Multi-intelligent body-based hierarchical cloud computing model construction method | |
| CN103092698B (en) | Cloud computing application automatic deployment system and method | |
| CN104040526B (en) | Assignment to the resource in virtual machine pool | |
| US5301320A (en) | Workflow management and control system | |
| CN109471727A (en) | A kind of task processing method, apparatus and system | |
| US20200027014A1 (en) | Method for forecasting distributed resource utilization in a virtualization environment | |
| CN108520316A (en) | A kind of data-optimized processing method of overload alarm | |
| CN108415847A (en) | Performance test methods, device, computer equipment and storage medium | |
| CN109829598A (en) | A kind of candidate's preemptive type method for allocating tasks and system | |
| CN106844018A (en) | A kind of task processing method, apparatus and system | |
| US8175906B2 (en) | Integrating performance, sizing, and provisioning techniques with a business process | |
| US9513874B2 (en) | Enterprise computing platform with support for editing documents via logical views | |
| CN104081734A (en) | Using transactions to minimize churn in a distributed network control system | |
| CN104243617B (en) | Towards the method for scheduling task and system of mixed load in a kind of isomeric group | |
| CN108337275A (en) | Task distribution method, device and equipment for Distributor | |
| CN108171473A (en) | A kind of Data Analysis Services system and data analysis processing method | |
| CN106569891A (en) | Method and device for carrying out task scheduling in storage system | |
| CN103257899B (en) | Computer system | |
| CN108108225A (en) | A kind of method for scheduling task towards cloud computing platform | |
| CN110336859A (en) | Task scheduling system under multi-tenant environment | |
| CN110377415A (en) | A kind of request processing method and server | |
| CN110333941A (en) | A kind of real-time computing platform of big data based on sql and method | |
| CN105824705B (en) | A kind of method for allocating tasks and electronic equipment | |
| CN108268546A (en) | A kind of method and device for optimizing database | |
| CN108897626A (en) | A kind of resource regulating method and server |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190531 |
|
| RJ01 | Rejection of invention patent application after publication |