CN115880116A - Task scheduling method, system, readable storage medium and computer equipment - Google Patents

Task scheduling method, system, readable storage medium and computer equipment Download PDF

Info

Publication number
CN115880116A
CN115880116A CN202211674029.9A CN202211674029A CN115880116A CN 115880116 A CN115880116 A CN 115880116A CN 202211674029 A CN202211674029 A CN 202211674029A CN 115880116 A CN115880116 A CN 115880116A
Authority
CN
China
Prior art keywords
task
work
sub
progress
analysis report
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
Application number
CN202211674029.9A
Other languages
Chinese (zh)
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.)
Thinvent Digital Technology Co Ltd
Original Assignee
Thinvent Digital Technology 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 Thinvent Digital Technology Co Ltd filed Critical Thinvent Digital Technology Co Ltd
Priority to CN202211674029.9A priority Critical patent/CN115880116A/en
Publication of CN115880116A publication Critical patent/CN115880116A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a task scheduling method, a system, a readable storage medium and computer equipment, wherein the method comprises the steps of obtaining a work task, decomposing the work task into sub-work tasks of different levels through a quantitative index and an analysis model, distributing each sub-work task to a corresponding processing node and a corresponding matching node so that the processing node and the matching node are matched to process the corresponding sub-work task, obtaining progress information of the sub-work tasks and generating a task progress analysis report according to the progress information, wherein the task progress analysis report comprises evidence materials, collaborative data and success evaluation, inputting the task progress analysis report into a file database for storage, and finishing filing the task progress analysis report. The invention can rapidly decompose the work task, can coordinate across points and process the sub-work tasks in a multi-point cooperation mode, generates the processed progress information into an analysis report, and stores the analysis report into the archive database, thereby avoiding data loss.

Description

Task scheduling method, system, readable storage medium and computer equipment
Technical Field
The invention relates to the technical field of task scheduling platforms, in particular to a task scheduling method, a task scheduling system, a readable storage medium and computer equipment.
Background
The related department information center is an important node department of local related department government affair informatization, bears the important function of digital reform of related department with information assistance, and when the related department releases large-scale work task planning, the information center unscrambles the policy planning through a specially-assigned person in the past, thereby analyzing related work measures, but the work measures can not be checked through quantization indexes, thereby causing that the management department does not grab the effective supervision of the implementation of the measures.
In the prior art, a task after being interpreted manually cannot be quickly decomposed, the decomposed task lacks an effective scheduling and monitoring mechanism, and is generally monitored in a 'big meeting' form, so that the progress of the task cannot be known in time, and the task completion degree is easy to lag.
Disclosure of Invention
Based on this, the present invention provides a task scheduling method, system, readable storage medium and computer device to solve at least the above-mentioned deficiencies in the prior art.
The invention provides the following technical scheme, and provides a task scheduling method, which comprises the following steps:
acquiring a work task, and decomposing the work task into sub-work tasks of different levels through a quantitative index and an analysis model;
distributing each sub-work task to a corresponding processing node and a corresponding matching node so that the processing node and the matching node cooperate to process the corresponding sub-work task;
acquiring progress information of the sub-work tasks and generating a task progress analysis report according to the progress information, wherein the task progress analysis report comprises evidence materials, collaborative data and effect evaluation;
and inputting the task progress analysis report into an archive database for storage, and finishing archiving the task progress analysis report.
Compared with the prior art, the invention has the beneficial effects that: the method comprises the steps of decomposing a work task into sub-work tasks of different levels through quantitative indexes and analysis models to achieve the purpose of quickly decomposing the work task into the sub-work tasks of different levels, distributing the sub-work tasks to corresponding processing nodes and matching nodes corresponding to the processing nodes, enabling the matching nodes corresponding to the processing nodes to process the sub-work tasks together, completing scheduling of the work tasks, achieving the purposes of multi-point cooperation and cross-point coordination through the processing nodes and the corresponding matching nodes, obtaining progress information of the corresponding sub-work tasks processed by the processing nodes and the corresponding matching nodes, generating progress analysis reports according to the progress information, transmitting the progress analysis reports to a file database, completing filing of the task progress analysis reports, and avoiding data loss.
Further, the step of obtaining the work task and decomposing the work task into sub-work tasks of different levels through a quantitative index and an analysis model includes:
acquiring the work task, and dividing the work task into a plurality of task sets through a quantitative index;
analyzing the plurality of task sets through an analysis model to obtain the workload of the plurality of task sets;
dividing the work tasks into different levels according to the work gauges of a plurality of the task sets.
Further, after the step of obtaining the work task and decomposing the work task into sub-work tasks of different levels by using the quantitative index and the analysis model, the method further includes:
and inquiring the corresponding processing nodes according to the sub-work tasks of different grades, and inquiring the matching nodes corresponding to the processing nodes.
Further, after the steps of obtaining the progress information of the sub-job task and generating a task progress analysis report according to the progress information, the task progress analysis report includes corroborative materials, collaborative data and performance evaluation, the method further includes:
summarizing the progress information to obtain a task work ledger;
and identifying the progress information of each processing node and the corresponding matching node based on the task work ledger.
Further, after the step of inputting the task progress analysis report into an archive database for storage and completing the archiving of the task progress analysis report, the method further comprises:
and regularly carrying out structured carding on the task progress analysis reports in the archive database to obtain independent analysis reports of each processing node.
In another aspect of the present invention, a task scheduling system is further provided, where the system includes:
the system comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring a work task and decomposing the work task into sub-work tasks of different grades through a quantitative index and an analysis model;
the distribution module is used for distributing each sub-work task to a corresponding processing node and a corresponding matching node so as to enable the processing node and the matching node to cooperatively process the corresponding sub-work task;
the second acquisition module is used for acquiring progress information of the sub-work tasks and generating a task progress analysis report according to the progress information, wherein the task progress analysis report comprises evidence materials, collaborative data and effect evaluation;
and the filing module is used for inputting the task progress analysis report into a file database for storage and finishing filing of the task progress analysis report.
Further, the first obtaining module includes:
the acquisition unit is used for acquiring the work task and dividing the work task into a plurality of task sets through a quantization index;
the analysis unit is used for analyzing the task sets through an analysis model to obtain the workload of the task sets;
and the planning unit is used for planning the sub-work tasks in different levels according to the work gauges of the plurality of task sets.
Further, the system further comprises:
the query module is used for querying the corresponding processing nodes according to the sub-work tasks of different grades and querying the matching nodes corresponding to the processing nodes;
the summarizing module is used for summarizing the progress information to obtain a task work ledger;
the identification module is used for identifying the progress information of each processing node and the corresponding matching node based on the task work ledger;
and the carding module is used for regularly carrying out structured carding on the task progress analysis report in the archive database so as to obtain an independent analysis report of each processing node.
In another aspect, the present invention further provides a readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the task scheduling method described above.
The invention also provides a computer device, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor implements the task scheduling method when executing the computer program.
Drawings
FIG. 1 is a flowchart of a task scheduling method according to a first embodiment of the present invention;
FIG. 2 is a flowchart of a task scheduling method according to a second embodiment of the present invention;
FIG. 3 is a block diagram of a task scheduling system according to a third embodiment of the present invention;
fig. 4 is a block diagram showing a computer device according to a fourth embodiment of the present invention.
Description of the main element symbols:
first acquisition module 11 Dispensing module 12
Second acquisition module 13 Filing module 14
Memory device 10 Processor with a memory having a plurality of memory cells 20
Computer program 30
The following detailed description will further illustrate the invention in conjunction with the above-described figures.
Detailed Description
To facilitate an understanding of the invention, the invention will now be described more fully with reference to the accompanying drawings. Several embodiments of the invention are presented in the drawings. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete.
It will be understood that when an element is referred to as being "secured to" another element, it can be directly on the other element or intervening elements may also be present. When an element is referred to as being "connected" to another element, it can be directly connected to the other element or intervening elements may also be present. The terms "vertical," "horizontal," "left," "right," and the like are used herein for purposes of illustration only.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. 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 of the invention. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.
Example one
Referring to fig. 1, a task scheduling method in a first embodiment of the present invention is shown, and the method specifically includes steps S101 to S104;
s101, acquiring a work task, and decomposing the work task into sub-work tasks of different levels through a quantitative index and an analysis model;
specifically, in this embodiment, the work tasks are annual overall work tasks issued by relevant departments, and the work tasks include assessment targets, task time and other elements. The obtained work tasks are divided through the quantitative indexes, the work tasks are divided according to the workload and the work complexity through the analysis model, so that the sub-work tasks of different levels are obtained, the tasks are not required to be read manually, the work tasks are quickly decomposed, and the details of the sub-work tasks can be displayed through the workload and the work complexity. And the decomposed task work forms a tree diagram, so that the conversion from single-line promotion of the task to multi-task parallel can be realized.
S102, distributing each sub-work task to a corresponding processing node and a corresponding matching node so that the processing node and the matching node cooperate to process the corresponding sub-work task;
it should be explained that, because the work task is decomposed into sub-work tasks of different levels according to the workload and the work complexity, the sub-work tasks of different levels can be distributed to the processing nodes capable of being processed efficiently, and meanwhile, the processing nodes and the matching nodes can process the sub-work tasks together by matching one matching node corresponding to the processing node.
S103, acquiring progress information of the sub-work tasks and generating a task progress analysis report according to the progress information, wherein the task progress analysis report comprises evidence materials, cooperative data and effect evaluation;
during specific implementation, the processing nodes and the corresponding matching nodes are used for feeding back the progress information of the sub-work tasks processed by the processing nodes, and in the process, the matching nodes are used for uploading evidence-based data evidence to the progress information, so that the progress information of the processing nodes and the corresponding matching nodes for processing the corresponding sub-work tasks can be more accurately acquired. In this embodiment, the process information of each processing node and each sub-job task processed by the processing node is acquired through the minimum data filling workload, the same scheduling of the sub-job tasks is realized, a feedback, audit and tracking mechanism of each processing node and each sub-job of the matching node is established, the enthusiasm of each processing node and each matching node is mobilized, and the annual job tasks are pushed to take effect in a ground mode in a resultant force mode. The progress information of the processing sub-work task information of each processing node and the matching node corresponding to the processing node is obtained, the progress information is generated into a task progress analysis report, and the task progress analysis report integrates the corroborative materials of the sub-work tasks, the matching nodes, namely the cooperative data of manufacturers and the effect evaluation, so that the task progress analysis report of each processing node, namely each responsibility department is formed.
S104, inputting the task progress analysis report into a file database for storage, and finishing archiving the task progress analysis report;
during specific implementation, the task progress analysis report of the sub-work tasks processed by the processing nodes and the corresponding matching nodes together is stored in the archive database so as to archive the completion progress of the sub-work tasks, wherein the task progress analysis report comprises the work data and the work content of the sub-work tasks, so that the full collection and the full sharing of the content materials of the sub-work tasks are realized, and the archived task progress analysis report can effectively support various follow-up supervision, audit and assessment works.
In summary, in the task scheduling method in the above embodiment of the present invention, the obtained tasks are decomposed, so that sub-job tasks of different levels can be obtained, and the purpose of quickly decomposing the job tasks is achieved, and the workload and the work complexity in the job tasks are analyzed through the analysis model, the obtained sub-job tasks are decomposed into sub-job tasks of different levels, and the sub-job tasks of different levels are distributed to the processing nodes corresponding to the sub-job tasks and the matching nodes corresponding to the processing nodes, that is, the most suitable responsibility department and the matching sub-job tasks are selected to be processed, so that the effect of improving the job processing progress can be achieved, meanwhile, the task basis is achieved, the nodes are broken down, and the progress information of the processing nodes and the matching nodes processing the sub-job tasks is generated into the task progress analysis report, so that the progress information and the index achievement condition of the processing nodes and the matching nodes corresponding to the sub-job tasks can be known at any time, and the task progress analysis report is stored in the archive data base of each sub-job task, and audit and the assessment and the expansion work is effectively supported.
Example two
Referring to fig. 2, a task scheduling method in a second embodiment of the present invention is shown, where the method specifically includes steps S201 to S211;
s201, acquiring the work task, and dividing the work task into a plurality of task sets through a quantization index;
specifically, in this embodiment, the work task is an annual general work task issued by a relevant department, and the work task includes factors such as an assessment objective and task time. And setting a quantization index, and dividing the work task into a plurality of task sets through the quantization index.
S202, analyzing the plurality of task sets through an analysis model to obtain the workload of the plurality of task sets;
during specific implementation, the work complexity and the work data of a plurality of task sets are analyzed in the analysis model, so that the workload of the task sets is obtained.
S203, dividing the work gauges of a plurality of task sets into the sub-work tasks with different grades;
in the embodiment, a higher level represents that the sub-job task has higher work difficulty and complexity, so that a department with higher working capacity and larger staff is required to process the sub-job task with a higher level.
S204, querying the corresponding processing nodes according to the sub-work tasks of different grades, and querying the matching nodes corresponding to the processing nodes;
in the embodiment, when the level of the sub-job task is higher, a processing node with a large number of working people and high working efficiency, namely, a responsibility department with high working processing efficiency needs to be inquired, and after the processing node is inquired, a matching node which is matched with the processing node well, namely a matching manufacturer matched with the responsibility department, needs to be inquired, so that the responsibility department and the matching manufacturer process the sub-job task together.
S205, distributing each sub-work task to a corresponding processing node and a corresponding matching node, so that the processing node and the matching node cooperate to process the corresponding sub-work task;
it should be explained that, the processing node and the corresponding matching node simultaneously process the corresponding sub-job tasks, in this embodiment, that is, the responsibility department and the matching manufacturer can process the sub-job tasks together, so as to significantly improve the processing efficiency of the responsibility department, and the matching manufacturer corresponding to the responsibility department can match with the responsibility department, so as to achieve the purpose of processing the sub-job tasks together.
S206, acquiring progress information of the sub-job task and generating a task progress analysis report according to the progress information, wherein the task progress analysis report comprises evidence materials, collaborative data and effect evaluation;
in the embodiment, standardized and systematized quantized micro indexes are used as cuts, the progress information of each responsibility department and the cooperation manufacturer is obtained based on a scheduling main line flow of the sub-work tasks through the minimum data filling workload, and a feedback, verification and tracking mechanism of the responsibility department for the sub-work tasks processed by the responsibility department is established, so that the responsibility departments, namely the processing nodes and the cooperation nodes corresponding to the processing nodes, jointly push the work tasks to come into effect. The progress information of the processing sub-work task information of each processing node and the matching node corresponding to the processing node is obtained, the progress information is generated into a task progress analysis report, and the task progress analysis report integrates the corroborative materials of the sub-work tasks, the matching nodes, namely the cooperative data of manufacturers and the effect evaluation, so that the task progress analysis report of each processing node, namely each responsibility department is formed.
S207, summarizing the progress information to obtain a task work ledger;
s208, based on the task work ledger, identifying the progress information of each processing node and the corresponding matching node;
specifically, after the progress information of each processing node and the matching node corresponding to the processing node is summarized, the task work ledger of each processing node and each matching node is obtained, in this embodiment, the task work ledger includes the task processing progress and the task processing speed of each processing node and each matching node, and identifies each processing node and the matching node corresponding to the processing node, and specifically, the processing node identified as a red board and the matching node corresponding to the processing node represents that the task processing progress of the processing node is low and the task processing is slow, otherwise, the processing node with the fast task processing progress is identified as a yellow board, and a work promotion ranking list of each processing node is constructed, so that a dense atmosphere of 'creating a good first' is created by comparing the quality and the progress, and the completion of each sub-work task is promoted quickly and well.
S209, inputting the task progress analysis report into a file database for storage, and finishing the filing of the task progress analysis report;
during specific implementation, the task progress analysis report of the sub-work tasks processed by the processing nodes and the corresponding matching nodes together is stored in the archive database so as to archive the completion progress of the sub-work tasks, wherein the task progress analysis report comprises the work data and the work content of the sub-work tasks, so that the full collection and the full sharing of the content materials of the sub-work tasks are realized, and the archived task progress analysis report can effectively support various follow-up supervision, audit and assessment works.
S210, regularly performing structured combing on the task progress analysis reports in the archive database to obtain independent analysis reports of each processing node;
when the method is specifically implemented, the task progress analysis reports stored in the archive database are structurally sorted, all sub-work tasks are fully collected and shared, so that independent analysis reports of all processing nodes are formed, all processing nodes can be evaluated according to the independent analysis reports, the sub-work task processing effects of all processing nodes can be obtained, the total work tasks can be sorted, a tree-shaped work task graph is obtained, and subsequent supervision, audit and assessment work is effectively supported.
In summary, compared with the first embodiment, the task scheduling method in the foregoing embodiment of the present invention can identify each processing node, so as to obtain the state of each processing node and the state of the cooperating node corresponding to each processing node when processing the sub-job task, and perform structured combing on the task progress analysis report filed in the database to obtain the independent analysis report of each processing node, and can evaluate each processing node according to the independent analysis report, so as to obtain the sub-job task processing success of each processing node.
EXAMPLE III
Referring to fig. 3, a task scheduling system according to a third embodiment of the present invention is further provided, where the task scheduling system includes:
the first acquisition module 11 is used for acquiring a work task and decomposing the work task into sub-work tasks of different levels through a quantitative index and an analysis model;
the distribution module 12 is configured to distribute each of the sub-job tasks to a corresponding processing node and a corresponding coordination node, so that the processing node and the coordination node cooperate to process the corresponding sub-job task;
the second obtaining module 13 is configured to obtain progress information of the sub-job task and generate a task progress analysis report according to the progress information, where the task progress analysis report includes corroborative materials, collaborative data, and performance evaluation;
and the archiving module 14 is used for inputting the task progress analysis report into an archive database for storage, and completing archiving of the task progress analysis report.
In this embodiment, the first obtaining module includes:
the acquisition unit is used for acquiring the work task and dividing the work task into a plurality of task sets through a quantization index;
the analysis unit is used for analyzing the task sets through an analysis model to obtain the workload of the task sets;
and the planning unit is used for planning the sub-work tasks in different levels according to the work gauges of the plurality of task sets.
In some optional embodiments, the system further comprises:
the query module is used for querying the corresponding processing nodes according to the sub-work tasks of different grades and querying the matching nodes corresponding to the processing nodes;
the summarizing module is used for summarizing the progress information to obtain a task work ledger;
the identification module is used for identifying the progress information of each processing node and the corresponding matching node based on the task work ledger;
and the carding module is used for regularly carrying out structured carding on the task progress analysis report in the archive database so as to obtain an independent analysis report of each processing node.
The task scheduling system provided in the embodiment of the present invention has the same implementation principle and the same technical effects as those of the foregoing method embodiment, and for brief description, reference may be made to corresponding contents in the foregoing method embodiment for a part not mentioned in the system embodiment.
Example four
Referring to fig. 4, a computer device according to a fourth embodiment of the present invention is shown, which includes a memory 10, a processor 20, and a computer program 30 stored in the memory 10 and executable on the processor 20, where the processor 20 implements the task scheduling method when executing the computer program 30.
The memory 10 includes at least one type of readable storage medium including a flash memory, a hard disk, a multimedia card, a card type memory (e.g., SD or DX memory, etc.), a magnetic memory, a magnetic disk, an optical disk, and the like. The memory 10 may in some embodiments be an internal storage unit of the computer device, for example a hard disk of the computer device. The memory 10 may also be an external storage device in other embodiments, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like. Further, the memory 10 may also include both an internal storage unit and an external storage device of the computer apparatus. The memory 10 may be used not only to store application software installed in the computer device and various kinds of data, but also to temporarily store data that has been output or will be output.
In some embodiments, the processor 20 may be an Electronic Control Unit (ECU), a Central Processing Unit (CPU), a controller, a microcontroller, a microprocessor or other data Processing chips, and is configured to run program codes stored in the memory 10 or process data, for example, execute an access restriction program.
It should be noted that the configuration shown in fig. 4 does not constitute a limitation of the computer device, and in other embodiments, the computer device may include fewer or more components than those shown, or some components may be combined, or a different arrangement of components may be used.
An embodiment of the present invention further provides a readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the task scheduling method as described above.
Those of skill in the art will understand that the logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be viewed as implementing logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, various steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or combination of the following technologies, which are well known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
In the description of the specification, reference to the description of "one embodiment," "some embodiments," "an example," "a specific example," or "some examples" or the like means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present invention. It should be noted that various changes and modifications can be made by those skilled in the art without departing from the spirit of the invention, and these changes and modifications are all within the scope of the invention. Therefore, the protection scope of the present patent should be subject to the appended claims.

Claims (10)

1. A method for task scheduling, the method comprising:
acquiring a work task, and decomposing the work task into sub-work tasks of different levels through a quantitative index and an analysis model;
distributing each sub-work task to a corresponding processing node and a corresponding matching node so that the processing node and the matching node cooperate to process the corresponding sub-work task;
acquiring progress information of the sub-work tasks and generating a task progress analysis report according to the progress information, wherein the task progress analysis report comprises evidence materials, collaborative data and effect evaluation;
and inputting the task progress analysis report into an archive database for storage, and finishing archiving the task progress analysis report.
2. The task scheduling method according to claim 1, wherein the step of obtaining the work task and decomposing the work task into sub-work tasks of different levels through a quantitative index and an analysis model comprises:
acquiring the work tasks, and dividing the work tasks into a plurality of task sets through a quantization index;
analyzing the plurality of task sets through an analysis model to obtain the workload of the plurality of task sets;
dividing the work tasks into different levels according to the work gauges of a plurality of the task sets.
3. The task scheduling method according to claim 1, wherein after the step of obtaining the work task and decomposing the work task into sub-work tasks of different levels by means of a quantitative index and an analytical model, the method further comprises:
and inquiring the corresponding processing nodes according to the sub-work tasks of different grades, and inquiring the matching nodes corresponding to the processing nodes.
4. The task scheduling method according to claim 1, wherein after the steps of obtaining the progress information of the sub-job task and generating a task progress analysis report according to the progress information, the task progress analysis report includes corroborative materials, collaborative data, and performance evaluation, the method further comprises:
summarizing the progress information to obtain a task work ledger;
and identifying the progress information of each processing node and the corresponding matching node based on the task work ledger.
5. The task scheduling method according to claim 1, wherein after the step of inputting the task progress analysis report into an archive database for storage and completing archiving of the task progress analysis report, the method further comprises:
and regularly performing structured carding on the task progress analysis reports in the archive database to obtain independent analysis reports of each processing node.
6. A task scheduling system, the system comprising:
the system comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring a work task and decomposing the work task into sub-work tasks of different grades through a quantitative index and an analysis model;
the distribution module is used for distributing each sub-work task to a corresponding processing node and a corresponding coordination node so as to enable the processing node and the coordination node to cooperatively process the corresponding sub-work task;
the second acquisition module is used for acquiring progress information of the sub-work tasks and generating a task progress analysis report according to the progress information, wherein the task progress analysis report comprises evidence materials, collaborative data and effect evaluation;
and the filing module is used for inputting the task progress analysis report into a file database for storage and finishing the filing of the task progress analysis report.
7. The task scheduling system of claim 6, wherein the first obtaining module comprises:
the acquisition unit is used for acquiring the work task and dividing the work task into a plurality of task sets through a quantization index;
the analysis unit is used for analyzing the task sets through an analysis model to obtain the workload of the task sets;
and the planning unit is used for planning the sub-work tasks in different levels according to the work gauges of the plurality of task sets.
8. The task scheduling system of claim 6 wherein the system further comprises:
the query module is used for querying the corresponding processing nodes according to the sub-work tasks of different grades and querying the matching nodes corresponding to the processing nodes;
the summarizing module is used for summarizing the progress information to obtain a task work ledger;
the identification module is used for identifying the progress information of each processing node and the corresponding matching node based on the task work ledger;
and the carding module is used for regularly carrying out structured carding on the task progress analysis report in the archive database so as to obtain an independent analysis report of each processing node.
9. A readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out a method for task scheduling according to any one of claims 1 to 5.
10. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the task scheduling method according to any of claims 1 to 5 when executing the computer program.
CN202211674029.9A 2022-12-26 2022-12-26 Task scheduling method, system, readable storage medium and computer equipment Pending CN115880116A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211674029.9A CN115880116A (en) 2022-12-26 2022-12-26 Task scheduling method, system, readable storage medium and computer equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211674029.9A CN115880116A (en) 2022-12-26 2022-12-26 Task scheduling method, system, readable storage medium and computer equipment

Publications (1)

Publication Number Publication Date
CN115880116A true CN115880116A (en) 2023-03-31

Family

ID=85754570

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211674029.9A Pending CN115880116A (en) 2022-12-26 2022-12-26 Task scheduling method, system, readable storage medium and computer equipment

Country Status (1)

Country Link
CN (1) CN115880116A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116681408A (en) * 2023-08-03 2023-09-01 太平金融科技服务(上海)有限公司 System management method, device, computer equipment and storage medium

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116681408A (en) * 2023-08-03 2023-09-01 太平金融科技服务(上海)有限公司 System management method, device, computer equipment and storage medium
CN116681408B (en) * 2023-08-03 2023-11-24 太平金融科技服务(上海)有限公司 System management method, device, computer equipment and storage medium

Similar Documents

Publication Publication Date Title
CN112100219B (en) Report generation method, device, equipment and medium based on database query processing
CN106530121B (en) Method and system for detecting safety protection compliance of power monitoring system
CN111383130A (en) Full life cycle management and control platform, mobile operation and maintenance client and terminal
CN111400288A (en) Data quality inspection method and system
CN115880116A (en) Task scheduling method, system, readable storage medium and computer equipment
CN113656245A (en) Data inspection method and device, storage medium and processor
Meincheim et al. Combining process mining with trace clustering: manufacturing shop floor process-an applied case
CN112668314A (en) Data standard conformance detection method, device, system and storage medium
CN109597702B (en) Root cause analysis method, device, equipment and storage medium for message bus abnormity
CN116579671A (en) Performance assessment method, system, terminal and storage medium for automatically matching indexes
CN111260155A (en) Grain processing procedure optimization method and device, electronic equipment and storage medium
CN109033196A (en) A kind of distributed data scheduling system and method
CN115907649A (en) Gridding government affair data management system
US9239867B2 (en) System and method for fast identification of variable roles during initial data exploration
CN114490590A (en) Data warehouse quality evaluation method and device, electronic equipment and storage medium
CN113780673A (en) Training method and device of job leaving prediction model and job leaving prediction method and device
CN113535575A (en) Benchmark testing method and device for basic environment of software and hardware product
CN112559645A (en) Processing method and device for mass operation and maintenance data
CN112667469A (en) Method, system and readable medium for automatically generating diversified big data statistical report
Ribeiro et al. Improving productive processes using a process mining approach
CN112925856B (en) Entity relationship analysis method, entity relationship analysis device, entity relationship analysis equipment and computer storage medium
CN109697599B (en) System and method for driving flow
CN112148459B (en) Processing method, device, readable medium and equipment for node association data
CN116860754A (en) Report data processing method and device, electronic equipment and storage medium
CN106845762B (en) Data management system, method and device based on data analysis

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