A time axis-based task management method

Abstract

The application provides a time axis-based task management method, which comprises tasks and intervals between the tasks, and comprises the following steps: obtaining a candidate interval (S1), the candidate interval being a time interval for task management; obtaining an interval list of the candidate interval (S2); calculating and outputting an insertable interval list according to a target task (S3); inserting a task (S4) or integrating the interval into the task (S5) or ending the operation (S6). The application is aimed at the problems of task overlap, poor task adjustment convenience and poor ease of use of existing time management products, and helps users to manage time in a more convenient and flexible way through the design of a time axis-based task management method.

Description

Technical Field

[0001] This invention relates to the field of time management, and more particularly to a timeline-based task management method. Background Technology

[0002] Current time management products mainly focus on task setting and timed reminders, which fails to meet user needs.

[0003] Patent CN107230042A discloses a time management method that sends time management information and time plans from a first terminal to a second terminal. Upon completion by the second terminal, the method provides a result and awards a reward, aiming to use electronic devices to assist children in managing their time and improving time utilization. However, children have relatively weak time management skills, and rigid time management and reward mechanisms may not effectively meet their needs. In fact, low task completion rates may discourage children from receiving rewards, thus discouraging them from time management.

[0004] Patent CN107179678A discloses a smart alarm clock control system and method. It manages tasks through the linkage of a control terminal, cloud platform, and smart alarm clock, primarily combining task settings on a mobile phone with the task reminder function of the smart alarm clock, achieving complementary advantages of hardware and software. This patent mainly focuses on how to remind users of tasks, but does not provide suitable solutions for handling task execution or changes in circumstances.

[0005] Patent CN108733197A discloses a time management method and a time management terminal. The method involves the time management terminal switching to a second timing mode when triggered during task execution. The subsequent tasks are assessed based on the accumulated duration of this second timing mode, and adjustments are made to the subsequent response based on interference, demonstrating the systematic and comprehensive nature of time management. While this patent reflects a flexible approach to task management to some extent, its convenience and ease of use still need improvement for executing continuous tasks.

[0006] Furthermore, most existing time management products focus on time reminders, reminding users of tasks that need to be completed at a certain time or within a certain time period. During the task setting process, it is possible to have two or more tasks that need to be done within the same time period. Existing time management products still rely on time nodes for reminders, leaving the task to be done during overlapping periods to the user. In reality, people have limited time and energy, and it is difficult to handle multiple tasks at the same time. Sometimes, there are also unexpected events that need to be dealt with temporarily. General time management products mainly focus on task setting and reminders, and pay less attention to tracking the execution process. Modifying the task list in response to unexpected events requires a lot of time and energy, and the operation is not very convenient. Users may choose to ignore task reminders, ultimately resulting in the inability to complete tasks.

[0007] Therefore, the person skilled in the art is committed to developing a time axis-based task management method to provide a non-overlapping task-based time management mode. SUMMARY

[0008] In view of the above defects of the prior art, the technical problem to be solved by the present application is to solve the problems of task overlap, poor task adjustment convenience and poor ease of use of existing time management products. The present application provides a time axis-based task management method to help users manage time in a more convenient and flexible way.

[0009] To achieve the above-mentioned purpose, the present application provides a time axis-based task management method, including tasks and gaps between tasks, comprising the following steps:

[0010] Obtaining a candidate interval, the candidate interval being a time interval for task management; obtaining a gap list of the candidate interval; calculating and outputting an insertable gap list according to a target task; inserting a task or integrating a gap to insert a task or ending operation.

[0011] Further, obtaining a candidate interval comprises the following steps: obtaining a target task corresponding date; determining whether the target task belongs to the task of the day; if yes, taking the obtained current time as the starting point of the candidate interval; if no, taking 0 o'clock of the day as the starting point of the candidate interval; taking 24 o'clock of the target task of the day as the end point of the candidate interval.

[0012] Further, obtaining a candidate interval comprises the following steps: obtaining the attributes of the tasks in the task list; obtaining a rivet task list; grouping the rivet tasks by date and sorting them within the group; calculating the candidate intervals between the rivet tasks.

[0013] Further, after obtaining the attributes of the tasks in the task list, if there is no rivet task in the task list, the calculation is ended.

[0014] Further, calculating the candidate intervals between the rivet tasks comprises the following steps: grouping the rivet tasks by date and sorting them within the group; determining whether the task date sequence number i is greater than the number of groups, i being a positive integer starting from 1.

[0015] Further, calculating the candidate intervals between the rivet tasks further comprises the following steps: if the task date sequence number i is greater than the number of groups, deleting the candidate intervals whose end points are earlier than the current time.

[0016] Further, calculating the candidate intervals between the rivet tasks further comprises the following steps: if the task date sequence number i is less than or equal to the number of groups, further determining whether the start time of the first rivet task of the i-th day is later than 0 o'clock.

[0017] Further, the step of calculating the candidate interval between rivet tasks further comprises the following steps: if the start time of the first rivet task of the i-th day is later than 0:00, then the start time of the j-th candidate interval of the i-th day is 0:00 of the i-th day, and the end time is the start time of the j-th rivet task, j being a positive integer starting from 1; the start point of the j+1-th candidate interval of the i-th day is the end time of the j-th rivet task; and determining whether the j-th rivet task of the i-th day is the last rivet task of the i-th day.

[0018] Further, the step of calculating the candidate interval between rivet tasks further comprises the following steps: the end point of the j+1-th candidate interval of the i-th day is the start time of the j+1-th rivet task; j is assigned as j=j+1; and the start point of the j+1-th candidate interval of the i-th day is the end time of the j-th rivet task.

[0019] Further, the step of calculating the candidate interval between rivet tasks further comprises the following steps: the end point of the j+1-th candidate interval of the i-th day is 24:00 of the i-th day; i is assigned as i=i+1; and determining whether the task date sequence number i is greater than the grouping number.

[0020] Further, the step of calculating the candidate interval between rivet tasks further comprises the following steps: the start point of the j-th candidate interval of the i-th day is the end time of the j-th task; and determining whether the j-th rivet task of the i-th day is the last rivet task of the i-th day.

[0021] Further, the step of calculating the candidate interval between rivet tasks further comprises the following steps: if the j-th rivet task of the i-th day is not the last rivet task of the i-th day, then the end point of the j-th candidate interval of the i-th day is the start time of the j+1-th rivet task; j is assigned as j=j+1; the start point of the j-th candidate interval of the i-th day is repeated as the end time of the j-th task; and determining whether the j-th rivet task of the i-th day is the last rivet task of the i-th day.

[0022] Further, the step of calculating the candidate interval between rivet tasks further comprises the following steps: if the j-th rivet task of the i-th day is the last rivet task of the i-th day, then the end point of the j-th candidate interval of the i-th day is 24:00 of the i-th day; i is assigned as i=i+1; and determining whether the task date sequence number i is greater than the grouping number.

[0023] Further, the step of obtaining the candidate interval comprises the following steps: deleting a task; obtaining the attribute of the deleted task; determining whether the deleted task is the last task of the day; if yes, then determining the end; and if no, then taking the original start time of the deleted task as the start point of the candidate interval, and taking the start time of the subsequent task of the deleted task as the end point of the candidate interval.

[0024] Further, the step of obtaining the gap list of the candidate interval comprises the following steps: obtaining the gap list in the candidate interval; and outputting the gap list of the candidate interval.

[0025] Further, the step of obtaining the gap list of the candidate interval comprises the following steps: obtaining the list of periodically repeated tasks; obtaining the periodical repeated task conflict period with the target task; obtaining the periodical repeated task conflict period unit; comparing the periodical repeated task conflict period start date and end date; and outputting the conflict list, which is the non-candidate gap.

[0026] Further, the step of calculating and outputting the insertable gap list according to the target task comprises the following steps: comparing the gap length and the target task length; listing the gap whose length is greater than or equal to the target task length; and outputting the candidate interval insertable gap list.

[0027] Further, the step of calculating and outputting the insertable gap list according to the target task comprises the following steps: comparing the gap length and the target task length; listing the gap whose length is greater than or equal to the target task length; and judging whether the target task has a special attribute label.

[0028] Further, the step of calculating and outputting the insertable gap list according to the target task further comprises the following steps: if the target task has no special attribute label, outputting the insertable gap list.

[0029] Further, the step of calculating and outputting the insertable gap list according to the target task further comprises the following steps: if the target task has a special attribute label, further judging whether there is a gap directly satisfying the special attribute.

[0030] Further, the step of calculating and outputting the insertable gap list according to the target task further comprises the following steps: if there is a gap directly satisfying the special attribute, outputting the gap list directly satisfying the special attribute.

[0031] Further, the step of calculating and outputting the insertable gap list according to the target task further comprises the following steps: if there is no gap directly satisfying the special attribute, turning to the step of integrating the gap and inserting the task.

[0032] Further, the step of calculating and outputting the insertable gap list according to the target task comprises the following steps: comparing the gap length and the target task length; if there is no gap greater than or equal to the target task, turning to the step of integrating the gap and inserting the task or ending the operation.

[0033] Further, the step of integrating the gap and inserting the task comprises the following steps: outputting the gap list indirectly satisfying the special attribute; and moving the task between the target task and the appropriate gap to the appropriate gap to insert the target task.

[0034] Further, the gap-integrating and task-inserting operation comprises the following steps: taking the target task start time as the origin, and sequentially coding B1, B2,..., Bn according to the distance between the gap in the candidate interval and the origin. n n is an integer; when n is less than 1, the operation is ended.

[0035] Further, the gap-integrating and task-inserting operation further comprises the following steps: calculating the gap duration t1, t2,..., tn of the gaps B1, B2,..., Bn. n B1 B2 Bn Further judging whether the gap duration accumulation value x is greater than or equal to the target task duration.

[0036] Further, the gap-integrating and task-inserting operation further comprises the following steps: when the gap duration accumulation value x is less than the target duration, assigning n as n=n+1; judging whether n is greater than the gap number; if n is greater than the gap number, ending the operation; if n is less than or equal to the gap number, calculating the gap duration t1, t2,..., tn of the gaps B1, B2,..., Bn. n B1 B2 Bn

[0037] Further, the gap-integrating and task-inserting operation further comprises the following steps: when the gap duration accumulation value x is greater than or equal to the target duration, simulating the gap data obtained by sequentially moving the n gaps away from the origin, outputting the insertable gap list, and inserting the task.

[0038] Further, when the moved task is a periodic repeating task, the association between the moved task and the periodic repeating task group is released, and the moved task does not affect other periodic repeating tasks when moving.

[0039] Further, when the deleted task is a periodic repeating task, the one day or the whole periodic repeating task in the periodic repeating task can be deleted when the deleting operation is performed.

[0040] From the above scheme, the present application has the following advantages:

[0041] Through the time-axis-based task management method, the task is inserted and deleted in a simple and convenient manner, which conforms to the use habit of the user, improves the management efficiency of the task, and improves the convenience of task setting; the time management is performed from the task execution angle, which helps the user to improve the time management ability and refuse procrastination; the time management manner is humanized and conforms to the use habit of the user.

[0042] The concept, specific structure and generated technical effects of the present application will be further described in combination with the drawings, so as to fully understand the purpose, features and effects of the present application.​​​​​​​ BRIEF DESCRIPTION OF DRAWINGS

[0043] Figure 1 Flow chart of the whole framework of the time axis based task management method of the present application.

[0044] Figure 2 Flow chart of the process of obtaining alternative intervals S11 by date.

[0045] Figure 3 Flow chart of the process of obtaining rivet task alternative intervals S12.

[0046] Figure 4 Flow chart of the process of obtaining alternative intervals S13 for deleting tasks.

[0047] Figure 5 Flow chart of the process of obtaining gap list of alternative intervals S21.

[0048] Figure 6 Flow chart of the process of obtaining conflict list in periodic repetition category S22.

[0049] Figure 7 Flow chart of the process of calculating and outputting insertable gap list S31 according to target task when the target task has no special attribute label.

[0050] Figure 8 Flow chart of the process of calculating and outputting insertable gap list S32 according to target task when the target task has special attribute label.

[0051] Figure 9 Flow chart of the process of calculating and outputting insertable gap list S33 according to target task when there is no gap greater than target task.

[0052] Figure 10 Flow chart of the process of integrating gaps and inserting tasks S51 when there is indirect special attribute satisfying gap.

[0053] Figure 11 Flow chart of the process of integrating gaps and inserting tasks S52 when there is no special attribute satisfying gap.

[0054] Figure 12 Specific implementation schematic diagram of step S11 in embodiment one.

[0055] Figure 13 Specific implementation schematic diagram of embodiment one Figure 1 .

[0056] Figure 14 Specific implementation schematic diagram of embodiment one Figure 2 .

[0057] Figure 15 Specific implementation schematic diagram of embodiment one Figure 3 .

[0058] Figure 16 Detailed implementation for example one Figure 4 .

[0059] Figure 17 Detailed implementation for example one Figure 5

[0060] Figure 18 Detailed implementation for example one Figure 6

[0061] Figure 19 Detailed implementation for example one Figure 7

[0062] Figure 20 Detailed implementation for example one Figure 8 .

[0063] Figure 21 Detailed implementation for example one Figure 9 .

[0064] Figure 22 Detailed implementation for example one Figure 10 .

[0065] Figure 23 Detailed implementation for example two

[0066] Figure 24 Detailed implementation for example three

[0067] Figure 25 Detailed implementation for example four Figure 1 .

[0068] Figure 26 Detailed implementation for example four Figure 2 .

[0069] Figure 27 Detailed implementation for example four Figure 3 .

[0070] Figure 28 Detailed implementation for example four Figure 4 . DETAILED DESCRIPTION

[0071] The task-based time management method and time management terminal of the present application will be described in detail below in conjunction with examples.

[0072] According to the time axis-based task management method, after setting a task, a user modifies the task plan according to actual needs, such as adding a task, deleting a task, and requirements of execution time or execution sequence of a part of the task, such as watching a news broadcast and a classroom practice after a network class started at a fixed time.

[0073] As shown in the drawings, Figure 1 The time axis-based task management method generally comprises the following steps:

[0074] Step S1, obtaining a candidate interval, the candidate interval being a time interval for task management; step S2, obtaining a gap list of the candidate interval; step S3, calculating and outputting an insertable gap list according to a target task; according to actual conditions of steps S1 to S3, proceeding to step S4 to insert a task, or proceeding to step S5 to integrate a gap to insert a task, or proceeding to step S6 to end the operation.

[0075] In the present application, each step comprises multiple execution modes, and is selected and applied or jointly applied according to actual task conditions: in the mode of obtaining a candidate interval in step S1, the mode comprises a step of obtaining a candidate interval by date (hereinafter referred to as S11), a step of obtaining a candidate interval of a rivet task (hereinafter referred to as S12), and a step of obtaining a candidate interval by deleting a task (hereinafter referred to as S13), and the system selects one of S11, S12 and S13 or simultaneously applies multiple modes according to actual setting conditions. The selection conditions of other steps of multiple execution modes are similar to step S1, and are not described herein.

[0076] The rivet task has specific attribute labels, and the start time and the end time of the task are both fixed values.

[0077] The candidate interval is a time period obtained by system presetting and / or calculation for the target task to be inserted.

[0078]

Embodiment One

[0079] The inserted task contains a rivet task in the task list, and it is assumed that the current day of the operating system is January 1, 2019.

[0080] Step S1, obtaining a candidate interval, the candidate interval being a time interval for task management, specifically comprising:

[0081] As shown in the drawings, Figure 2 Step S11, obtaining a candidate interval by date:

[0082] Step S1101, obtaining target task dates of January 1, 2019 and January 2, 2019, and proceeding to step S1103; step S1103, judging whether the target task belongs to a task of the day, and judging the two dates in turn:

[0083] As shown in Figure 12 January 1, 2019 is the task of the day, then step S1105 is entered to take the current time as the start point of the candidate interval, and step S1107 is entered; step S1107 takes 24:00 of the target task of the day as the end point of the candidate interval.

[0084] January 2, 2019 is not the task of the day, then step S1109 is entered; step S1109 takes 0:00 of the day as the start point of the candidate interval, and step S1107 is entered; step S1107 takes 24:00 of the target task of the day as the end point of the candidate interval.

[0085] As shown in Figure 3 , Figure 13 , Figure 14 and Figure 15 , step S12 is to obtain the rivet task candidate interval:

[0086] Step S1201 is to obtain the attributes of the tasks in the task list, and step S1203 is entered; if there is no rivet task in the task list, step S1241 is entered, and the operation is ended.

[0087] Step S1203 is to obtain the rivet task list, as shown in Figure 13 , there are 3 rivet tasks on January 1, 2019, and 4 rivet tasks on January 2, 2019, and step S1205 is entered.

[0088] Step S1205 is to group the rivet tasks by date and sort them within the group, as shown in Figure 14 , the number of groups is 2, and they are sequentially coded as the first day and the second group. The first day includes the 1st rivet task, the 2nd rivet task, and the 3rd rivet task, and the second group includes the 1st rivet task, the 2nd rivet task, the 3rd rivet task, and the 4th rivet task. Step S1207 is entered.

[0089] Step S1207 is to determine whether the task date sequence number i is greater than the number of groups, i is a positive integer starting from 1, yes, then step S1237 is entered to delete the candidate interval whose end point is earlier than the current time; otherwise, step S1209 is entered.

[0090] Step S1209 is to determine whether the start time of the 1st rivet task of the i-th day is later than 0:00, yes, then step S1211 is entered, and no, then step S1225 is entered.

[0091] Step S1211 is to take 0:00 of the i-th day as the start time of the j-th candidate interval of the i-th day, i and j are both positive integers starting from 1, and the end time is the start time of the j-th rivet task. At this time, i = 1 and j = 1, the first candidate interval obtained is from 0:00 on January 1, 2019 to the start time of the 1st rivet task, and step S1213 is entered.

[0092] Step S1213, the start time of the (j+1)th candidate interval of the ith day is the end time of the jth rivet task, i.e. the start time of the 2nd candidate interval of the first day is the end time of the 2nd rivet task, and then go to step S1215.

[0093] Step S1215, determine whether the jth rivet task of the ith day is the last rivet task of the ith day. If yes, go to step S1221; if no, go to step S1217.

[0094] Step S1217, the end time of the (j+1)th candidate interval of the ith day is the start time of the (j+1)th rivet task, i.e. the end time of the 2nd candidate interval of the first day is the start time of the 3rd rivet task, and then go to step S1219.

[0095] Step S1219, assign j as j=j+1, i.e. j=2 at this time, and then go to step S1213.

[0096] Step S1213, i=1, j=2, the start time of the 3rd candidate interval is the end time of the 2nd rivet task, and then go to step S1215. The 2nd rivet task is not the last rivet task of the first day, and then go to step S1217. The end time of the 3rd candidate interval of the first day is the start time of the 3rd rivet task, and then go to step S1219. Assign j as j=j+1, i.e. j=3 at this time, and then go to step S1213.

[0097] Step S1213, the start time of the 4th candidate interval of the first day is the end time of the 3rd rivet task, and then go to step S1215. The 3rd rivet task is the last rivet task of the first day, and then go to step S1221.

[0098] Step S1221, the end time of the (j+1)th candidate interval of the ith day is 24:00 of the ith day, i.e. the end time of the 4th candidate interval of the first day is 24:00 of the first day, and then go to step S1223.

[0099] Step S1223, assign i as i=i+1, i.e. i=2 at this time, and then go to step S1207.

[0100] Step S1207, determine whether i is greater than the date grouping number. i=2, which is not greater than the date grouping number, and then go to step S1209.

[0101] Step S1209, determine whether the start time of the jth rivet task of the ith day is later than 0:00. As shown in the table, i=2, j=1, the start time of the 1st rivet task of the second day is equal to 0:00, and then go to step S1225. Figure 14

[0102] ​Step S1225, the start time of the jth candidate interval of the ith day is the end time of the jth rivet task, i=2, j=1, that is, the start time of the 1st candidate interval of the second day is the end time of the 1st rivet task, and the process goes to step S1227.

[0103] Step S1227, it is judged whether the jth rivet task of the ith day is the last rivet task of the ith day. If yes, the process goes to step S1233. If no, the process goes to step S1229.

[0104] Step S1229, the end time of the jth candidate interval of the ith day is the start time of the j+1th rivet task, i=2, j=1, that is, the end time of the 1st candidate interval of the second day is the start time of the 2nd rivet task, and the process goes to step S1231.

[0105] Step S1231, j is assigned as j=j+1, that is, j=2, and the process goes to step S1225. The process repeats the cycle of steps S1225 to S1227 to S1229 to S1231, and the 2nd candidate interval and the 3rd candidate interval are obtained as shown in Figure 15 When j=4, the process goes to step S1225, and the start time of the 4th candidate interval of the second day is the end time of the 4th rivet task, and the process goes to step S1233.

[0106] Step S1233, the end time of the 4th candidate interval of the second day is 24:00 of the second day, and the process goes to step S1235.

[0107] Step S1235, i is assigned as i=i+1, that is, i=3 at this time, and the process goes to step S1207.

[0108] Step S1207, it is judged whether the task date sequence number i is greater than the grouping number. At this time, i=3, i>2 (grouping number), and the process goes to step S1237.

[0109] Step S1237, the candidate interval with an end time earlier than the current time is deleted.

[0110] The intersection of the candidate intervals obtained in steps S11 and S12 is taken, and after the candidate interval is obtained, the process goes to step S2.

[0111] Step S2, the gap list of the candidate interval is obtained, and the gap list specifically includes: Figure 5

[0112] Step S2101, the gap list in the candidate interval is obtained, and the process goes to step S2103; step S2103, the gap list of the candidate interval is output.

[0113] In combination with the embodiment, the output result is shown in Figure 15 and Figure 16 , and the process goes to step S3. ​

[0114] Step S3, calculating and outputting the insertable gap list according to the target task, for the target task without special attribute label and with insertable gap, as shown in Figure 7 and Figure 17 , specifically comprising:

[0115] Step S3101, comparing the gap duration with the target task duration, sequentially comparing the first gap to the fourth gap with the target task duration, and turning to step S3101; step S3103, listing the gap whose duration is greater than or equal to the target task duration, the third gap duration being greater than or equal to the target task duration, and turning to step S3105; step S3105, outputting the insertable gap list of the candidate interval, as shown in Figure 17 , the first day's insertable gap list being represented by the middle line dotted frame, and turning to step S4.

[0116] Step S4, inserting the task. As shown in Figure 18 , in this embodiment, the target task of the first day is inserted into the third gap of the first day.

[0117] Step S3, calculating and outputting the insertable gap list according to the target task, for the target task without gap greater than or equal to the target task duration, as shown in Figure 9 and Figure 19 , specifically comprising:

[0118] Step S3301, comparing the gap duration with the target task duration, as shown in Figure 19 , sequentially comparing the first gap to the seventh gap with the target task duration, and turning to step S3303.

[0119] Step S3303, no gap greater than or equal to the target task, turning to step S5, integrating the gap, inserting the task, or turning to step S6 to end the operation.

[0120] In this embodiment, there is no gap indirectly satisfying the special attribute, and the gap indirectly satisfying the special attribute is the gap whose duration is greater than or equal to the target task, but the gap time does not satisfy the special attribute requirement of the target task.

[0121] Step S5, integrating the gap and inserting the task, as shown in Figure 11 , specifically comprising:

[0122] Step S5201, taking the target task start time as the origin, and sequentially coding B1, B2……B n , n being an integer, turning to step S5203 when n is greater than or equal to 1, and turning to step S5213 when n is less than 1. As shown in Figure 19As shown, the target task has a special attribute label (#), and the special attribute requirement includes that the target task needs to be inserted at a specific time point or form a specific sequence with the existing tasks in the task list; and needs to be inserted at a specific position pointed by an arrow, the 4th gap and the 5th gap in the alternative interval are numbered as B1 and B2 respectively, and the process goes to step S5203.

[0123] Step S5203, the gap B1, B2, …, B n is calculated B1 , the accumulated value x of the gap time t B2 …t Bn is calculated, in this embodiment, x = t B1 +t B2 , and the process goes to step S5205.

[0124] Step S5205, it is judged whether the accumulated value x of the gap time is greater than or equal to the target task time, if yes, the process goes to step S5207, if no, the process goes to step S5209. In this embodiment, x is equal to the target time, so the process goes to step S5207.

[0125] Step S5207, the gap data obtained by sequentially moving the tasks between the n gaps and the original point is simulated and calculated, and the insertable gap list is outputted, and the task is inserted. As shown, the normal task is moved to the original 4th gap position, as shown, the normal task is moved to the original 5th gap position, and as shown, the target task with special attribute is inserted into the list. Figure 20 Figure 21 Figure 22

[0126] Step S5209, if the accumulated value x of the gap time is less than the target time, n is assigned as n = n + 1, and the process goes to step S5211.

[0127] Step S5211, it is judged whether n is greater than the gap number, if yes, the process goes to step S5213, if no, the process goes to step S5203.

[0128] Step S5213, the process is ended.

[0129]

Embodiment Two

[0130] Step S1, an alternative interval is obtained, which is a time interval for task management, as shown, specifically including: Figure 4

[0131] Step S1301, a task is deleted, as shown, the deleted task has been marked on the diagram, and the process goes to step S1303. Figure 23

[0132] ​​​​​Step S1303: Obtain the attributes of the deleted task. The deleted task is a periodic recurring task. Specificify the task. Deleting the task will not affect other periodic recurring tasks. Obtain the start time of the deleted task and proceed to step S1305.

[0133] Step S1305: Determine if the deleted task is the last task of its specified date. If yes, proceed to step S1309; otherwise, proceed to step S1307. Figure 23 As shown, the deleted task was not the last task of the day, so proceed to step S1307.

[0134] Step S1307: Using the original start time of the deleted task as the starting point of the candidate interval and the start time of subsequent tasks of the deleted task as the ending point of the candidate interval, proceed to step S2. For example... Figure 23 As shown, the starting point of this candidate interval is the original start time of the deleted task, and the ending point is the start time of the first target task.

[0135] Step S2: Obtain the gap list of candidate intervals. After deleting a task, the gap duration of the candidate interval becomes the candidate interval duration. Depending on the system settings, the target task can be moved up or kept in place. If the target task is moved up, proceed to step S3.

[0136] Step S3: Calculate and output a list of insertable gaps based on the target task. For gaps that indirectly satisfy special attributes, where indirectly satisfying special attributes refers to meeting the specific order requirements of target tasks 1 through 6, such as... Figure 8 As shown, it specifically includes:

[0137] Step S3201: Compare the interval duration with the target task duration. If the interval duration is greater than the first target task duration, proceed to step S3203.

[0138] Step S3203: List the gaps whose interval duration is greater than or equal to the target task duration, such as... Figure 23 As shown, the gap list contains only one gap, proceed to step 3205.

[0139] Step S3205: Determine if the target task has a special attribute tag. If yes, proceed to step S3207; otherwise, proceed to step S3209. In this embodiment, the target task has a specific order requirement, which means it has a specific attribute tag, so proceed to step S3207.

[0140] Step S3207: Determine if there is a gap that directly satisfies the special attribute. If yes, proceed to step S3211; otherwise, proceed to step S5. In this embodiment, the gap is a gap that directly satisfies the special attribute, so proceed to step S3211.

[0141] Step S3209: Output the list of insertable gaps.

[0142] Step S3211, outputting the gap list directly satisfying the special attribute, and turning to step S4.

[0143] Step S4, inserting the task. In this embodiment, the first target task is inserted into the gap. After the first target task is inserted into the gap, a new gap is formed, and the subsequent target task is kept unchanged or moved in turn according to the system setting and / or user demand. The specific moving process is described in this embodiment, and will not be repeated here.

[0144] Embodiment Three

[0145] The case of periodic repeating task is described in combination with Figure 24 .

[0146] Step S1, obtaining the candidate interval, and the candidate interval is obtained by one or more of steps S11, S12 or S13.

[0147] Step S2, obtaining the gap list of the candidate interval, as shown in Figure 6 , specifically including:

[0148] Step S2201, obtaining the periodic repeating task list, and turning to step S2203; Step S2203, obtaining the conflict period of the periodic repeating task and the target task, and turning to step S2205; Step S2205, obtaining the conflict period unit of the periodic repeating task and the target task, and turning to step S2207; Step S2207, comparing the conflict period start and end date of the periodic repeating task and the target task, and turning to step S2209; Step S2209, outputting the conflict list, and the conflict list is a non-candidate gap.

[0149] In this embodiment, step S2201, obtaining the periodic repeating task list is Figure 24 , for display convenience, only the periodic repeating task part is displayed, and other parts are omitted, where a, b and c are existing tasks in the system, and d is a target task to be inserted, and turning to step S2203; Step S2203, the time period of the target task d is 13:00-15:00, and the time period that may cause conflict is b (13:00-15:00) and c (14:00-16:00), and turning to step S2205.

[0150] Step S2205, the repetition period of the target task d is a week, and the task d will be performed on Tuesday and Thursday every week. The task b which can conflict with the task d is also performed on Tuesday and Thursday. Step S2207 is entered. The repetition period unit can be set as a week, a month, a quarter, a year, or a period required by a user according to system settings and user requirements. In the repetition period, the repetition unit is one period unit.

[0151] Step S2207, compare the periodically repeated task with the conflict period start and end date of the target task. In Figure 24 , the end date of the task b is earlier than the start date of the target task d. Step S2209 is entered.

[0152] Step S2209, the period of the task b does not overlap with the period of the target task d. Therefore, the task b will not affect the insertion of the target task d. The no conflict list is output. Step S3 is entered.

[0153] Step S3, calculate and output the insertable gap list according to the target task, including one or more of the execution modes of step S31, step S32 or step S33. Step S4 is entered.

[0154] Step S4, insert the task.

[0155] Example four

[0156] For the case where there is an indirect gap that meets the special attribute of the target task, i.e. there is a proper gap, the specific description is combined with Figure 25 , Figure 26 , Figure 27 and Figure 28 .

[0157] Step S1, obtain the candidate interval. The way to obtain the candidate interval includes one or more of the following steps: step S11, step S12 or step S13.

[0158] Step S2, obtain the gap list of the candidate interval, including one or more of the following steps: step S21, step S22.

[0159] Step S3, calculate and output the insertable gap list according to the target task, including one or more of the execution modes of step S31, step S32 or step S33. Step S5 is entered.

[0160] Step S5, integrate the gap and insert the task, as shown in Figure 10 , which specifically includes:

[0161] Step S5101, output the list of gaps that indirectly meet the special attribute (proper gap). Step S5103 is entered.

[0162] Step S5103, sequentially move the tasks between the target task and the proper gap away from the target task, and move to the proper gap, and insert the target task.

[0163] In this embodiment, as shown in Figure 25 , the target task has a specific insertion time requirement (not marked with a special attribute tag, actually a task with a special attribute), and needs to be inserted at the time point of task 2 and task 3. The gap that indirectly meets the requirement of the target task at present is the gap between task 1 and task 2. Step S5101, output the list of gaps that indirectly meet the special attribute, i.e. the list of proper gaps, and go to step S5103.

[0164] Step 5103, as shown in Figure 26 and Figure 27 , sequentially move task 2 and task 3 away from the target task to the proper gap, and insert the target task.

[0165] The preferred embodiments of the present application are described in detail above. It should be understood that those skilled in the art can make many modifications and changes without creative labor based on the concept of the present application. Therefore, any technical solution obtained by logical analysis, reasoning or limited experiment based on the existing technology according to the concept of the present application shall be within the protection scope defined by the claims.

Claims

1. A time line based task management method including tasks and gaps between the tasks, characterized by, The method comprises the following steps: Obtaining a candidate interval (S1) for task management; obtaining a gap list (S2) of the candidate interval; calculating and outputting an insertable gap list (S3) according to a target task; inserting a task (S4) or integrating a gap, inserting a task (S5) or ending (S6) the operation; Obtaining a candidate interval (S1) comprises the following steps: Obtaining a target task date (S1101); determining whether the target task belongs to a task of the day (S1103); if yes, taking the obtained current time as the starting point of the candidate interval (S1105); if no, taking 0 o'clock of the day as the starting point of the candidate interval (S1109); and taking 24 o'clock of the target task day as the end point of the candidate interval (S1107); Obtaining the attributes of tasks in a task list (S1201); obtaining a rivet task list (S1203); grouping the rivet tasks by date and sorting them within the group (S1205); and calculating the candidate intervals between the rivet tasks; The step of inserting a task (S5) or integrating a gap comprises the following steps: With the target task start time as the origin, according to the distance between the gap in the alternative interval and the origin, it is sequentially coded as B1, B2, B n , n is an integer (S5201); n is less than 1, end (S5213) operation.

2. The timeline-based task management method of claim 1, wherein, After obtaining the attributes of tasks in a task list (S1201), if there is no rivet task in the task list, the calculation is ended (S1241).

3. The timeline-based task management method of claim 1, wherein, The step of calculating the candidate intervals between the rivet tasks comprises the following steps: Grouping the rivet tasks by date and sorting them within the group (S1205); determining whether the task date sequence number i is greater than the grouping number (S1207), i being a positive integer starting from 1.

4. The timeline-based task management method of claim 3, wherein, The step of calculating the candidate intervals between the rivet tasks further comprises the following steps: If the task date sequence number i is greater than the grouping number, the candidate intervals with end points earlier than the current time are deleted (S1237).

5. The timeline-based task management method of claim 3, wherein, The step of calculating the candidate intervals between the rivet tasks further comprises the following steps: If the task date sequence number i is less than or equal to the grouping number, it is further determined whether the start time of the first rivet task of the i-th day is later than 0 o'clock (S1209).

6. The timeline-based task management method of claim 5, wherein, The step of calculating the candidate intervals between the rivet tasks further comprises the following steps: If the start time of the first rivet task of the i-th day is later than 0 o'clock, the start time of the j-th candidate interval of the i-th day is 0 o'clock of the i-th day, and the end time is the start time of the j-th rivet task (S1211), j being a positive integer starting from 1; the starting point of the j+1-th candidate interval of the i-th day is the end time of the j-th rivet task (S1213); and it is determined whether the j-th rivet task of the i-th day is the last rivet task of the i-th day (S1215).

7. The timeline-based task management method of claim 6, wherein, The step of calculating the candidate intervals between the rivet tasks further comprises the following steps: The end point of the j+1-th candidate interval of the i-th day is the start time of the j+1-th rivet task (S1217); j is assigned a value of j=j+1 (S1219); and the starting point of the j+1-th candidate interval of the i-th day is the end time of the j-th rivet task (S1213).

8. The timeline-based task management method according to claim 6 or 7, characterized by, The step of calculating the candidate intervals between the rivet tasks further comprises the following steps: The end point of the j+1-th candidate interval of the i-th day is 24 o'clock of the i-th day (S1221); i is assigned a value of i=i+1 (S1223); and it is determined whether the task date sequence number i is greater than the grouping number (S1207).

9. The timeline-based task management method of claim 5, wherein, The step of calculating the alternative interval between rivet tasks further comprises the following steps: The start time of the jth alternative interval of the ith day is the end time of the jth task (S1225); it is judged whether the jth rivet task of the ith day is the last rivet task of the ith day (S1227).

10. The timeline-based task management method of claim 9, wherein, The step of calculating the alternative interval between rivet tasks further comprises the following steps: If the jth rivet task of the ith day is not the last rivet task of the ith day, the end time of the jth alternative interval of the ith day is the start time of the j+1th rivet task (S1229); j is assigned as j=j+1 (S1231), and the start time of the jth alternative interval of the ith day is repeated as the end time of the jth task (S1225); it is judged whether the jth rivet task of the ith day is the last rivet task of the ith day (S1227).

11. The timeline-based task management method of claim 9, wherein, The step of calculating the alternative interval between rivet tasks further comprises the following steps: If the jth rivet task of the ith day is the last rivet task of the ith day, the end time of the jth alternative interval of the ith day is 24:00 of the ith day (S1229); i is assigned as i=i+1 (S1235), and it is judged whether the task date sequence number i is greater than the grouping number (S1207).

12. The timeline-based task management method of claim 1, wherein, The step of obtaining the alternative interval (S1) comprises the following steps: The deleted task is deleted (S1301); the attribute of the deleted task is obtained (S1303); it is judged whether the deleted task is the last task of the date: If yes, the judgment is ended (S1309); if no, the original start time of the deleted task is taken as the start time of the alternative interval, and the start time of the subsequent task of the deleted task is taken as the end time of the alternative interval (S1307).

13. The timeline-based task management method of claim 1, wherein, The step of obtaining the gap list of the alternative interval (S2) comprises the following steps: The gap list in the alternative interval is obtained (S2101); the gap list of the alternative interval is outputted (S2103).

14. The timeline-based task management method of claim 1, wherein, The step of obtaining the gap list of the alternative interval (S2) comprises the following steps: The list of periodically repeated tasks is obtained (S2201); the period of the conflict between the periodically repeated task and the target task is obtained (S2203); the conflict period unit of the periodically repeated task and the target task is obtained (S2205); the conflict period start and end dates of the periodically repeated task and the target task are compared (S2207); the conflict list is outputted (S2209), and the conflict list is a non-alternative gap.

15. The timeline-based task management method of claim 1, wherein, The step of calculating and outputting the insertable gap list according to the target task (S3) comprises the following steps: The gap length and the target task length are compared (S3101); the gaps with the gap length greater than or equal to the target task length are listed (S3103); the insertable gap list of the alternative interval is outputted (S3105).

16. The timeline-based task management method of claim 1, wherein, The step of calculating and outputting the insertable gap list according to the target task (S3) comprises the following steps: The gap length and the target task length are compared (S3201); the gaps with the gap length greater than or equal to the target task length are listed (S3203); it is judged whether the target task has a special attribute label (S3205).

17. The timeline-based task management method of claim 16, wherein, The step of calculating and outputting the insertable gap list according to the target task (S3) further comprises the following steps: If the target task has no special attribute label, the insertable gap list is outputted (S3209).

18. The timeline-based task management method of claim 16, wherein, According to the target task, calculating and outputting the list of insertable gaps (S3) further comprises the following steps: If the target task has a special attribute tag, further determine whether there is a gap directly satisfying the special attribute (S3207).

19. The timeline-based task management method of claim 18, wherein, According to the target task, calculating and outputting the list of insertable gaps (S3) further comprises the following steps: If there is a gap directly satisfying the special attribute, output the list of gaps directly satisfying the special attribute (S3211).

20. The timeline-based task management method of claim 18, wherein, According to the target task, calculating and outputting the list of insertable gaps (S3) further comprises the following steps: If there is no gap directly satisfying the special attribute, go to the step of integrating gaps and inserting tasks (S5).

21. The timeline-based task management method of claim 1, wherein, According to the target task, calculating and outputting the list of insertable gaps (S3) comprises the following steps: Compare the gap duration with the target task duration (S3301); if there is no gap greater than or equal to the target task (S3303); go to the step of integrating gaps and inserting tasks (S5) or end the operation (S6).

22. The timeline-based task management method of claim 1, wherein, Integrating gaps and inserting tasks (S5) comprises the following steps: Output the list of gaps indirectly satisfying the special attribute (S5101); move the tasks between the target task and the gaps away from the target task and towards the gaps, and insert the target task (S5103).

23. The timeline-based task management method of claim 1, wherein, Integrating gaps and inserting tasks (S5) further comprises the following steps: Calculate the gap B1, B2, … B n The gap length tB1, tB2, … tB n The accumulated value x (S5203); further determine whether the gap length accumulated value x is greater than or equal to the target task length (S5205).

24. The timeline-based task management method of claim 23, wherein, Integrating gaps and inserting tasks (S5) further comprises the following steps: If the gap duration accumulation value x is less than the target duration, n is assigned as n = n + 1 (S5209); it is determined whether n is greater than the gap number (S5211); if n is greater than the gap number, the operation is ended (S5213); if n is less than or equal to the gap number, the gap durations tB1, tB2,... tBn of the gaps B1, B2,... Bn are calculated (S5205). n n The gap duration accumulation value x (S5203).​ 25. The timeline-based task management method of claim 23, wherein, Integrating gaps and inserting tasks (S5) further comprises the following steps: If the accumulated value x of the gap duration is greater than or equal to the target duration, simulate the gap data obtained by moving the tasks between the n gaps and the origin away from the origin, output the list of insertable gaps, and insert the task (S5207).

26. The timeline-based task management method of claim 22 or 25, wherein, When the moved task is a periodic repeating task, the association between the moved task and the periodic repeating task group is released, and the movement of the moved task does not affect other periodic repeating tasks.

27. The timeline-based task management method of claim 12, wherein, When the deleted task is a periodic repeating task, the deletion operation can delete one day of the periodic repeating task or the entire periodic repeating task.

Images