WO2020024862A1

WO2020024862A1 - Method and apparatus for daily task management, storage medium, and terminal

Info

Publication number: WO2020024862A1
Application number: PCT/CN2019/097558
Authority: WO
Inventors: 彭飞
Original assignee: 奇酷互联网络科技（深圳）有限公司
Priority date: 2018-08-01
Filing date: 2019-07-24
Publication date: 2020-02-06
Also published as: CN109214771A

Abstract

The present invention relates to the technical field of software, and provides a method and an apparatus for daily task management, a storage medium, and a terminal. The method for daily task management comprise: obtaining task content of all tasks to form a current task pool, acquiring a task emergency level and a task deadline of each task in the current task pool, and performing ordering according to the task deadline corresponding to each task; and if the deadlines of two or more tasks in the current task pool are the same, performing reordering according to the task emergency level corresponding to each task, and pushing the ordering result. In this way, the tasks are ordered according to processing emergency levels, i.e., according to the ordering result, a user is always processing a task to be primarily completed currently, thereby avoiding missing tasks due to overdue and enabling the task management to be clearer.

Description

Method, equipment, storage medium and terminal for daily task management

[Technical Field]

The present invention relates to the field of software technology, and in particular, to a method, a device, a storage medium, and a terminal for daily task management.

【Background technique】

At present, in the existing task management methods, the task arrangement order is usually based on the task creation time, that is, in a day, each task is sorted according to the time when it was created, that is, the earlier the task is created, the higher the order, for example , The user creates a regular meeting task at 9 am, a reply mail task at 9:30, and so on. However, this task management method cannot intelligently sort tasks according to the urgency of each task, resulting in problems such as missing tasks and confusing task management. Therefore, there is an urgent need to solve the problems of missing tasks and confusing task management caused by current task management methods that cannot be sorted according to the urgency of various tasks.

[Summary of the Invention]

The purpose of the present invention is to provide a method for daily task management, which aims to solve the problems of missing tasks and confusing task management caused by the existing task management methods that cannot be sorted according to the urgency of various tasks.

To achieve the above objective, the technical solution adopted by the present invention is: the first aspect, a method for daily task management, the method includes:

Obtain the task content of all tasks to form a current task pool, obtain the task emergency level and task deadline of each task in the current task pool, and sort according to the distance of the task deadline corresponding to each task;

If the task deadlines of two or more tasks in the current task pool are the same, re-rank the tasks according to the task emergency level corresponding to each task, and push the ranking results;

Wherein, the task emergency level is a ratio of an absolute value of a difference between a current starting time and a deadline of the task to a time required for the task, and the greater of the absolute value of the difference and the time required for the task As a numerator, the task deadline is the time node at which the task should be completed, and the current starting time is the start time node of each task.

Further, after the step of pushing the sorting result, the method further includes:

Whenever the current time node coincides with the task deadline of the first task in the current task pool, highlight the first task and prompt whether to execute the next task;

If the task is executed, recalculate the task emergency level corresponding to the remaining tasks in the current task pool, and highlight the task with the highest task emergency level, and prompt whether to perform it preferentially;

If the execution of the next task is abandoned, the first task continues to be executed, and the deadline of the task of the first task is extended until the current time node coincides with the extended deadline of the task.

Further, after extending the task deadline of the first task until the current time node coincides with the delayed task deadline, the method further includes:

Obtain the task termination deadline of the first task, and when the current time node coincides with the corresponding task termination deadline of the first task, transfer the first task to the termination task pool and become the first termination task;

The task termination period is a time node at which the first task is terminated.

Further, after the step of transferring the first task to a termination task pool and becoming the first task to terminate, the method further includes:

Obtaining the task restart deadline of the first terminated task, and prompting whether to transfer the first terminated task to the current task pool when the current time node coincides with the corresponding task restart deadline of the first task;

If the first terminated task is transferred to the current task pool, re-obtaining the corresponding task emergency level and task deadline;

If abandoning the first terminated task to the current task pool, delete the first terminated task;

The task restart period is the first time node to terminate the task and re-enable it.

Further, the method further includes:

Obtain the current end time and the task importance level of each task in the current task pool, highlight the task with the highest task importance level between the current start time and the current end time, and prompt whether or not Priority execution

The current end time is the end time node of each task.

Further, the method further includes:

Obtain the task emergency level and task deadline of each newly added task, reorder each newly added task and each task in the current task pool, and highlight in accordance with the sequence of each newly added task, and Prompt whether to execute one by one;

If each of the newly added tasks is executed preferentially, reordering the remaining tasks in the current task pool after each of the newly added tasks is completed;

If abandoning the execution of each of the newly added tasks first, the tasks in the current task pool are processed in the order of reordering.

Further, the method further includes:

Acquiring the task dependency level of each task in the current task pool, ranking and highlighting each task in the sorting result in the current task pool according to the size of the task dependency level, and prompting whether to perform the priority one by one;

The task dependency level is the number of people who depend on others to complete the task.

Beneficial effects of the present invention: The method, device, storage medium and terminal for daily task management of the present invention summarize the tasks that need to be sorted to form a current task pool, and each task in the current task pool is first terminated according to its corresponding task Sorting deadlines. Secondly, in tasks with the same deadline, they are sorted according to the task's emergency level. Finally, the sorting results are pushed. In this way, the tasks are sorted according to the urgency to be processed. , The user is always dealing with the task that is currently completed first, thereby avoiding the task being missed due to overdue, and the task management is more clear.

In a second aspect, the present invention also provides a device for daily task management, the device includes:

A sorting module, configured to obtain the task content of all tasks to form a current task pool, obtain the task emergency level and task deadline of each task in the current task pool, and sort according to the distance of the task deadline corresponding to each task ;

A push module is used to push the sorted results.

Further, the device further includes:

A first prompting module is configured to highlight the first task whenever the current time node coincides with the task deadline of the first task in the current task pool, and prompt whether to execute the next task.

Further, the device further includes:

A second prompting module, configured to obtain the task termination deadline of the first task, and when the current time node coincides with the corresponding task termination deadline of the first task, transfer the first task to the termination task pool, and Be the first to terminate the mission.

Further, the device further includes:

A third prompting module is configured to obtain the task restart deadline of the first terminated task, and when the current time node coincides with the corresponding task restart deadline of the first task, prompt whether to transfer the first terminated task to the task. In the current task pool;

Further, the device further includes:

A fourth prompt module is used to obtain the current end time and the task importance level of each task in the current task pool, which will be between the current start time and the current end time and has the highest task importance level. The task is highlighted and prompted to give priority to execution.

Further, the device further includes:

A fifth prompt module is used to obtain the task emergency level and task deadline of each newly added task, reorder each newly added task and each task in the current task pool, and, according to each of the newly added tasks, The sequence is highlighted, and one by one is prompted whether to execute in priority.

Further, the device further includes:

A sixth prompting module is configured to obtain a task dependency level of each task in the current task pool, and to rank and highlight each task in the ranking result in the current task pool according to the size of the task dependency level, and prompt one by one Whether to execute first.

According to a third aspect, the present invention also provides a storage medium on which a computer program is stored. When the computer program is executed by a processor, the steps of the foregoing method are implemented.

According to a fourth aspect, the present invention further provides a terminal, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, the method for implementing the method described above is implemented. step.

[Brief Description of the Drawings]

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings used in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings in the following description are only the present invention. For some embodiments, for those of ordinary skill in the art, other drawings can be obtained according to these drawings without paying creative labor.

FIG. 1 is a flowchart of a method for daily task management provided by Embodiment 1 of the present invention;

2 is a flowchart of a method for daily task management provided by Embodiment 2 of the present invention;

3 is a specific flowchart of a method for daily task management provided by Embodiment 2 of the present invention;

4 is a flowchart of a method for daily task management provided by Embodiment 3 of the present invention;

5 is a flowchart of a method for daily task management provided by Embodiment 4 of the present invention;

6 is a flowchart of a method for daily task management provided by Embodiment 5 of the present invention;

7 is a schematic structural diagram of a daily task management device according to an embodiment of the present invention;

FIG. 8 is another schematic structural diagram of a daily task management device according to an embodiment of the present invention.

【detailed description】

Hereinafter, embodiments of the present invention will be described in detail. Examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals represent the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the drawings are exemplary and are intended to explain the present invention, but should not be construed as limiting the present invention.

An embodiment of the present invention provides a method for daily task management that sorts daily tasks according to their urgency and ensures that daily tasks are performed in an orderly manner to avoid missing or expired tasks. This daily task management method can help users plan daily trips and avoid task backlogs.

FIG. 1 is a flowchart of a method for daily task management provided in Embodiment 1 of the present invention. As shown in FIG. 1, the method in this embodiment includes the following steps:

Step S100: Obtain the task content of all tasks to form the current task pool, obtain the task emergency level and task deadline of each task in the current task pool, and sort according to the distance of the task deadline corresponding to each task;

The task urgency level is the ratio of the absolute value of the difference between the current starting time and the deadline of the task to the time required by the task, and the larger of the absolute value of the difference and the time required by the task is taken as the numerator, and the task deadline is the task The time node that should be completed. The current starting time is the start time node of each task. For example, the current starting time is 8 am, the deadline for a task is 10 am, and the time required for the task is one and a half hours. Then, the task's emergency level is 1.333, and, The closer the ratio is to the value 1, the higher the task emergency level.

In step S101, if the deadlines of two or more tasks in the current task pool are the same, the tasks are re-ranked by the level of the task emergency level corresponding to each task, and the ranking results are pushed.

Understandably, when various tasks need to be sorted, the task deadline of each task is considered first to avoid task overdue, and the second is based on the task emergency level of each task when the task deadline is the same. Sort again, so that you can deal with tasks that are more urgent in time, and avoid confusion between the completion of each task.

In the method for daily task management provided by the embodiment of the present invention, the tasks to be sorted are summarized to form a current task pool. Each task in the current task pool is first sorted according to its corresponding task deadline, and second, the task deadline is the same The tasks are sorted according to the task's urgency level, and finally, the sorting results are pushed. In this way, each task is sorted according to the urgency to be processed, that is, according to the sorting result, the user is always processing the currently completed task. , Thus avoiding missing tasks due to overdue and clearer task management.

FIG. 2 is a flowchart of a method for daily task management provided by Embodiment 2 of the present invention. The difference from the above embodiment is that the second embodiment describes how to operate when there is a task overdue in daily task management. As shown in FIG. 2, the steps of the method include:

Step S200: Obtain the task content of all tasks to form the current task pool, obtain the task emergency level and task deadline of each task in the current task pool, and sort according to the distance of the task deadline corresponding to each task;

In step S201, if the deadlines of two or more tasks in the current task pool are the same, the tasks are re-ranked according to the task emergency level of each task, and the ranking results are pushed;

Step S202: When the current time node coincides with the task deadline of the first task in the current task pool, highlight the first task and prompt whether to execute the next task;

Understandably, the first task is the task with the highest ranking position in the current task pool. After pushing the sorting result, each task is processed in order from front to back. The task deadline can be the actual deadline node at which the task should be completed, or the estimated deadline node at which the task should be completed. For example, the task deadline of the task is assumed by the user and can be completed at the time node, that is, such task deadline can be extended as needed. Therefore, with the gradual loss of task processing time, whenever the current time node coincides with the task deadline of the first task in the current task pool, that is, when the task reaches the deadline that should be completed, the user is prompted by a prominent way, for example, The title of this task is darkened to distinguish it from the titles of other tasks to achieve the prompt effect.

In step S2021, if the task is executed, the task emergency levels corresponding to the remaining tasks in the current task pool are recalculated, and the task with the highest task emergency level is highlighted, and it is prompted whether to perform the task in priority;

Understandably, the current starting time changes with the progress of the task process. Therefore, whenever a task is completed, the task level of the remaining tasks in the current task pool also changes accordingly. At this time, the task with the highest task emergency level is highlighted, for example, the task title is darkened in color, or it is distinguished with other colors to remind the user whether priority processing is required. In this way, if the user is given a judgment time, if the task with the highest task emergency level is given priority to be executed, then the processing is continued according to the sorting result pushed in step S201.

In step S2022, if the execution of the next task is abandoned, the first task continues to be executed, and the deadline of the task of the first task is extended until the current time node coincides with the postponed task deadline.

Understandably, when the first task cannot be completed within the deadline of the first task, its task deadline is postponed, and its secondary task deadline can be set according to custom settings until the current time node coincides with the postponed task deadline That is, the first task was processed twice.

It should be noted that there is no sequence between step S2021 and step S2022.

FIG. 3 is a specific flowchart of a method for daily task management provided in Embodiment 2 of the present invention. As shown in FIG. 3, a specific example is provided. After the above step 2022, the method further includes the following sub-steps:

Step S2023: Obtain the task termination deadline of the first task. When the current time node coincides with the corresponding task termination deadline of the first task, transfer the first task to the termination task pool and become the first termination task;

Understandably, the task termination period is the time node at which the first task ends. Some tasks were found to be impossible to complete after extending their deadlines. In this way, the task was considered impossible. In order to avoid delays in the deadline of its tasks, and to disrupt the order of the remaining tasks. Then, when the current time node coincides with the postponed deadline of the postponed task, the task termination deadline of the first task is obtained, the first task has not been completed within the task termination deadline, and the first task is transferred from the current task pool to termination In the task pool, do termination processing. At the same time, the next task is performed according to the sorted results.

Step S2024: Obtain the task restart deadline of the first terminated task. When the current time node coincides with the corresponding task restart deadline of the first task, prompt whether to transfer the first terminated task to the current task pool;

Understandably, the task restart period is the first time node to terminate the task and re-enable it. Sometimes, the task is put on hold or terminated in the middle of processing. If the time is not processed, the user will most likely forget the task. Therefore, in order to avoid the above situation. When a task is transferred to the terminated task pool, its task restart period starts. Preferably, it can be set to start the countdown of the task restart period as soon as the task is transferred to the terminated task pool. When the coincidence occurs, the user is prompted whether to transfer the task from the terminated task pool. For example, the user can be prompted whether to transfer the task to the current task pool through a prompt sound combined with interface switching.

Step S2025, if the first terminated task is transferred to the current task pool, the corresponding task emergency level and task deadline are re-obtained;

When the task is relocated to the current task pool, in order to avoid conflicts with other tasks and the urgency of the task being processed, it is necessary to re-acquire its task emergency level and task deadline, that is, restore the task to sorting Results.

In step S2026, if the first termination task is abandoned and transferred to the current task pool, the first termination task is deleted.

For example, at 8 AM, the task deadline of the first task is set to 10 AM. When the time reaches 10 AM, if the user chooses to continue to execute the first task, the task deadline is extended to 12 PM. When the time comes to 12 o'clock, the first task is still not completed, then set its task termination period to 5 pm, if the first task is still not completed at 5 pm, the first task is transferred to the termination task pool. However, in order to prevent the first task from being forgotten by the user, the task restart period of the first task can be set to 8 am the next day, that is, at 8 am the next day, and the user is prompted again whether the task needs to be re-enabled. If it needs to be re-enabled, the task deadline and task urgency level of the task are obtained again, and they are sorted in the current task pool of the day.

FIG. 4 is a flowchart of a method for daily task management provided by Embodiment 3 of the present invention. The difference from the first embodiment described above is that the third embodiment describes how to perform operations when tasks need to be prioritized in daily task management. As shown in FIG. 4, the steps of the method include:

Step S300: Obtain the task content of all tasks to form the current task pool, obtain the task emergency level and task deadline of each task in the current task pool, and sort according to the distance of the task deadline corresponding to each task;

In step S301, if the deadlines of two or more tasks in the current task pool are the same, the tasks are re-ranked according to the emergency level of each task, and the ranking results are pushed;

Step S302: Obtain the current end time and the task importance level of each task in the current task pool, highlight the task with the highest task importance level between the current start time and the current end time, and prompt whether to execute it preferentially;

Understandably, the current end time is the end time node of each task. When there are multiple tasks to be processed in a day's working time, there must be tasks that need to be focused on. However, because their task deadlines are after the task deadlines of other tasks, they may be overdue in accordance with the normal processing order. , Then you need to prioritize the task.

For example, set the current start time to 8 am and the current end time to 16 pm. During this time period, there are three tasks A, B, and C. The task deadline of task A is 9 am, and the task requires The time is 0.75 hours, the deadline for the B task is 11 am, the time required for the task is 2 hours, the deadline for the task C is 16 pm, and the time required for the task is 3 hours. According to calculations, the ranking results of the three tasks are A, B, and C. However, as the C task with the lowest task emergency level, the user needs to prioritize for some reason, and the priority level of the task can be increased. In the interval of 16:00 pm, task C has the highest task importance level, and the user is prompted to indicate whether to give priority to processing.

FIG. 5 is a flowchart of a method for daily task management provided by Embodiment 4 of the present invention. The difference from the first embodiment is that the fourth embodiment describes how to operate the newly added task in the daily task management. As shown in FIG. 5, the steps of the method include:

Step S400: Obtain the task content of all tasks to form the current task pool, obtain the task emergency level and task deadline of each task in the current task pool, and sort according to the distance of the task deadline corresponding to each task;

In step S401, if the deadlines of two or more tasks in the current task pool are the same, the tasks are re-ranked according to the emergency level of each task, and the ranking results are pushed;

Step S402: Obtain the task emergency level and task deadline of each newly added task, reorder each newly added task and each task in the current task pool, and highlight the new tasks according to the sequence of the newly added tasks, and one by one. Prompt whether to execute first;

Understandably, there are also priorities for each new task. Sometimes, new tasks must be processed immediately, and sometimes, they can be processed sequentially according to the sorted results. Therefore, when new tasks are added, the new tasks will be processed first. For example, the new task is replying to an email. It takes less than five minutes to reply to the email, but it must be processed immediately.

In step S4021, if each newly added task is executed preferentially, the remaining tasks in the current task pool are reordered after each newly added task is completed;

In step S4022, if the newly added tasks are abandoned for priority execution, each task in the current task pool is processed in the order of reordering.

FIG. 6 is a flowchart of a method for daily task management provided by Embodiment 5 of the present invention. The difference from the first embodiment described above is that the fifth embodiment describes how to perform operations when there are tasks that need to be relied on by others in daily task management. As shown in FIG. 6, the steps of the method include:

Step S500: Obtain the task content of all tasks to form the current task pool, obtain the task emergency level and task deadline of each task in the current task pool, and sort according to the distance of the task deadline corresponding to each task;

In step S501, if the deadlines of two or more tasks in the current task pool are the same, the tasks are re-ranked according to the task emergency level of each task, and the ranking results are pushed;

Step S502: Obtain the task dependency level of each task in the current task pool, and rank each task in the current task pool according to the magnitude of the task dependency level, and prompt whether to execute the task one by one;

The task dependency level is the number of people who depend on others to complete the task. Understandably, the more people depend on others, the more difficult this task becomes. This kind of task should be monitored in real time to avoid overdue.

Step S503, if priority execution is performed, a task reminder period is obtained, and the task reminder period is counted down after the current priority task is transferred to the dependent person, and is prompted after the task reminder period ends, and the task reminder period is started cyclically after the prompt Until the current priority task returns to the current task pool of the dependent person.

The task prompt period is the time period after the current priority task is transferred to the dependent person. For the dependent task, according to the dependent object, it can be divided into dependent task and dependent task. Dependent tasks are tasks that you need to rely on to assist others. The person who handles the dependent tasks is the dependent person. Dependent tasks refer to tasks that others need to rely on your assistance to complete. The person who handles the dependent tasks is the dependent. After the current priority task is transferred to the dependent person, the remaining tasks in the current task pool can be processed, and with the help of the task prompt cycle, the completion progress of the current priority task can be monitored in real time.

FIG. 7 is a schematic structural diagram of a daily task management device according to an embodiment of the present invention. As shown in FIG. 7, the daily task management device in this embodiment includes a sorting module 1 and a push module 2.

Sorting module 1 is used to obtain the task content of all tasks to form the current task pool, obtain the task emergency level and task deadline of each task in the current task pool, and sort according to the distance of the task deadline corresponding to each task;

A push module 2 is used to push the sorted results.

FIG. 8 is another schematic structural diagram of a daily task management device according to an embodiment of the present invention. As shown in FIG. 8, the daily task management device of this embodiment further includes a first prompt module 31, a second prompt module 32, Three prompting modules 33, fourth prompting module 34, fifth prompting module 35, and sixth prompting module 36.

A first prompting module 31 is configured to highlight the first task whenever the current time node coincides with the task deadline of the first task in the current task pool, and prompt whether to execute the next task.

The second prompting module 32 is configured to obtain the task termination deadline of the first task. When the current time node coincides with the corresponding task termination deadline of the first task, the first task is transferred to the termination task pool and becomes the first termination task.

The third prompting module 33 is configured to obtain the task restart deadline of the first terminated task. When the current time node coincides with the corresponding task restart deadline of the first task, prompt whether to transfer the first terminated task to the current task pool;

The fourth prompt module 34 is used to obtain the current end time and the task importance level of each task in the current task pool. The task having the highest task importance level between the current start time and the current end time is highlighted, and it is prompted whether or not Priority execution.

A fifth prompt module 35 is used to obtain the task emergency level and task deadline of each newly added task, reorder each newly added task and each task in the current task pool, and highlight the new tasks in the order of each new task. , And prompt one by one whether to execute first.

A sixth prompting module 36 is configured to obtain the task dependency level of each task in the current task pool, rank each task in the current task pool according to the size of the task dependency level, and prompt whether to execute the task one by one.

In addition, an embodiment of the present invention further provides a readable storage medium on which computer instructions are stored. When the instructions are executed by a processor, the steps of the management methods of the foregoing embodiments are implemented.

In addition, in addition, an embodiment of the present invention further provides a terminal, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, the management method of the foregoing embodiments is implemented. step.

Logic and / or steps represented in a flowchart or otherwise described herein, for example, a sequenced list of executable instructions that may be considered to implement a logical function, may be embodied in any computer-readable medium, For use by, or in combination with, an instruction execution system, device, or device (such as a computer-based system, a system that includes a processor, or another system that can fetch and execute instructions from an instruction execution system, device, or device) Or equipment. For the purposes of this specification, a "computer-readable medium" may be any device that can contain, store, communicate, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device.

More specific examples (non-exhaustive list) of computer-readable media include the following: electrical connections (electronic devices) with one or more wirings, portable computer disk cartridges (magnetic devices), random access memory (RAM), Read-only memory (ROM), erasable and editable read-only memory (EPROM or flash memory), fiber optic devices, and portable optical disk read-only memory (CDROM). In addition, the computer-readable medium may even be paper or other suitable medium on which the program can be printed, for example, by optically scanning the paper or other medium, followed by editing, interpretation, or other suitable means if necessary Process to obtain the program electronically and then store it in computer memory.

It should be understood that each part of the present invention may be implemented by hardware, software, firmware, or a combination thereof. In the above embodiments, multiple steps or methods may be implemented by 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, it may be implemented using any one or a combination of the following techniques known in the art: Discrete logic circuits, application-specific integrated circuits with suitable combinational logic gate circuits, programmable gate arrays (PGA), field programmable gate arrays (FPGA), etc.

In the description of this specification, the description with reference to the terms “one embodiment”, “some embodiments”, “examples”, “specific examples”, or “some examples” and the like means specific features described in conjunction with the embodiments or examples , Structure, material, or characteristic is included in at least one embodiment or example of the present invention. In this specification, the schematic expressions of the above terms 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 description is only the preferred embodiments of the present invention, and is not intended to limit the present invention. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention shall be included in the protection of the present invention. Within range.

Claims

A method for daily task management, wherein the method includes:

Obtain the task content of all tasks to form a current task pool, obtain the task emergency level and task deadline of each task in the current task pool, and sort according to the distance of the task deadline corresponding to each task;

If the task deadlines of two or more tasks in the current task pool are the same, re-rank the tasks according to the task emergency level corresponding to each task, and push the ranking results;

Wherein, the task emergency level is a ratio of an absolute value of a difference between a current starting time and a deadline of the task to a time required for the task, and the greater of the absolute value of the difference and the time required for the task As a numerator, the task deadline is the time node at which the task should be completed, and the current starting time is the start time node of each task.
The method for daily task management according to claim 1, wherein after the step of pushing the sorting result, the method further comprises:

Whenever the current time node coincides with the task deadline of the first task in the current task pool, highlight the first task and prompt whether to execute the next task;

If the task is executed, recalculate the task emergency level corresponding to the remaining tasks in the current task pool, and highlight the task with the highest task emergency level, and prompt whether to perform it preferentially;

If the execution of the next task is abandoned, the first task continues to be executed, and the deadline of the task of the first task is extended until the current time node coincides with the extended deadline of the task.
The method for daily task management according to claim 2, wherein the method extends the task deadline of the first task until after a step in which a current time node coincides with the extended task deadline. Also includes:

Obtain the task termination deadline of the first task, and when the current time node coincides with the corresponding task termination deadline of the first task, transfer the first task to the termination task pool and become the first termination task;

The task termination period is a time node at which the first task is terminated.
The method for daily task management according to claim 3, wherein after the step of transferring the first task to a termination task pool and becoming the first task to terminate, the method further comprises:

Obtaining the task restart deadline of the first terminated task, and prompting whether to transfer the first terminated task to the current task pool when the current time node coincides with the corresponding task restart deadline of the first task;

If the first terminated task is transferred to the current task pool, re-obtaining the corresponding task emergency level and task deadline;

If abandoning the first terminated task to the current task pool, delete the first terminated task;

The task restart period is the first time node to terminate the task and re-enable it.
The method of daily task management according to claim 1, wherein the method further comprises:

Obtain the current end time and the task importance level of each task in the current task pool, highlight the task with the highest task importance level between the current start time and the current end time, and prompt whether or not Priority execution

The current end time is the end time node of each task.
The method of daily task management according to claim 1, wherein the method further comprises:

Obtain the task emergency level and task deadline of each newly added task, reorder each newly added task and each task in the current task pool, and highlight in accordance with the sequence of each newly added task, and Prompt whether to execute one by one;

If each of the newly added tasks is executed preferentially, reordering the remaining tasks in the current task pool after each of the newly added tasks is completed;

If abandoning the execution of each of the newly added tasks first, the tasks in the current task pool are processed in the order of reordering.
The method of daily task management according to claim 1, wherein the method further comprises:

Acquiring the task dependency level of each task in the current task pool, ranking and highlighting each task in the sorting result in the current task pool according to the size of the task dependency level, and prompting whether to perform the priority one by one;

The task dependency level is the number of people who depend on others to complete the task.
A device for daily task management, wherein the device includes:

A sorting module, configured to obtain the task content of all tasks to form a current task pool, obtain the task emergency level and task deadline of each task in the current task pool, and sort according to the distance of the task deadline corresponding to each task ;

A push module is used to push the sorted results.
The device for daily task management according to claim 8, wherein the device further comprises:

The first prompt module is used to highlight the first task whenever the current time node coincides with the task deadline of the first task in the current task pool, and prompt whether to execute the next task.
The device for daily task management according to claim 8, wherein the device further comprises:

The second prompt module is used to obtain the task termination deadline of the first task. When the current time node coincides with the corresponding task termination deadline of the first task, the first task is transferred to the termination task pool and becomes the first termination task.
The device for daily task management according to claim 8, wherein the device further comprises:

The third prompt module is used to obtain the task restart deadline of the first terminated task. When the current time node coincides with the corresponding task restart deadline of the first task, it prompts whether to transfer the first terminated task to the current task pool.
The device for daily task management according to claim 8, wherein the device further comprises:

The fourth prompt module is used to obtain the current end time and the task importance level of each task in the current task pool. It will highlight the task with the highest task importance level between the current start time and the current end time, and prompt whether it has priority carried out.
The device for daily task management according to claim 8, wherein the device further comprises:

A fifth prompt module is used to obtain the task emergency level and task deadline of each newly added task, reorder each newly added task and each task in the current task pool, and highlight the new tasks in the order of the newly added tasks, And one by one whether to give priority to execution.
The device for daily task management according to claim 8, wherein the device further comprises:

A sixth prompt module is used to obtain the task dependency level of each task in the current task pool, and according to the size of the task dependency level, each task is ranked and highlighted in the ranking result of the current task pool, and one by one is prompted whether to execute first.
A storage medium having stored thereon a computer program, wherein when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.
A terminal includes a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein when the processor executes the program, the method according to any one of claims 1 to 7 is implemented A step of.