CN111008247A - Task allocation method, device and medium based on block chain - Google Patents
Task allocation method, device and medium based on block chain Download PDFInfo
- Publication number
- CN111008247A CN111008247A CN201911171734.5A CN201911171734A CN111008247A CN 111008247 A CN111008247 A CN 111008247A CN 201911171734 A CN201911171734 A CN 201911171734A CN 111008247 A CN111008247 A CN 111008247A
- Authority
- CN
- China
- Prior art keywords
- task
- receiving
- information
- node
- issuing
- 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 61
- 238000012163 sequencing technique Methods 0.000 claims description 5
- 238000009826 distribution Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 9
- 238000003860 storage Methods 0.000 description 9
- 230000008569 process Effects 0.000 description 8
- 238000004590 computer program Methods 0.000 description 7
- 230000009286 beneficial effect Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000008451 emotion Effects 0.000 description 2
- 230000005284 excitation Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008520 organization Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000004936 stimulating effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
- G06F16/285—Clustering or classification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Computing Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a task allocation method based on a block chain, which comprises the following steps: taking a task issuing personnel terminal as a task issuing node and taking a task receiving personnel terminal as a task receiving node to deploy a block chain; receiving task information created and released by a task releasing node; receiving task request information sent by at least one task receiving node; sending task information to a task receiving node; receiving task execution information fed back by a task receiving node; judging whether the task execution information is matched with the reward point condition; and if so, issuing point rewards to the task receiving personnel terminals corresponding to the task receiving nodes according to the task execution information. The block chain-based task allocation method, equipment and medium provided by the invention can fairly allocate tasks, fully mobilize the enthusiasm of employees, stimulate the maximum potential of the employees and create greater value for enterprises.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to a task allocation method, equipment and medium based on a block chain.
Background
With the continuous development of economy, the competition among enterprises is also the competition of talents, the initiative and the creativity of the enterprises are fully exerted, the enterprises make greater contribution to the development of the enterprises, and the method is one of important ways for improving the development level of the enterprises, so that the establishment of a set of perfect task allocation mechanism is particularly important for stimulating the enthusiasm of the employees.
However, in the existing enterprises, tasks are often distributed in the near field or according to human relations, and the distribution process is often mixed with personal emotions, so that the task distribution is uneven, and the working enthusiasm of employees is influenced.
The above description is included in the technical recognition scope of the inventors, and does not necessarily constitute the prior art.
Disclosure of Invention
In order to solve the above problems, the present invention provides a method, an apparatus, and a medium for task allocation based on a block chain, which are used to solve the following problems in the prior art: when an enterprise, an organization or an organization distributes tasks to employees, the task distributor is lack of a uniform standard when distributing the tasks, so that the tasks are distributed unevenly, and the working enthusiasm of task performers is influenced.
In order to solve the above problem, the present invention provides a task allocation method based on a block chain, which comprises:
taking a task issuing personnel terminal as a task issuing node and taking a task receiving personnel terminal as a task receiving node to deploy a block chain;
receiving task information created and released by a task releasing node;
receiving task request information sent by at least one task receiving node;
sending task information to a task receiving node;
receiving task execution information fed back by a task receiving node;
judging whether the task execution information is matched with the reward point condition;
and if so, issuing point rewards to the task receiving personnel terminals corresponding to the task receiving nodes according to the task execution information.
As an optimal technical scheme of the task allocation method based on the block chain, when the task information is created and issued by the task issuing node, the task information comprises difficulty identification information of the task.
As a preferred technical solution of a block chain-based task allocation method, when the step of receiving task information created and issued by a task issuing node is executed, the method further includes:
receiving task information and extracting difficulty identification information in the task information;
classifying the tasks according to the difficulty identification information;
and sequencing and displaying the tasks according to different forward sequences or reverse narratives of the task difficulty.
As a preferred technical solution of a task allocation method based on a block chain, when task execution information fed back by a task receiving node is executed, the method further includes:
receiving task execution information and extracting difficulty identification information in the task execution information;
and acquiring point reward information corresponding to the task according to the difficulty identification information, wherein the task difficulty level is in direct proportion to the point reward information.
As a preferred technical solution of a task allocation method based on a block chain, when the step of receiving task request information sent by at least one task receiving node is executed, the method further includes:
acquiring integral information acquired by task receiving personnel corresponding to at least two task receiving nodes;
comparing the integral information acquired by at least two task receiving personnel;
and sending the task information to the task receiving node with the highest integral value.
As a preferred technical solution of a block chain-based task allocation method, when the step of comparing the point information acquired by at least two task recipients is executed, if the information acquired by at least two task recipients is the same, the method further includes:
judging whether the request time of one task receiving node is earlier than the request time of other task receiving nodes;
and if so, distributing the task information to the task receiving node with the earliest request time.
As a preferred technical scheme of the task allocation method based on the block chain, when the task information is created and issued by the task issuing node, the task information comprises classification identification information of the task.
As a preferred technical solution of a block chain-based task allocation method, when the step of receiving a task issuing node to create and issue task information is executed, the method further includes:
receiving task information and extracting classification identification information in the task information;
classifying the tasks according to the classification identification information;
and sequencing and displaying the tasks according to different task types.
The invention also provides a task allocation device based on the block chain, which comprises:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to cause the at least one processor to:
taking a task issuing personnel terminal as a task issuing node and taking a task receiving personnel terminal as a task receiving node to deploy a block chain;
receiving task information created and released by a task releasing node;
receiving task request information sent by at least one task receiving node;
sending task information to a task receiving node;
receiving task execution information fed back by a task receiving node;
judging whether the task execution information is matched with the reward point condition;
and if so, issuing point rewards to the task receiving personnel terminals corresponding to the task receiving nodes according to the task execution information.
The invention also provides a task allocation medium based on the block chain, which stores computer executable instructions, wherein the computer executable instructions are as follows:
taking a task issuing personnel terminal as a task issuing node and taking a task receiving personnel terminal as a task receiving node to deploy a block chain;
receiving task information created and released by a task releasing node;
receiving task request information sent by at least one task receiving node;
sending task information to a task receiving node;
receiving task execution information fed back by a task receiving node;
judging whether the task execution information is matched with the reward point condition;
and if so, issuing point rewards to the task receiving personnel terminals corresponding to the task receiving nodes according to the task execution information.
The embodiment of the specification adopts at least one technical scheme which can achieve the following beneficial effects:
according to the task allocation method, device and medium based on the block chain, task issuers and task receivers are all organizations or nodes registered on the block chain, the task issuers are responsible for creating and issuing tasks, the task receivers can check and apply for undertaking the tasks, the task receivers can obtain corresponding points after the task receivers complete one applied task and pass acceptance, and the larger the task difficulty is, the more the corresponding points are. When a new task comes on, the higher the score the more chance the person gets to get the new task, in case all people submit the task application. Under the excitation of the integral mechanism, the enthusiasm of the staff can be fully mobilized, the maximum potential of the staff is excited, and greater value is created for enterprises. In addition, the score of the employee can also be used as a performance assessment standard of the employee.
Based on the characteristics of block chain decentralization and non-tampering, the whole task allocation process is commonly maintained, is open and transparent, does not mix any personal emotion, and ensures the fairness of task allocation. Based on the excitation mechanism of the block chain, the enthusiasm of the participants can be mobilized to the maximum extent, creativity is stimulated, and finally the vitality of the whole ecological system is improved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the invention and not to limit the invention. In the drawings:
FIG. 1 is a flow chart of task allocation according to an embodiment of the present invention.
Fig. 2 is a flowchart illustrating classification display according to difficulty identification information according to an embodiment of the present invention.
Fig. 3 is a flowchart illustrating the point reward information corresponding to the difficulty identification information according to an embodiment of the present invention.
Fig. 4 is a flowchart of acquiring task receiving requests of at least two task receiving nodes according to an embodiment of the present invention.
Fig. 5 is a flowchart illustrating classification display according to the classification flag information according to an embodiment of the present invention.
Fig. 6 is a schematic structural diagram of a task allocation device based on a block chain in an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present disclosure more apparent, the technical solutions of the present disclosure will be clearly and completely described below with reference to the specific embodiments of the present disclosure and the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, and not all of the embodiments. All other embodiments obtained by a person skilled in the art without making any inventive step based on the embodiments in the description belong to the protection scope of the present application.
The technical solutions provided by the embodiments of the present application are described in detail below with reference to the accompanying drawings.
According to the task allocation method based on the block chain, the block chain is used as recording information, including task generation information, allocation information, reward information and the like, the characteristics that the block chain is transparent and cannot be tampered are utilized, the purpose is to provide powerful and reliable evidence for enterprise task allocation, and after a task is obtained, a worker can obtain a reward to drive the worker to work.
The technical scheme of the application is to solve the problems in the traditional technology, and provides the method for realizing the distributed record with credible data, difficult tampering and the like.
As shown in fig. 1, a task allocation method based on a block chain provided by the present invention includes:
s1, taking the task issuing personnel terminal as a task issuing node and taking the task receiving personnel terminal as a task receiving node to deploy a block chain;
s2 receiving the task information created and released by the task releasing node;
s3, receiving task request information sent by at least one task receiving node;
s4 sending task information to a task receiving node;
s5 receiving task execution information fed back by the task receiving node;
s6, judging whether the task execution information matches the reward point condition;
and S7, if the judgment result is yes, distributing point reward to the task receiving personnel terminal corresponding to the task receiving node according to the task execution information.
The blockchain is used as a decentralized distributed storage technology and has the characteristics of credibility, non-tampering, safety and privacy and the like, the characteristics determine that the blockchain is particularly suitable for disclosing task allocation information and accessory information generated in the task allocation process, data recorded on the blockchain can be stored in distributed accounting nodes, data modification of a single node or a few nodes cannot be effective, the data on the blockchain cannot be tampered, information on the blockchain can be consulted by all people, and the blockchain is fair and reliable. The two-block chain technology in the embodiment is applied to the field of enterprise task allocation, when a task publisher creates a task, task information is recorded in the form of a block chain, and because the information is recorded in the form of the block chain, any task receiver can check the published task and apply for execution of the selected task under the permission. The task receiving personnel records and returns the execution result in the form of a block chain after completing the task, the returned result is only updatable and can not be tampered, the reliability of the completed task is ensured, if the received task execution information meets the condition of reward points, the task receiving personnel writing the upload data into the block chain, namely 'uplink', issues reward points, and the reward points can be used as the working assessment basis of the task receiving personnel and can also be used as the effective determination condition of the priority of the next received task.
It should be noted that although the contents of the reward are points in the present embodiment, for example, virtual money and physical reward can be used as one of the rewards.
In this embodiment, when the task issuing node creates and issues the task information, the task information includes difficulty identification information for the task. The difficulty identification information can be used for reminding task receivers of the difficulty degree of the task, and the task receivers can check the difficulty degree of the task when receiving the task, so that whether the task is received or not is judged.
As shown in fig. 2, when the step of receiving the task information created and distributed by the task distributing node is executed, the method further includes:
s211, receiving the task information and extracting difficulty identification information in the task information;
s212, classifying the tasks according to the difficulty identification information;
s213, the tasks are displayed in a sequencing mode according to different forward sequences or reverse narratives of the task difficulty.
When the task issuing node issues the task, task difficulty information needs to be added. If lack task degree of difficulty information, be unfavorable for classifying the task according to the degree of difficulty, only rely on artificial subjective factor to judge, can cause the confusion to task receiver on the one hand, on the other hand is unfavorable for the fairness of task allocation. The embodiment identifies the task difficulty at the beginning of task release, and task receiving personnel can quickly judge whether to receive the task according to the specific difficulty information of the task. In addition, when the task difficulty is identified, the tasks can be sequenced according to different task difficulties, so that a user can check related tasks more conveniently, and when the tasks are sequenced, the tasks can be sequenced in a forward sequence or in a reverse narrative manner, wherein the tasks are sequenced in a sequence from low to high according to the difficulty and in a sequence from high to low as the reverse narrative.
As shown in fig. 3, in this embodiment, when executing the task execution information fed back by the receiving node of the receiving task, the method further includes:
s221, receiving task execution information and extracting difficulty identification information in the task execution information;
s222, obtaining integral reward information corresponding to the task according to the difficulty identification information, wherein the task difficulty level is in direct proportion to the integral reward information.
When the task issuing node issues the task, task difficulty information needs to be added. The point scores corresponding to different task difficulty information can be systematized and standardized by using an intelligent contract, the score corresponding to a low-difficulty task is lower, the score corresponding to a high-difficulty task is higher, and meanwhile, the completion condition of the task is also used as the judgment standard of the point reward amount.
As shown in fig. 4, in some embodiments, when the step of receiving task request information sent by at least one task receiving node is performed, the method further includes:
s311, acquiring integral information acquired by task receiving personnel corresponding to at least two task receiving nodes;
s312, comparing the integral information acquired by at least two task receiving personnel;
s313 sends the task information to the task receiving node with the highest integral value.
The tasks released by the task releasing nodes can be checked and applied for receiving by any task receiving node. Because the same task can be completed by only one person or one group of people except the cooperative task, when the task issuing node issues the task, two task receiving nodes may apply for the task at the same time, resulting in a problem in task allocation. In addition, after a round of task submission is completed, reward points acquired by task receiving personnel corresponding to the task receiving nodes may be different, in order to encourage task receiving personnel with higher completion degree, the task receiving personnel acquiring higher task reward points have a priority selection, and when task request information sent by a plurality of task receiving nodes is received at the same time, the task receiving nodes with higher reward points are given higher weight.
Further, in some embodiments, when the step of comparing the point information acquired by the at least two task recipients is performed, if the information acquired by the at least two task recipients is the same, the method further includes:
s314, judging whether the request time of one task receiving node is earlier than the request time of other task receiving nodes;
and S315, if the judgment result is yes, distributing the task information to the task receiving node with the earliest request time.
In some special cases, when at least two task receiving nodes request tasks, the point reward values obtained by the task receiving personnel corresponding to the at least two task receiving nodes are the same, and in this case, it cannot be determined to which party the tasks are allocated according to the obtained point reward values. In order to avoid the situation, when the requests of different task receiving nodes with the same score occur, the request time is used as a judgment basis to judge whether the request time of one task receiving node in the plurality of task nodes is earlier than that of all other request nodes, and if the one task receiving node exists, the task is distributed to the task receiving node.
It should be noted that, in order to ensure the fairness of allocation, all task receiving personnel can recognize the allocation mode, and information such as the basis, the process, the result and the like of task allocation is recorded in the form of a block chain, so that all people can conveniently refer to the block chain.
In addition, besides determining the task allocation result according to the time of requesting the task, other factors can be written into the block chain data as a judgment basis to form an intelligent contract. Information such as the working age, and employee type of the task recipient can be given corresponding weights.
In some embodiments, when the task information is created and published by the task publishing node, the task information includes classification identification information of the task. The classification identification information can be used for reminding task receivers of the classification of tasks, so that the task receivers can find tasks suitable for the task receivers quickly, meanwhile, the task classification can also record the classification selection history of the task receivers, and preference weight is provided for the classification selection of the task receivers.
As shown in fig. 5, when the step of receiving the task information created and issued by the task issuing node is executed, the method further includes:
s231, receiving the task information and extracting the classification identification information in the task information;
s232, classifying the tasks according to the classification identification information;
and S233, sorting and displaying the tasks according to different task types.
When a task is released, the task releasing node needs to add task classification information. Because different users have different task type selection preferences, the task display ordering can be adjusted according to the selection preferences of the task receivers, for example, tasks received by the task receivers for many times can be displayed at the primary position according to the weight, so that the users can conveniently select the tasks.
As shown in fig. 6, the present invention further provides a task allocation device based on a block chain, including:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to cause the at least one processor to:
taking a task issuing personnel terminal as a task issuing node and taking a task receiving personnel terminal as a task receiving node to deploy a block chain;
receiving task information created and released by a task releasing node;
receiving task request information sent by at least one task receiving node;
sending task information to a task receiving node;
receiving task execution information fed back by a task receiving node;
judging whether the task execution information is matched with the reward point condition;
and if so, issuing point rewards to the task receiving personnel terminals corresponding to the task receiving nodes according to the task execution information.
The invention also provides a task allocation medium based on the block chain, which stores computer executable instructions, wherein the computer executable instructions are as follows:
taking a task issuing personnel terminal as a task issuing node and taking a task receiving personnel terminal as a task receiving node to deploy a block chain;
receiving task information created and released by a task releasing node;
receiving task request information sent by at least one task receiving node;
sending task information to a task receiving node;
receiving task execution information fed back by a task receiving node;
judging whether the task execution information is matched with the reward point condition;
and if so, issuing point rewards to the task receiving personnel terminals corresponding to the task receiving nodes according to the task execution information.
The embodiments in the present application are described in a progressive manner, and the same and similar parts among the embodiments can be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the device and media embodiments, the description is relatively simple as it is substantially similar to the method embodiments, and reference may be made to some descriptions of the method embodiments for relevant points.
The device and the medium provided by the embodiment of the application correspond to the method one to one, so the device and the medium also have the similar beneficial technical effects as the corresponding method, and the beneficial technical effects of the method are explained in detail above, so the beneficial technical effects of the device and the medium are not repeated herein.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (10)
1. A task allocation method based on a block chain is characterized by comprising the following steps:
taking a task issuing personnel terminal as a task issuing node and taking a task receiving personnel terminal as a task receiving node to deploy a block chain;
receiving task information created and released by a task releasing node;
receiving task request information sent by at least one task receiving node;
sending task information to a task receiving node;
receiving task execution information fed back by a task receiving node;
judging whether the task execution information is matched with the reward point condition;
and if so, issuing point rewards to the task receiving personnel terminals corresponding to the task receiving nodes according to the task execution information.
2. The method according to claim 1, wherein when the task distribution node creates and distributes task information, the task information includes difficulty identification information for the task.
3. The method according to claim 2, wherein when the step of receiving task information created and released by the task releasing node is executed, the method further comprises:
receiving task information and extracting difficulty identification information in the task information;
classifying the tasks according to the difficulty identification information;
and sequencing and displaying the tasks according to different forward sequences or reverse narratives of the task difficulty.
4. The method according to claim 2, wherein when the task execution information fed back by the task receiving node is received, the method further comprises:
receiving task execution information and extracting difficulty identification information in the task execution information;
and acquiring point reward information corresponding to the task according to the difficulty identification information, wherein the task difficulty level is in direct proportion to the point reward information.
5. The method according to claim 1, wherein when the step of receiving task request information sent by at least one task receiving node is performed, the method further comprises:
acquiring integral information acquired by task receiving personnel corresponding to at least two task receiving nodes;
comparing the integral information acquired by at least two task receiving personnel;
and sending the task information to the task receiving node with the highest integral value.
6. The blockchain-based task assigning method according to claim 5, wherein when the step of comparing the point information acquired by at least two task recipients is performed, if the information acquired by at least two task recipients is the same, the method further comprises:
judging whether the request time of one task receiving node is earlier than the request time of other task receiving nodes;
and if so, distributing the task information to the task receiving node with the earliest request time.
7. The method according to claim 1, wherein when the task distribution node creates and distributes the task information, the task information includes classification identification information of the task.
8. The method according to claim 7, wherein when the step of receiving task information created and published by the task publishing node is executed, the method further comprises:
receiving task information and extracting classification identification information in the task information;
classifying the tasks according to the classification identification information;
and sequencing and displaying the tasks according to different task types.
9. A blockchain-based task assigning apparatus, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to enable the at least one processor to:
taking a task issuing personnel terminal as a task issuing node and taking a task receiving personnel terminal as a task receiving node to deploy a block chain;
receiving task information created and released by a task releasing node;
receiving task request information sent by at least one task receiving node;
sending task information to a task receiving node;
receiving task execution information fed back by a task receiving node;
judging whether the task execution information is matched with the reward point condition;
and if so, issuing point rewards to the task receiving personnel terminals corresponding to the task receiving nodes according to the task execution information.
10. A blockchain-based task allocation medium having stored thereon computer-executable instructions, the computer-executable instructions comprising:
taking a task issuing personnel terminal as a task issuing node and taking a task receiving personnel terminal as a task receiving node to deploy a block chain;
receiving task information created and released by a task releasing node;
receiving task request information sent by at least one task receiving node;
sending task information to a task receiving node;
receiving task execution information fed back by a task receiving node;
judging whether the task execution information is matched with the reward point condition;
and if so, issuing point rewards to the task receiving personnel terminals corresponding to the task receiving nodes according to the task execution information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911171734.5A CN111008247A (en) | 2019-11-26 | 2019-11-26 | Task allocation method, device and medium based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911171734.5A CN111008247A (en) | 2019-11-26 | 2019-11-26 | Task allocation method, device and medium based on block chain |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111008247A true CN111008247A (en) | 2020-04-14 |
Family
ID=70113313
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911171734.5A Pending CN111008247A (en) | 2019-11-26 | 2019-11-26 | Task allocation method, device and medium based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111008247A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111445163A (en) * | 2020-04-15 | 2020-07-24 | 中国银行股份有限公司 | Task issuing method, task processing method and device |
| CN111625231A (en) * | 2020-05-27 | 2020-09-04 | 哈尔滨云天智旅大数据有限公司 | Software development method based on data security |
| CN112632931A (en) * | 2020-08-06 | 2021-04-09 | 腾讯科技（深圳）有限公司 | Task verification and cancellation method based on table, table generation method and device |
| CN113159592A (en) * | 2021-04-27 | 2021-07-23 | 北京京东乾石科技有限公司 | Task allocation method, device, equipment and storage medium |
| CN113837633A (en) * | 2021-09-29 | 2021-12-24 | 浪潮卓数大数据产业发展有限公司 | Community incentive method, device and medium based on home unit |
| CN114726851A (en) * | 2020-12-21 | 2022-07-08 | 富泰华工业（深圳）有限公司 | Block operation method, device, electronic equipment and storage medium |
| CN115239525A (en) * | 2022-09-23 | 2022-10-25 | 环球数科集团有限公司 | Intellectual property authentication protection method and system based on NFT technology |
-
2019
- 2019-11-26 CN CN201911171734.5A patent/CN111008247A/en active Pending
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111445163A (en) * | 2020-04-15 | 2020-07-24 | 中国银行股份有限公司 | Task issuing method, task processing method and device |
| CN111625231A (en) * | 2020-05-27 | 2020-09-04 | 哈尔滨云天智旅大数据有限公司 | Software development method based on data security |
| CN111625231B (en) * | 2020-05-27 | 2021-02-26 | 哈尔滨云天智旅大数据有限公司 | Software development method based on data security |
| CN112632931A (en) * | 2020-08-06 | 2021-04-09 | 腾讯科技（深圳）有限公司 | Task verification and cancellation method based on table, table generation method and device |
| CN114726851A (en) * | 2020-12-21 | 2022-07-08 | 富泰华工业（深圳）有限公司 | Block operation method, device, electronic equipment and storage medium |
| CN114726851B (en) * | 2020-12-21 | 2023-12-08 | 富泰华工业（深圳）有限公司 | Block operation method, device, electronic equipment and storage medium |
| CN113159592A (en) * | 2021-04-27 | 2021-07-23 | 北京京东乾石科技有限公司 | Task allocation method, device, equipment and storage medium |
| CN113837633A (en) * | 2021-09-29 | 2021-12-24 | 浪潮卓数大数据产业发展有限公司 | Community incentive method, device and medium based on home unit |
| CN115239525A (en) * | 2022-09-23 | 2022-10-25 | 环球数科集团有限公司 | Intellectual property authentication protection method and system based on NFT technology |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111008247A (en) | Task allocation method, device and medium based on block chain | |
| CN109863719B (en) | Method and system for controlling transfer through block chain | |
| CN108985644B (en) | Rights and interests distribution method and device and electronic equipment | |
| CN103455592B (en) | Question answering method, device and system | |
| CN110223040B (en) | Project management method and device, electronic equipment and storage medium | |
| CN111882745A (en) | Object selection method and device and electronic equipment | |
| CN106651213B (en) | Service order processing method and device | |
| KR102270217B1 (en) | Blockchain system that generates job seeker information based on commute time | |
| CN109255747A (en) | A kind of intelligent checks method that information is declared | |
| KR102114131B1 (en) | Block chain remote storage information management system based on quantitative evaluation environment of art works | |
| CN109951374B (en) | Virtual resource object allocation method and equipment | |
| CN107545377A (en) | A kind of project management method and device | |
| CN111311465A (en) | Block chain-based citizen participation city management excitation method, equipment and medium | |
| CN110502716A (en) | A kind of methods of exhibiting of information of vehicles, server, terminal device | |
| CN113902153A (en) | Commemorative coin reservation method and device, storage medium and electronic equipment | |
| CN111091353A (en) | Loving public interest management method, equipment and medium based on block chain | |
| CN112184449A (en) | Block chain-based management method and system | |
| CN110681159A (en) | Team forming method, device and equipment | |
| CN111652634A (en) | Video excitation method, device and medium based on block chain | |
| CN104463661B (en) | The processing method and system of transaction data | |
| CN111445317B (en) | Online customer service method and system based on service group | |
| CN113778547A (en) | Object processing method and device, computer program product and processor | |
| CN113850449A (en) | Task allocation method and device | |
| CN114694816A (en) | Resource sharing processing method, device, equipment and storage medium | |
| CN114548939A (en) | Public welfare activity operation method and system based on meta universe and block chain |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200817 Address after: Room 1-2301, Building 7, North District, Shandong Design and Creative Industry Park, No. 868 Tangye West Road, Licheng District, Jinan City, Shandong Province, 250102 Applicant after: SHANDONG INSPUR QUALINK TECHNOLOGY Co.,Ltd. Address before: Room 3110, S01 building, Langchao building, No. 1036, Langchao Road, high tech Zone, Jinan City, Shandong Province 250101 Applicant before: Shandong Aicheng Network Information Technology Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |