CN110895745B - Method and device for polling to obtain task, computer equipment and storage medium - Google Patents

Method and device for polling to obtain task, computer equipment and storage medium Download PDF

Info

Publication number
CN110895745B
CN110895745B CN201911212848.XA CN201911212848A CN110895745B CN 110895745 B CN110895745 B CN 110895745B CN 201911212848 A CN201911212848 A CN 201911212848A CN 110895745 B CN110895745 B CN 110895745B
Authority
CN
China
Prior art keywords
auditor
task
current
user list
history
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
CN201911212848.XA
Other languages
Chinese (zh)
Other versions
CN110895745A (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 Qianhai Huanrong Lianyi Information Technology Service Co Ltd
Original Assignee
Shenzhen Qianhai Huanrong Lianyi Information Technology Service Co 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 Qianhai Huanrong Lianyi Information Technology Service Co Ltd filed Critical Shenzhen Qianhai Huanrong Lianyi Information Technology Service Co Ltd
Priority to CN201911212848.XA priority Critical patent/CN110895745B/en
Publication of CN110895745A publication Critical patent/CN110895745A/en
Application granted granted Critical
Publication of CN110895745B publication Critical patent/CN110895745B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316—Sequencing of tasks or work

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • Operations Research (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Educational Administration (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • User Interface Of Digital Computer (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a method, a device, computer equipment and a storage medium for polling and getting tasks, wherein the method comprises the following steps: setting a retrieval task history table for recording history retrieval task information; acquiring a current working process and nodes thereof, and acquiring a corresponding user list; inquiring whether a corresponding history record exists in the picking task history table according to the parameter information; when corresponding history records exist in the picking task history list, obtaining the ID of the auditor in the last history record, inquiring the ID of the next auditor in the user list according to the obtained ID of the auditor to be used as the current auditor ID, and using the auditor corresponding to the current auditor ID as the current auditor of the node; and when no corresponding history record exists in the picking task history table, taking the first auditor ID in the user list as the current auditor ID. The invention makes the task allocation more reasonable by polling the auditors.

Description

Method and device for polling and getting task, computer equipment and storage medium
Technical Field
The invention relates to the technical field of computer software, in particular to a method and a device for polling and getting tasks, computer equipment and a storage medium.
Background
In complex business, in order to better ensure the strictness of the process and control risk, business roles are continuously increased, and personnel in the roles are also continuously increased, when a certain role corresponds to a plurality of business personnel, newly-initiated business auditing can cause the problem of unreasonable task allocation, namely, some business personnel can be repeatedly allocated to the task, and some business personnel can be never allocated to the task, so that the working efficiency of the business personnel is low.
Therefore, how to achieve reasonable task allocation and improve the working efficiency is a problem to be solved by those skilled in the art.
Disclosure of Invention
The embodiment of the invention provides a method, a device, computer equipment and a storage medium for polling and getting tasks, aiming at realizing reasonable task distribution by polling auditors, thereby improving the effect of working efficiency.
In a first aspect, an embodiment of the present invention provides a method for polling a task, where the method includes:
setting a retrieval task history table for recording history retrieval task information;
acquiring a current work flow and nodes thereof, inquiring a role of an auditor corresponding to the nodes according to configuration information of the nodes, and acquiring a corresponding user list according to the role of the auditor; wherein the user list comprises: an auditor ID;
sorting the ID of each auditor in the user list;
acquiring parameter information of the node, and inquiring whether a corresponding history record exists in the picking task history table according to the parameter information;
when corresponding history records exist in the picking task history table, obtaining the ID of the auditor in the latest history record, inquiring the ID of the next auditor in the user list according to the obtained ID of the auditor to serve as the current auditor, and taking the auditor corresponding to the current auditor ID as the current auditor of the node;
when no corresponding history record exists in the picking task history table, taking a first auditor ID in the user list as a current auditor ID, and taking an auditor corresponding to the current auditor ID as a current auditor of the node;
and storing the information of the current auditor of the node into task assignment information, and updating the history record in the task picking history table.
Further, the task history table includes: the name of the flow chart, the ID of the flow link, the ID of the auditor and the auditing time.
Further, the sorting the auditor IDs in the user list includes:
the auditor IDs are sorted in order from small to large.
Further, the parameter information is a flow chart name and a flow link ID.
Further, the querying, according to the obtained auditor ID, a next auditor ID in the user list as a current auditor ID includes:
and traversing and inquiring in the user list according to the obtained auditor ID, and obtaining the next auditor ID as the current auditor ID.
Further, the performing traversal query in the user list according to the obtained auditor ID to obtain a next auditor ID as a current auditor ID includes:
sequentially performing traversal query operation from the first verifier ID in the user list, and judging whether the traversed and queried verifier ID is the same as the obtained verifier ID;
if the auditor ID inquired in the traversing mode is the same as the obtained auditor ID, stopping the traversing inquiry, and outputting the next auditor ID of the auditor IDs inquired in the traversing mode in the user list as a result;
and if the ID of the auditor inquired in the traversing way is different from the obtained ID of the auditor, continuously querying the ID of the next auditor in the traversing way.
Further, the performing traversal query in the user list according to the obtained auditor ID to obtain a next auditor ID as a current auditor ID further includes:
and if the auditor ID inquired in the traversing mode is the same as the obtained auditor ID and the auditor ID inquired in the traversing mode is the last auditor ID in the user list, stopping the traversing inquiry, and outputting the first auditor ID in the user list as a result.
In a second aspect, an embodiment of the present invention provides an apparatus for polling a task, where the apparatus includes:
the setting unit is used for setting a reception task history table for recording history reception task information;
the acquisition unit is used for acquiring the current work flow and the nodes thereof, inquiring the role of the auditor corresponding to the nodes according to the configuration information of the nodes, and acquiring the corresponding user list according to the role of the auditor; wherein the user list comprises: an auditor ID;
the sorting unit is used for sorting the ID of each auditor in the user list;
the parameter unit is used for acquiring parameter information of the node and inquiring whether a corresponding history record exists in the task picking history table according to the parameter information;
the first auditor unit is used for acquiring the ID of the auditor in the last history record when the corresponding history record exists in the picking task history table, inquiring the ID of the next auditor in the user list according to the acquired ID of the auditor to be used as the current auditor, and using the auditor corresponding to the current auditor ID as the current auditor of the node;
a second reviewer unit, configured to, when there is no corresponding history record in the task picking history table, take a first reviewer ID in the user list as a current reviewer ID, and take a reviewer corresponding to the current reviewer ID as a current reviewer of the node;
and the storage unit is used for storing the information of the current auditor of the node into task assignment information and updating the history record in the task picking history table.
In a third aspect, an embodiment of the present invention provides a computer device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the method for polling a task when executing the computer program.
In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program implements the method for polling a task.
The embodiment of the invention provides a method, a device, computer equipment and a storage medium for polling and getting tasks, wherein the method comprises the following steps: setting a retrieval task history table for recording history retrieval task information; acquiring a current work flow and nodes thereof, inquiring a role of an auditor corresponding to the nodes according to configuration information of the nodes, and acquiring a corresponding user list according to the role of the auditor; wherein the user list comprises: an auditor ID; sequencing the ID of each auditor in the user list; acquiring parameter information of the node, and inquiring whether a corresponding history record exists in the picking task history table according to the parameter information; when corresponding history records exist in the picking task history list, obtaining the ID of the auditor in the last history record, inquiring the ID of the next auditor in the user list according to the obtained ID of the auditor to be used as the current auditor ID, and using the auditor corresponding to the current auditor ID as the current auditor of the node; when no corresponding history record exists in the picking task history table, taking a first auditor ID in the user list as a current auditor ID, and taking an auditor corresponding to the current auditor ID as a current auditor of the node; and storing the information of the current auditor of the node into task assignment information, and updating the history record in the task picking history table. The embodiment of the invention carries out polling operation on the auditors, so that the task distribution is more reasonable and even, and the working efficiency is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a flow chart illustrating a method for polling a task according to an embodiment of the present invention;
FIG. 2 is a block diagram of an apparatus for polling a pick-up task according to an embodiment of the invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting. As used in the specification of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be further understood that the term "and/or" as used in this specification and the appended claims refers to any and all possible combinations of one or more of the associated listed items and includes such combinations.
Referring to fig. 1, fig. 1 is a schematic flowchart of a method for polling a task according to an embodiment of the present invention, where the method specifically includes: steps S101 to S107.
S101, setting a retrieval task history table for recording history retrieval task information;
in this step, the set retrieval task history table is used to record history retrieval task information, where the history retrieval task information refers to retrieval information or allocation information of a history job task, and the history job task may refer to a history task of a different workflow, or a history task of a different node in the same workflow.
In one embodiment, the get task history table includes: the method comprises the following steps of flow chart name, flow link ID, auditor ID and audit time.
In this embodiment, the task history table includes a flow chart name, a flow link ID, an auditor ID, and audit time, where the flow chart name refers to a flow chart corresponding to a workflow, and different workflows may be distinguished according to the flow chart name; the process link ID refers to the ID of a certain node in the work process, and the historical record of the corresponding node can be inquired in the task picking history table according to the process link ID; the auditor ID is the auditor ID of the picking task, and the task picked by the auditor generally belongs to a certain node task in the workflow, so that the corresponding auditor ID in a certain node of the workflow can be obtained in the picking task history table; the auditing time refers to the time for the auditor to audit the task, namely the time for executing the picking task. Of course, the pick-up task history table may also include other contents, such as the number of each flow of each flowchart, and the like.
S102, acquiring a current working process and nodes thereof, inquiring a role of an auditor corresponding to the nodes according to configuration information of the nodes, and acquiring a corresponding user list according to the role of the auditor; wherein the user list comprises: an auditor ID;
when a certain node in a workflow needs to distribute an auditor, the workflow and the node of the workflow are obtained, and each node in the workflow has the configuration of a preset auditor role, so that the auditor role of the node can be inquired from the configuration information, and a user list corresponding to the auditor role is further obtained according to the inquired auditor role. In this way, in the obtained user list, the role of the auditor corresponding to the auditor ID is the role of the auditor predetermined by the node. In an embodiment, a user list corresponding to an auditor role is obtained in a preset user information correlation table according to the auditor role. The user information correlation table comprises ID information of auditors and role information of auditors, so that auditors with the same role can be inquired in the user information correlation table according to the inquired role of the auditors, namely, a user list corresponding to the role of the auditors preset by the node is obtained, and meanwhile, the auditors with the same role are obtained together.
S103, sorting the ID of each auditor in the user list;
in this step, because the obtained auditors IDs in the user list may not be arranged according to a certain rule, in this embodiment, in order to successfully execute the subsequent steps, the auditors IDs in the user list need to be arranged in a rule, and the respective sequence does not change after the arrangement is completed, so that the auditors IDs in the user list need to be sorted. When the reviewer IDs are sorted, other contents (such as reviewer roles and the like) in the records in which the reviewer IDs are located are updated with the reviewer IDs, that is, the records in the user list are sorted integrally according to the sorting manner of the reviewer IDs.
In an embodiment, the sorting the reviewer IDs in the user list includes: and sorting the auditor IDs from small to large. In this embodiment, since the reviewer ID is usually composed of numbers or english letters, the reviewer ID completely composed of numbers can be directly compared in size to perform sorting; for the ID of the auditor completely composed of English letters, the ID can be sorted according to the sequence of the English letters in the alphabet, namely, the position of the English letter which is positioned more forward in the alphabet is positioned more forward in the user list; when a plurality of English letters exist, the position sequence of the first English letter is compared firstly, if the position of the first English letter is the same, the second English letter is compared continuously, and the rest is done in the same way until the sorting is finished; for the examiner ID containing both English letters and numbers, the examiner ID can be sorted according to the order of the English letters preferentially, and when the English letters are the same, the examiner ID is sorted according to the size of the numbers.
For example, one auditor ID is abc, the other auditor ID is acd, and the two auditor IDs are compared, wherein the first English letters of the two auditor IDs are the same (both are a), the second English letter is continuously compared, and the position of b is known to be before c, so that the auditor ID (abc) can be arranged in front of the auditor ID (acd); for another example, if one auditor ID is abc123 and the other auditor ID is abc456, and the two auditor IDs are compared, the order of the english letters of the two auditor IDs is compared first, and the order of the english letters of the two auditor IDs is known to be the same, then the sizes of the numbers of the two auditor IDs are compared, and the number 123 is known to be smaller than 456, so that the auditor ID (abc 123) is arranged in front of the auditor ID (abc 456).
In this embodiment, since the auditor IDs are generated in the database in a self-increasing order, the order of the auditor IDs will not change after the auditor IDs are sorted in a descending order. When the number of the auditors ID in the user list changes, the auditors ID in the user list and the record where the auditors ID is located need to be updated in position. For example, when an auditor ID is added to the user list, the added auditor ID may be arranged directly at the last position in the user list, since the order in which the added auditor ID is generated in the database is the last; when a plurality of added auditors IDs are available, the added auditors IDs are sorted according to the sequence generated in the database, and then the sorted auditors IDs are arranged at the last position in the user list; when the auditor IDs in the user list are reduced, the positions of the auditors IDs in front of the reduced auditors IDs are kept unchanged, and the positions of the auditors IDs behind are made to advance in sequence until no vacant position exists between the head and the tail of the user list. In other embodiments, of course, the auditors IDs may be sorted in order from large to small, or sorted according to other rules, and only when sorting is performed in other manners, the generation order of the auditors IDs needs to be generated in a corresponding manner. For example, the manner of sorting the auditor IDs in the user list is as follows: the reviewer IDs are sorted in descending order, so that reviewer IDs are generated in the database in a self-decreasing order.
S104, acquiring parameter information of the node, and inquiring whether a corresponding history record exists in the picking task history table according to the parameter information;
in this step, since a plurality of information such as process information and reviewer information are recorded in the retrieval task history table, a history corresponding to the node can be queried in the retrieval task history table according to the parameter information of the node, where the history refers to that the node retrieves reviewer information, review time, and the like of the task of the node in the previous task allocation.
In an embodiment, the parameter information is a flow chart name and a flow link ID. That is, according to the name information of the workflow where the node is located and the ID information of the node, it can be quickly queried whether there is a history record corresponding to the node in the pick-up task history table, that is, it can first query the same flow chart name in the pick-up task history table according to the workflow where the node is located, so as to query the same flow link ID in the pick-up task history table according to the ID information of the node, so that it can more quickly and accurately find the history record corresponding to the node in the pick-up task history table, and improve the query efficiency.
S105, when corresponding history records exist in the picking task history table, obtaining the ID of the auditor in the last history record, inquiring the ID of the next auditor in the user list according to the obtained ID of the auditor to be used as the current auditor ID, and using the auditor corresponding to the current auditor ID as the current auditor of the node;
in this step, when a history corresponding to the node exists in the task picking history table, the ID of the auditor is obtained from the history. Here, since there may be only one history record corresponding to the node or a plurality of history records, when a plurality of history records are searched, the latest history record is selected. The purpose of this is that, the auditor ID obtained from the last history record is also the last auditor ID for picking up the task of the node, so that it can be ensured that, when the user list is queried, the auditor corresponding to the next auditor ID that is queried does not pick up the task of the node, or that, in the current round of picking up task of the user list, the auditor corresponding to the next auditor ID that is queried does not pick up the task of the node, and reasonable allocation of the tasks is achieved; if the obtained auditor ID is not the last auditor ID, the auditor corresponding to the next auditor ID inquired in the user list will get the node task again, so that the auditor corresponding to some auditor IDs in the user list can get the node task for many times, and the auditor corresponding to some auditor IDs never gets the node task, which results in unreasonable task allocation.
In this embodiment, if there are multiple history records, the determination may be performed according to the review time in the history records, that is, when the review time is the latest review time, the corresponding history record is the latest history record; when the auditing time is not the latest auditing time, the corresponding history record is not the latest history record.
And inquiring in the user list according to the obtained auditor ID, wherein the obtained auditor ID is the auditor ID of the node task obtained in the last work flow, and meanwhile, the auditor IDs in the user list are arranged in a sequence from small to large and the arrangement sequence is not changed, so that the auditor ID identical to the obtained auditor ID can be inquired in the user list at first. When the auditor ID same as the obtained auditor ID is inquired, the auditor corresponding to the auditor ID in front of the inquired auditor ID already accepts the node task at least once, and the auditor corresponding to the auditor ID behind the inquired auditor ID accepts the node task less times than the auditor ID inquired and the auditor corresponding to the auditor ID in front, so that the auditor ID next to the inquired auditor ID is taken as the current auditor ID of the node, namely the auditor ID corresponding to the current auditor ID of the node task is taken at this time, namely the auditor ID corresponding to the current auditor ID is taken as the current auditor of the node, thus ensuring that the auditor corresponding to each auditor ID in the user list is allocated to the node task reasonably.
S106, when no corresponding history record exists in the picking task history table, taking the ID of the first auditor in the user list as the ID of the current auditor, and taking the auditor corresponding to the ID of the current auditor as the current auditor of the node;
in this step, because the node may be a newly added node, or the history pickup information of the node is not recorded in the pickup task history table, or other reasons, there is no history record corresponding to the node in the pickup task history table. In this case, since the auditor ID in the history record corresponding to the node cannot be obtained, the audit cannot be performed in the user list, but the auditor needs to be allocated to the node, so that the first auditor ID in the user list can be directly selected as the current auditor ID of the node, that is, the auditor corresponding to the first auditor ID is used as the current auditor of the node.
In this embodiment, the auditor corresponding to the first auditor ID in the user list is selected as the current auditor for the node, instead of randomly selecting one auditor corresponding to the first auditor ID in the user list as the current auditor for the node, on one hand, because this method conforms to the usual allocation rule, that is, when allocating the picking task for the first time, the picking task is allocated to the auditor corresponding to the first position in the list; on the other hand, confusion caused by the fact that the task of the node is distributed next time when the user list is changed can be prevented.
And S107, storing the information of the current auditor of the node into task assignment information, and updating the history record in the task picking history table.
When the node determines the current auditor, the information of the current auditor (such as the ID information and role information of the current auditor) is stored in the task assignment information. Meanwhile, the history records in the received task history table need to be saved and updated, for example, the ID of the auditor of the node and the audit time need to be saved and updated, so that the latest (that is, this time) history record can be queried when the history record is queried when the task is next distributed.
In the embodiment, a retrieval task history table for storing history retrieval task records is set, and the obtained user list is inquired according to the history records of the retrieval task history table to obtain the reviewer of the work flow node, so that the task distribution is more reasonable and average, the task distribution efficiency is improved, and the work efficiency of the reviewer is improved.
In an embodiment, the querying, according to the obtained reviewer ID, a next reviewer ID in the user list as a current reviewer ID includes: and traversing and inquiring in the user list according to the obtained auditor ID, and obtaining the next auditor ID as the current auditor ID. In the embodiment, through performing traversal query on the auditors IDs in the user list, namely querying the auditors IDs in the user list one by one, omission can be effectively prevented in the query process, and meanwhile, the means of traversal query is more efficient than the blind and random query means. When the next reviewer ID identical to the obtained reviewer ID is queried, traversal querying may be stopped.
In an embodiment, the performing traversal query in the user list according to the obtained auditor ID, and obtaining a next auditor ID as a current auditor ID includes: sequentially performing traversal query operation from the first verifier ID in the user list, and judging whether the traversed and queried verifier ID is the same as the obtained verifier ID; if the auditor ID inquired in the traversing mode is the same as the obtained auditor ID, stopping the traversing inquiry, and outputting the next auditor ID of the auditor IDs inquired in the traversing mode in the user list as a result; and if the ID of the auditor inquired in the traversing way is different from the obtained ID of the auditor, continuously querying the ID of the next auditor in the traversing way.
In this embodiment, a first reviewer ID in the user list is selected as an object of the first traversal query, the obtained reviewer ID is judged and compared with the first reviewer ID, if the obtained reviewer ID is the same as the first reviewer ID, the traversal query may be stopped, and a reviewer ID next to the first reviewer ID (i.e., a second reviewer ID) is output as a result; and if not, performing second traversal query, continuously judging whether the obtained ID of the auditor is the same as the ID of the second auditor, if so, stopping traversal query, and if not, continuously performing third traversal query. And repeating the steps until the obtained auditor ID is the same as the auditor ID of the traversal query, stopping the traversal query at the moment, and outputting the next auditor ID of the traversal query as a result, namely taking the next auditor ID as the current auditor ID of the node, namely taking the auditor corresponding to the current auditor ID as the current auditor of the node.
In an embodiment, the performing traversal query in the user list according to the obtained auditor ID to obtain a next auditor ID as a current auditor ID further includes: and if the auditor ID inquired in the traversing mode is the same as the obtained auditor ID and the auditor ID inquired in the traversing mode is the last auditor ID in the user list, stopping the traversing inquiry, and outputting the first auditor ID in the user list as a result.
In this embodiment, when the auditor ID queried in the traversal query is the same as the obtained auditor ID and is located at the last of the user list, at this time, because the auditor ID queried in the traversal query is the last one, and there is no next auditor ID, the first auditor ID in the user list is selected as the next auditor ID of the last auditor ID, and therefore the auditor corresponding to the first auditor ID is used as the current auditor of the node. By using the first auditor ID in the user list as the next auditor ID of the last auditor ID, it can be ensured that when the user list is subjected to traversal query, no matter which position the auditor ID queried by traversal is located, the next auditor ID exists, namely an output result exists, and tasks are circularly allocated.
In an embodiment, if the user list cannot search the reviewer ID identical to the obtained reviewer ID in a traversing manner, obtaining the reviewer ID of the last history record of the latest history record in the picking task history table, and performing the search again.
In this embodiment, if the reviewer who obtained the node task last time does not have the reviewer ID that obtained the node task last time in the user list for some reasons (for example, for leave or other reasons), the reviewer ID that is the same as the obtained reviewer ID cannot be queried in the user list. At this time, the node task needs to return to the pick-up task history table again, select the history record corresponding to the last audit time of the last audit time, acquire the auditor ID in the history record, and then continue to perform traversal query on the user list according to the acquired auditor ID until the current auditor for picking up the node task meets the requirement. Preferably, according to the above manner (i.e., the query manner of obtaining the auditor ID in the last history), when the auditor ID identical to the obtained auditor ID cannot be queried in the user list in a traversal manner for three times, the first auditor ID in the user list is used as the current auditor ID of the node, that is, the auditor corresponding to the first auditor ID is used as the current auditor of the node.
Referring to fig. 2, fig. 2 is a schematic block diagram of an apparatus 200 for polling a task, according to an embodiment of the present invention, where the apparatus 200 includes:
a setting unit 201, configured to set a retrieval task history table for recording history retrieval task information;
an obtaining unit 202, configured to obtain a current workflow and a node thereof, query an auditor role corresponding to the node according to configuration information of the node, and obtain a corresponding user list according to the auditor role; wherein the user list comprises: an auditor ID;
a sorting unit 203, configured to sort the auditors IDs in the user list;
a parameter unit 204, configured to obtain parameter information of the node, and query, according to the parameter information, whether a corresponding history exists in the task pickup history table;
a first reviewer unit 205, configured to, when a corresponding history exists in the picking task history table, obtain an auditor ID in the last history, query, according to the obtained auditor ID, a next auditor ID in the user list as a current auditor ID, and use an auditor corresponding to the current auditor ID as a current auditor of the node;
a second reviewer unit 206, configured to, when there is no corresponding history record in the task picking history table, take the first reviewer ID in the user list as the current reviewer ID, and take the reviewer corresponding to the current reviewer ID as the current reviewer of the node;
a saving unit 207, configured to save the information of the current reviewer of the node in the task assignment information, and update the history record in the pickup task history table.
In one embodiment, the get task history table includes: the method comprises the following steps of flow chart name, flow link ID, auditor ID and audit time.
In one embodiment, the sorting unit 203 includes:
and the sequence sorting unit is used for sorting the ID of each auditor from small to large.
In an embodiment, the parameter information is a flow chart name and a flow link ID.
In one embodiment, the first reviewer unit 205 includes:
and the first traversal unit is used for performing traversal query in the user list according to the obtained auditor ID, and obtaining the next auditor ID as the current auditor ID.
In an embodiment, the first traversal unit includes:
the judging unit is used for sequentially performing traversal query operation from the first auditor ID in the user list and judging whether the auditor ID subjected to traversal query is the same as the obtained auditor ID;
a first result output unit, configured to stop the traversal query if the traversed queried reviewer ID is the same as the obtained reviewer ID, and output a reviewer ID next to the traversed queried reviewer ID in the user list as a result;
and the second traversal unit is used for continuously querying the next ID of the auditor in a traversal mode if the ID of the auditor queried in the traversal mode is different from the obtained ID of the auditor.
In one embodiment, the first result output unit includes:
and the second result output unit is used for stopping the traversal query and outputting the first auditor ID in the user list as a result if the traversed and queried auditor ID is the same as the acquired auditor ID and the traversed and queried auditor ID is the last auditor ID in the user list.
Since the embodiments of the apparatus portion and the method portion correspond to each other, please refer to the description of the embodiments of the method portion for the embodiments of the apparatus portion, which is not repeated here.
Embodiments of the present invention also provide a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed, the steps provided by the above embodiments can be implemented. The storage medium may include: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The embodiment of the present invention further provides a computer device, which may include a memory and a processor, where the memory stores a computer program, and the processor may implement the steps provided in the above embodiments when calling the computer program in the memory. Of course, the electronic device may also include various network interfaces, power supplies, and the like.
The embodiments are described in a progressive manner in the specification, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. For the system disclosed by the embodiment, the description is relatively simple because the system corresponds to the method disclosed by the embodiment, and the relevant points can be referred to the method part for description. It should be noted that, for those skilled in the art, without departing from the principle of the present application, the present application can also make several improvements and modifications, and those improvements and modifications also fall into the protection scope of the claims of the present application.
It is further noted that, in the present specification, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, 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 a … …" does not exclude the presence of another identical element in a process, method, article, or apparatus that comprises the element.

Claims (10)

1. A method of polling a pick-up task, comprising:
setting a retrieval task history table for recording history retrieval task information;
acquiring a current work flow and nodes thereof, inquiring a role of an auditor corresponding to the nodes according to configuration information of the nodes, and acquiring a corresponding user list according to the role of the auditor; wherein the user list comprises: an auditor ID;
sorting the ID of each auditor in the user list;
acquiring parameter information of the node, and inquiring whether a corresponding history record exists in the picking task history table according to the parameter information;
when corresponding history records exist in the picking task history list, obtaining the ID of the auditor in the last history record, inquiring the ID of the next auditor in the user list according to the obtained ID of the auditor to be used as the current auditor ID, and using the auditor corresponding to the current auditor ID as the current auditor of the node;
when no corresponding history record exists in the picking task history list, taking the first auditor ID in the user list as the current auditor ID, and taking the auditor corresponding to the current auditor ID as the current auditor of the node;
and storing the information of the current auditor of the node into task assignment information, and updating the history record in the task picking history table.
2. The method of polling a pick task of claim 1, wherein the pick task history table comprises: the method comprises the following steps of flow chart name, flow link ID, auditor ID and audit time.
3. The method of polling a pick task of claim 1, wherein the sorting of the reviewer IDs in the user list comprises:
and sorting the auditor IDs from small to large.
4. The method of polling claim 2 wherein the parameter information is a flow chart name and a flow link ID.
5. The method for polling a task according to claim 1, wherein the querying, according to the obtained auditor ID, a next auditor ID in the user list as a current auditor ID includes:
and performing traversal query in the user list according to the obtained ID of the auditor, and obtaining the ID of the next auditor as the current auditor ID.
6. The method for polling a task according to claim 5, wherein the performing a traversal query in the user list according to the obtained reviewer ID to obtain a next reviewer ID as a current reviewer ID comprises:
sequentially performing traversal query operation from the first verifier ID in the user list, and judging whether the traversed and queried verifier ID is the same as the obtained verifier ID;
if the auditor ID inquired in the traversing mode is the same as the obtained auditor ID, stopping the traversing inquiry, and outputting the next auditor ID of the auditor ID inquired in the traversing mode in the user list as a result;
and if the ID of the auditor inquired in the traversing way is different from the obtained ID of the auditor, continuously inquiring the ID of the next auditor in the traversing way.
7. The method according to claim 6, wherein the step of performing traversal query in the user list according to the obtained auditor ID to obtain a next auditor ID as a current auditor ID further comprises:
and if the auditor ID inquired in the traversing way is the same as the obtained auditor ID and the auditor ID inquired in the traversing way is the last auditor ID in the user list, stopping the traversing inquiry and outputting the first auditor ID in the user list as a result.
8. An apparatus for polling a task, comprising:
the setting unit is used for setting a reception task history table for recording history reception task information;
the acquisition unit is used for acquiring the current work flow and the nodes thereof, inquiring the role of the auditor corresponding to the nodes according to the configuration information of the nodes, and acquiring the corresponding user list according to the role of the auditor; wherein the user list comprises: an auditor ID;
the sorting unit is used for sorting the ID of each auditor in the user list;
the parameter unit is used for acquiring parameter information of the node and inquiring whether a corresponding history record exists in the picking task history table according to the parameter information;
the first auditor unit is used for acquiring the ID of the auditor in the latest history record when the corresponding history record exists in the task picking history table, inquiring the ID of the next auditor in the user list according to the acquired ID of the auditor to serve as the current auditor, and taking the auditor corresponding to the current auditor ID as the current auditor of the node;
a second reviewer unit, configured to, when there is no corresponding history record in the task picking history table, take a first reviewer ID in the user list as a current reviewer ID, and take a reviewer corresponding to the current reviewer ID as a current reviewer of the node;
and the storage unit is used for storing the information of the current auditor of the node into task assignment information and updating the history record in the task picking history table.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing a method of polling task as claimed in any one of claims 1 to 7 when executing the computer program.
10. A computer-readable storage medium, having stored thereon a computer program which, when executed by a processor, implements a method of polling task according to any of claims 1 to 7.
CN201911212848.XA 2019-12-02 2019-12-02 Method and device for polling to obtain task, computer equipment and storage medium Active CN110895745B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911212848.XA CN110895745B (en) 2019-12-02 2019-12-02 Method and device for polling to obtain task, computer equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911212848.XA CN110895745B (en) 2019-12-02 2019-12-02 Method and device for polling to obtain task, computer equipment and storage medium

Publications (2)

Publication Number Publication Date
CN110895745A CN110895745A (en) 2020-03-20
CN110895745B true CN110895745B (en) 2023-04-18

Family

ID=69787029

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911212848.XA Active CN110895745B (en) 2019-12-02 2019-12-02 Method and device for polling to obtain task, computer equipment and storage medium

Country Status (1)

Country Link
CN (1) CN110895745B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115129200A (en) * 2022-07-07 2022-09-30 金蝶软件（中国）有限公司 Processing method, device and equipment for list content items and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106327140A (en) * 2015-06-25 2017-01-11 阿里巴巴集团控股有限公司 Method and device for monitoring data modification
CN109636093A (en) * 2018-10-29 2019-04-16 平安医疗健康管理股份有限公司 Method for allocating tasks, device, equipment and storage medium
WO2019109520A1 (en) * 2017-12-08 2019-06-13 平安科技（深圳）有限公司 Video interview work assignment method, apparatus and device, and readable storage medium

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8332335B2 (en) * 2009-10-02 2012-12-11 International Business Machines Corporation Systems and methods for decision pattern identification and application

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106327140A (en) * 2015-06-25 2017-01-11 阿里巴巴集团控股有限公司 Method and device for monitoring data modification
WO2019109520A1 (en) * 2017-12-08 2019-06-13 平安科技（深圳）有限公司 Video interview work assignment method, apparatus and device, and readable storage medium
CN109636093A (en) * 2018-10-29 2019-04-16 平安医疗健康管理股份有限公司 Method for allocating tasks, device, equipment and storage medium

Also Published As

Publication number Publication date
CN110895745A (en) 2020-03-20

Similar Documents

Publication Publication Date Title
CN108268372B (en) Mock test processing method and device, storage medium and computer equipment
JPWO2013128555A1 (en) Task management method and task management apparatus
CN108182258B (en) Distributed data analysis system and method
CN105843956A (en) Paging query method and system
CN107291745B (en) Data index management method and device
CN109669915A (en) A kind of computer task management method, device and relevant device
CN107992506A (en) Information processing method and device
CN110895745B (en) Method and device for polling to obtain task, computer equipment and storage medium
CN111008521A (en) Method and device for generating wide table and computer storage medium
CN110597292A (en) Unmanned aerial vehicle cluster operation planning method and device
CN112488579A (en) Task assignment method and device, electronic equipment and storage medium
CN105701128B (en) A kind of optimization method and device of query statement
CN110807618A (en) Dynamic scheduling method, device and equipment
CN112115121A (en) Data governance real-time data quality detection system
CN109245949B (en) Information processing method and device
CN117078208A (en) Project management system of intelligent environment-friendly supervision platform
CN111104568A (en) Enterprise stock right relation deep search method and device, computer equipment and storage medium
JP5177792B2 (en) Data aggregation method and data aggregation device
CN111078413A (en) Timed task execution method and device, computer equipment and storage medium
CN107784588A (en) Insurance user information merging method and device
CN114443246B (en) Intelligent scheduling method, device, equipment and computer readable storage medium
CN114118770A (en) Index calculation method and device
CN115526479A (en) Automatic part nesting method, device, equipment and storage medium
CN113806365A (en) Single data source data management method, device and storage medium
JP5148157B2 (en) Customer information management device

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
GR01 Patent grant
GR01 Patent grant