A task scheduling method, device, apparatus and storage medium

Abstract

Embodiments of the present application disclose a task scheduling method and device, determine the target area to which a plurality of to-be-handled tasks that a target user needs to handle belong, determine the priority of the to-be-handled tasks according to the task handling time of the to-be-handled tasks, allocate a plurality of to-be-handled tasks of different priorities that are in the same target area and / or in adjacent target areas to the same date, and generate a to-be-handled task list of the target user. After obtaining the target area to which the plurality of to-be-handled tasks belong, the plurality of to-be-handled tasks of different priorities that are in the same target area and / or in adjacent target areas can be allocated to the same date according to the priority of the to-be-handled tasks. This is equivalent to automatically realizing task scheduling, planning the task handling sequence and time, maximizing the task handling efficiency, and generating the to-be-handled task list, which can reduce the situation of missing tasks.

Description

Technical Field

[0001] The present application relates to the field of computers, and in particular to a task scheduling method, apparatus, device, and storage medium. Background Art

[0002] The current government is paying more and more attention to the modernization of grassroots governance systems and governance capabilities, and therefore has put forward higher requirements on the efficiency of grassroots staff in handling governance tasks.

[0003] However, at present, grassroots staff mainly receive and process governance tasks manually, and the task processing time and processing order of different governance tasks mainly rely on the subjective judgment of grassroots staff. This ultimately leads to low efficiency of grassroots staff in handling governance tasks, which greatly affects the improvement of grassroots governance system and governance capacity. Summary of the Invention

[0004] The embodiments of the present application provide a task scheduling method, apparatus, equipment, and storage medium, which can improve the efficiency of grassroots staff in handling governance tasks, and are conducive to improving the grassroots governance system and governance capabilities.

[0005] The present invention provides a method for scheduling tasks, the method comprising:

[0006] Determine target areas to which multiple pending tasks to be handled by the target user belong, wherein the target areas are obtained by dividing the jurisdictions for which the target user is responsible;

[0007] Determining the priority of the pending task according to the task processing time of the pending task;

[0008] Multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas are assigned to the same date to generate a to-do task list for the target user.

[0009] In a possible implementation, the to-do tasks include real-time tasks, and the priorities include a first priority, a second priority, and a third priority;

[0010] Determining the priority of the to-do task according to the task processing time of the to-do task includes:

[0011] According to the required completion time of the real-time task, the priority of the to-do task is determined to be the first priority, the second priority and the third priority, and the required completion time corresponding to the first priority, the second priority and the third priority increases in sequence.

[0012] In a possible implementation, the target area includes a first area and a second area that are adjacent to each other;

[0013] The step of allocating multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas to the same date to generate a to-do task list for the target user includes:

[0014] Allocate the second-priority and third-priority real-time tasks belonging to the first and second regions to a first date according to the first region to which the first-priority real-time task belongs;

[0015] The real-time tasks of the second priority and the third priority that do not belong to the first area and the second area are allocated to dates other than the first date, and a to-do task list of the target user is generated.

[0016] In a possible implementation, the to-do tasks further include periodic tasks, and the priorities include a fourth priority and a fifth priority;

[0017] Determining the priority of the to-do task according to the task processing time of the to-do task includes:

[0018] According to the task period of the periodic task, the priorities of the to-be-done tasks are determined to be the fourth priority and the fifth priority, and the task periods corresponding to the fourth priority and the fifth priority increase in sequence.

[0019] The step of allocating multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas to the same date to generate a to-do task list for the target user includes:

[0020] The periodic tasks of the fourth priority and the fifth priority belonging to the first area and the second area and the real-time task of the first priority belonging to the first area are assigned to the same date.

[0021] In a possible implementation, the to-do tasks include periodic tasks, and the priorities include a sixth priority and a seventh priority;

[0022] Determining the priority of the to-do task according to the task processing time of the to-do task includes:

[0023] According to the task period of the periodic task, the priorities of the to-be-done tasks are determined to be the sixth priority and the seventh priority, and the task periods corresponding to the sixth priority and the seventh priority increase in sequence.

[0024] In a possible implementation, the target area includes adjacent third and fourth areas;

[0025] The step of allocating multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas to the same date to generate a to-do task list for the target user includes:

[0026] The periodic tasks of the sixth priority and the seventh priority belonging to the third area and the fourth area are assigned to the same date.

[0027] In a possible implementation, the method further includes:

[0028] If the number of multiple to-do tasks on the same date in the to-do task list is greater than a preset daily maximum processing time, the task processing time of the multiple to-do tasks in the to-do task list is adjusted.

[0029] In a possible implementation, the method further includes:

[0030] A to-do path is generated according to each target area in the to-do task list, so that the target user can handle multiple to-do tasks according to the to-do path.

[0031] The present application also provides a task scheduling device, which includes:

[0032] A first determining unit is configured to determine target areas to which multiple pending tasks to be handled by a target user belong, wherein the target areas are obtained by dividing the jurisdiction of the target user;

[0033] A second determining unit, configured to determine the priority of the to-be-done task according to the task processing time of the to-be-done task;

[0034] The allocating unit is configured to allocate multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas to the same date, and generate a to-do task list for the target user.

[0035] In a possible implementation, the to-do tasks include real-time tasks, and the priorities include a first priority, a second priority, and a third priority;

[0036] The first determining unit is configured to:

[0037] According to the required completion time of the real-time task, the priority of the to-do task is determined to be the first priority, the second priority and the third priority, and the required completion time corresponding to the first priority, the second priority and the third priority increases in sequence.

[0038] In a possible implementation, the target area includes a first area and a second area that are adjacent to each other;

[0039] The allocation unit is used to:

[0040] Allocate the second-priority and third-priority real-time tasks belonging to the first and second regions to a first date according to the first region to which the first-priority real-time task belongs;

[0041] The real-time tasks of the second priority and the third priority that do not belong to the first area and the second area are allocated to dates other than the first date, and a to-do task list of the target user is generated.

[0042] In a possible implementation, the to-do tasks further include periodic tasks, and the priorities include a fourth priority and a fifth priority;

[0043] The first determining unit is configured to:

[0044] According to the task period of the periodic task, the priorities of the to-be-done tasks are determined to be the fourth priority and the fifth priority, and the task periods corresponding to the fourth priority and the fifth priority increase in sequence.

[0045] The allocation unit is used to:

[0046] The periodic tasks of the fourth priority and the fifth priority belonging to the first area and the second area and the real-time task of the first priority belonging to the first area are assigned to the same date.

[0047] In a possible implementation, the to-do tasks include periodic tasks, and the priorities include a sixth priority and a seventh priority;

[0048] The first determining unit is configured to:

[0049] According to the task period of the periodic task, the priorities of the to-be-done tasks are determined to be the sixth priority and the seventh priority, and the task periods corresponding to the sixth priority and the seventh priority increase in sequence.

[0050] In a possible implementation, the target area includes adjacent third and fourth areas;

[0051] The allocation unit is used to:

[0052] The periodic tasks of the sixth priority and the seventh priority belonging to the third area and the fourth area are assigned to the same date.

[0053] In a possible implementation, the apparatus further includes:

[0054] The adjusting unit is configured to adjust the task processing time of the multiple to-do tasks in the to-do task list if the number of the multiple to-do tasks on the same date in the to-do task list is greater than a preset daily maximum processing value.

[0055] In a possible implementation, the apparatus further includes:

[0056] A generating unit is configured to generate a to-do path according to each target area in the to-do task list, so that the target user can handle multiple to-do tasks according to the to-do path.

[0057] The embodiment of the present application further provides a task scheduling device, comprising: a processor, a memory, and a system bus;

[0058] The processor and the memory are connected via the system bus;

[0059] The memory is used to store one or more programs, and the one or more programs include instructions. When the instructions are executed by the processor, the processor executes any one of the implementations of the above-mentioned task scheduling method.

[0060] An embodiment of the present application also provides a computer-readable storage medium, which stores instructions. When the instructions are executed on a terminal device, the terminal device executes any one of the implementation methods of the above-mentioned task scheduling method.

[0061] An embodiment of the present application provides a task scheduling method, which determines the target areas to which multiple to-do tasks that a target user needs to handle belong respectively, the target area is obtained by regional division of the jurisdiction that the target user is responsible for, and determines the priority of the to-do task according to the task handling time of the to-do task, and assigns multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas to the same date, and generates a to-do task list for the target user. That is to say, after obtaining the target areas to which multiple to-do tasks belong respectively, the priority can be subsequently determined according to the priority of the to-do task, which is determined according to the task handling time of the to-do task. Multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas are assigned to the same date, which is equivalent to automatically realizing task scheduling, planning the task handling order and time, maximizing the task handling efficiency, and generating a to-do task list, which can reduce the situation of missed tasks. BRIEF DESCRIPTION OF THE DRAWINGS

[0062] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are only some embodiments recorded in this application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0063] Figure 1 A flowchart of a task scheduling method provided in an embodiment of the present application;

[0064] Figure 2 A schematic diagram of jurisdiction division provided in an embodiment of the present application;

[0065] Figure 3 A schematic diagram of a target area to which a to-do task belongs provided in an embodiment of the present application;

[0066] Figure 4 A schematic diagram of a target area to which another to-do task belongs provided in an embodiment of the present application;

[0067] Figure 5 A schematic diagram of a target area to which another to-do task belongs provided in an embodiment of the present application;

[0068] Figure 6 A schematic diagram of a to-do path provided in an embodiment of the present application;

[0069] Figure 7 This is a structural block diagram of a task scheduling device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0070] In order to help those skilled in the art better understand the present invention, the following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of this application.

[0071] As the current government attaches increasing importance to the modernization of grassroots governance systems and governance capabilities, it has put forward higher requirements on the efficiency of grassroots staff in handling governance tasks.

[0072] Grassroots governance is the normal work of grassroots staff in street offices, community committees, etc. However, grassroots staff often spend a lot of time and energy but are unable to completely handle and close the loop of grassroots governance tasks within their jurisdiction. Moreover, grassroots staff often spend a lot of time going out but can only complete a small number of tasks, and their work efficiency is low.

[0073] This is because the current grassroots staff mainly manually assign the receipt and processing of governance tasks, and the task processing time and processing order of different governance tasks mainly rely on the subjective judgment of the grassroots staff. This ultimately leads to low efficiency of grassroots staff in handling governance tasks, which greatly affects the improvement of the grassroots governance system and governance capabilities.

[0074] Based on this, an embodiment of the present application provides a task scheduling method to determine the target areas to which multiple to-do tasks that a target user needs to handle belong respectively. The target area is obtained by regionally dividing the jurisdiction that the target user is responsible for. According to the task processing time of the to-do task, the priority of the to-do task is determined, and multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas are assigned to the same date to generate a to-do task list for the target user. That is to say, after obtaining the target areas to which multiple to-do tasks belong respectively, the priority of the to-do task can be subsequently determined according to the priority of the to-do task. The priority is determined according to the task processing time of the to-do task. Multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas are assigned to the same date. This is equivalent to automatically realizing task scheduling, planning the task processing order and time, maximizing the task processing efficiency, and generating a to-do task list, which can reduce the situation of missed tasks.

[0075] To make the purpose, technical solutions, and advantages of the embodiments of this application more clear, the technical solutions in the embodiments of this application will be clearly and completely described below in conjunction with the drawings in the embodiments of this application. Obviously, the described embodiments are part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0076] First embodiment

[0077] See also Figure 1 , is a flowchart of a task scheduling method provided in this embodiment, the method comprising the following steps:

[0078] S101: Determine target areas to which multiple to-do tasks that a target user needs to handle belong.

[0079] In an embodiment of the present application, the target user is a grassroots staff member who can handle multiple pending tasks within the jurisdiction he is responsible for. The jurisdiction of the target user can be divided into regions to obtain multiple target regions, so that the multiple pending tasks can be subsequently processed in a centralized manner according to the multiple target regions, thereby improving the processing efficiency of the pending tasks.

[0080] Specifically, the geographic information system can be used to reasonably divide the area responsible for each target user, combining physical factors such as the internal composition of the actual area, the physical boundaries of the corresponding actual area, and the road network of the actual area. When obtaining the jurisdiction for each target user, the urban management grid division system can be directly reused. When specifically dividing the jurisdiction, the area division can be carried out according to the specific management grid / jurisdiction obtained by using the urban management grid division system. When dividing the area, the area division can take into account the actual work convenience and scientificity of the target user, so that each target area after the division is an independent unit that can be reached by the entire area. In other words, the area division can be as even as possible and the roads between the areas are unobstructed. After the area division, the path relationship between the areas can be clarified, and the combination of paths between the areas can be used to know the combination of target areas that can be merged to process pending tasks.

[0081] As an example, see Figure 2 As shown, it is a schematic diagram of the jurisdiction division provided by an embodiment of the present application. In the figure, the jurisdiction that the target user is responsible for is divided into 12 target areas, among which Area 1, Area 2, and Area 3 belong to the same community, but due to the large area of ​​the community, they are divided into three areas, Area 4, Area 6, Area 7, Area 8, and Area 12 are separate communities, Area 5 is a commercial complex, Area 9 is a community and a commercial area, Area 10 is two smaller communities, and Area 11 is a school. Taking Area 1 as an example, it can be combined with Area 2, Area 5, and Area 6 to merge and process pending tasks. If Area 1 and Area 7 are combined, the actual target user's time wasted on the road will increase sharply due to problems such as community walls and road planning.

[0082] After the jurisdiction for the target user is divided into multiple target areas, multiple to-do tasks that the target user needs to handle and the target areas described by the multiple to-do tasks can be obtained.

[0083] To-do tasks can be divided into two categories: real-time tasks and periodic tasks.

[0084] Periodic tasks are primarily processed on a fixed cycle, meaning they are performed at regular intervals in the target area. For example, a target user might have special personnel perform on-site follow-up visits to multiple target areas within their jurisdiction, collect and update basic information, and perform other tasks within a biweekly or monthly cycle.

[0085] As an example, target users conduct home visits to special groups such as disabled people, lonely elderly people, pregnant women, newborns, key personnel, etc. in the community within biweekly and monthly cycles, and at the same time handle tasks such as certification of elderly people's allowance collection and updating of residents' basic information in multiple target areas.

[0086] Real-time tasks primarily rely on real-time sensing and analysis of abnormal events detected by internal video and IoT sensing devices in multiple target areas. These tasks are sudden, non-cyclical, and do not require repeated visits to a specific target area. These tasks can include, at a minimum, overflowing trash cans, damaged road surfaces, waterlogging in flood-prone areas, electric vehicles parked at corridor entrances, fire escapes occupied, off-leash dog identification, abnormal key personnel trajectories, and the absence of elderly individuals.

[0087] Specifically, the target area to which the real-time task belongs can be combined with the address data corresponding to the front-end IoT sensing device to analyze the address information of the real-time task, and automatically match it with the already divided target area through the capabilities of the geographic information system.

[0088] S102: Determine the priority of the to-do task according to the task processing time of the to-do task.

[0089] In an embodiment of the present application, multiple to-do tasks have different task processing times, and different task processing times correspond to different priorities, that is, different task processing times correspond to different processing orders of to-do tasks. The priority of the to-do task can be determined based on the task processing time of the to-do task.

[0090] To-do tasks are divided into periodic tasks and real-time tasks, corresponding to different priorities:

[0091] As a first possible implementation method, the to-do tasks are only real-time tasks. At this time, the priorities include first priority, second priority and third priority. The priorities of the to-do tasks can be determined as first priority, second priority and third priority according to the required completion time of the real-time tasks. The required completion time corresponding to the first priority, second priority and third priority increases in turn.

[0092] That is, when a to-do task is a real-time task, the task processing time is the required completion time of the real-time task. For example, the required completion time of a Class D to-do task is one day, the required completion time of a Class E to-do task is three days, and the required completion time of a Class F to-do task is seven days. As the required completion time increases, the priority of the real-time task decreases, meaning that the order in which the real-time tasks are completed also decreases. For example, a real-time task with a required completion time of one day is given the first priority, a real-time task with a required completion time of three days is given the second priority, and a real-time task with a required completion time of seven days is given the third priority. In other words, as the required completion time increases, the order in which the real-time tasks are completed decreases.

[0093] As a second possible implementation, the to-do tasks include real-time tasks and periodic tasks. In this case, the priorities include the first, second, and third priorities corresponding to the real-time tasks, and also include the fourth and fifth priorities corresponding to the periodic tasks. The priority of the real-time task is determined based on the required completion time, which has been described in detail above and will not be repeated here. The priority of the periodic task can be determined as the fourth and fifth priorities based on the task cycle, and the task cycles corresponding to the fourth and fifth priorities increase in sequence.

[0094] That is to say, when the to-do tasks include periodic tasks, the task processing time of the to-do tasks may include the task cycle of the periodic tasks. For example, Class A tasks are biweekly periodic tasks, and Class B and Class C tasks are monthly periodic tasks. According to the increasing order of task cycles, biweekly periodic tasks are the fourth priority, and monthly periodic tasks are the fifth priority.

[0095] The order and processing time of periodic tasks in different task cycles are different. For example, biweekly periodic tasks must be processed every two weeks, and monthly periodic tasks must be processed every month. Biweekly periodic tasks and different monthly periodic tasks in the same target area or adjacent target areas can be assigned to the same date for processing. This can not only take into account periodic tasks of different priorities, but also improve task processing efficiency in the same or adjacent target areas.

[0096] As a third possible implementation, the to-do tasks are solely periodic tasks. Based on the periodic tasks' task cycles, the priorities of the to-do tasks are determined to be sixth and seventh priority levels, with the task cycles corresponding to the sixth and seventh priorities increasing in order. The determination of the priority of periodic tasks based on the task cycle has been described in detail above and will not be repeated here.

[0097] S103: Allocate multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas to the same date, and generate a to-do task list for the target user.

[0098] In an embodiment of the present application, a to-do task list includes multiple dates and to-do tasks of different priorities and different target areas corresponding to the multiple dates. After determining the priority of the to-do tasks based on their processing times, multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas can be assigned to the same date for processing, and then a to-do task list for the target user is generated based on the multiple processing dates.

[0099] The multiple to-be-handled tasks of different priorities in the same target area or adjacent target areas are assigned to the same date, which can not only process multiple to-be-handled tasks in area division, but also handle to-be-handled tasks of different task handling times on the same date, thereby maximizing the efficiency of task handling.

[0100] Considering that the jurisdiction of the target user is large and is divided into multiple target areas, multiple to-be-handled tasks in adjacent two or more target areas are usually assigned to the same date for processing, which can not only improve the efficiency of to-be-handled task processing, but also evenly distribute multiple to-be-handled tasks, thereby reducing the situation that to-be-handled tasks cannot be arranged for handling dates or to-be-handled tasks are missed.

[0101] The to-be-handled tasks can include only real-time tasks, or include real-time tasks and periodic tasks, or include only periodic tasks. According to different types of tasks included in the to-be-handled tasks, the multiple to-be-handled tasks can be assigned in the following three cases:

[0102] The first possible implementation is that the to-be-handled tasks include only real-time tasks. The priority of the real-time tasks can be determined according to the demand completion time of the real-time tasks as the first priority, the second priority and the third priority. According to the first area to which the real-time tasks of the first priority belong, the real-time tasks of the second priority and the third priority in the first area and a second area adjacent to the first area are assigned to the first date, and the real-time tasks of the second priority and the third priority that do not belong to the first area and the second area are assigned to other dates except the first date, thereby generating a to-be-handled task list of the target user.

[0103] That is, according to the real-time tasks of different priorities, the target areas to which the real-time tasks belong are determined, and then the real-time tasks of the first priority are assigned to the first date for handling, and the real-time tasks of other priorities in the first area to which the real-time tasks of the first priority belong and the second area adjacent to the first area are also assigned to the first date for handling. The first date is the first day in multiple handling dates of the to-be-handled task list.

[0104] After the real-time tasks of the first priority are assigned to the handling dates, the real-time tasks of the second priority are continuously assigned. The real-time tasks of the second priority in the first area and the second area to which the real-time tasks belong have been assigned to the handling dates, and the real-time tasks of the second priority can be assigned to the handling dates according to the demand completion time of the real-time tasks of the second priority. At this time, the real-time tasks of the second priority in adjacent target areas can be evenly assigned to the handling dates.

[0105] After assigning the processing date to the second-priority real-time task, the third-priority real-time task corresponding to the target area to which the second-priority real-time task belongs is also assigned to the processing date of the second-priority real-time task, so that when the target user processes the second-priority task, he can also process the third-priority real-time task in the same target area at the same time.

[0106] The remaining unassigned third-priority real-time tasks can be assigned to the remaining third-priority real-time tasks in adjacent target areas on the same date for processing.

[0107] It can be seen that when allocating dates for to-do tasks for real-time tasks, the priority of the real-time task and the target area to which the real-time task belongs will be comprehensively considered, so as to allocate multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas to the same date, thereby maximizing the efficiency of target users in handling to-do tasks.

[0108] For example, the required completion time for tasks in category D is one day, the required completion time for tasks in category E is three days, and the required completion time for tasks in category F is seven days. Tasks in category D are the first priority, tasks in category E are the second priority, and tasks in category F are the third priority. Figure 3 As shown in FIG, a target area diagram of a to-do task provided in an embodiment of the present application. Figure 3 As can be seen, the jurisdiction for the target user has 12 target areas. The required completion time for the first-priority to-do tasks is one day. These first-priority to-do tasks include D1 and D10, which are first-priority to-do tasks located in areas 1 and 10. The required completion time for the second-priority to-do tasks is three days. These second-priority to-do tasks include E1 to E9, which are second-priority to-do tasks located in areas 1 to 9. The required completion time for the third-priority to-do tasks is seven days. These second-priority to-do tasks include F1 to F12, which are third-priority to-do tasks located in areas 1 to 12.

[0109] The first-priority real-time task needs to be scheduled for the first date. You can obtain real-time tasks within a fixed date and determine the first day of the fixed date as the first date. For example, if the fixed date is a month, the first date is the first day of the first week of the month.

[0110] The required completion time for first-priority real-time tasks D1 and D10 is one day. Therefore, the to-do tasks for regions 1 and 10 need to be assigned on the first day of the first week. Since each target region has a third-priority to-do task with a required completion time of seven days, all to-do tasks for the 12 target regions need to be processed within a week. Based on working days, this translates to an average of at least 2.5 to-do tasks per day for each target region. Therefore, the target region for processing to-do tasks on the first day of the first week can be expanded to include region 9, an adjacent target region to region 10.

[0111] At this time, the first-priority real-time tasks D1 and D10, the second-priority real-time task E1, and the third-priority real-time tasks F1, E9, F9, and F10 of areas 1, 9, and 10 are all assigned to the first day of the first week for processing.

[0112] After assigning dates to the first-priority real-time tasks, continue to assign second-priority real-time tasks. Since the second-priority tasks E1 and E9 belonging to areas 1 and 10 are assigned to the first day of the first week, and since the required completion time of the second-priority real-time tasks is three days, within the three days from Monday to Wednesday of the first week, it is also necessary to assign dates to the target areas with second-priority real-time tasks for processing: Area 2, Area 5, Area 6, Area 7, and Area 8. According to the principle of even distribution and adjacent areas, Area 2 can be added when assigning to-do tasks on Monday. Area 2 is the adjacent target area of ​​Area 1, that is, it is responsible for the to-do tasks of Area 1, Area 2, Area 9, and Area 10 on Monday, the to-do tasks of the adjacent target areas: Area 6, Area 7, and Area 8 on Tuesday, and the to-do tasks of the adjacent target areas: Area 3, Area 4, and Area 5 on Wednesday.

[0113] At this time, the second-priority real-time tasks have been assigned dates and completed within the first three days of the first week. Areas 1 to 10 to which the second-priority real-time tasks belong can be assigned corresponding third-priority real-time tasks within the corresponding dates, so that real-time tasks of different priorities belonging to the same target area can be handled on the same date in the same target area, thereby improving the efficiency of handling pending tasks.

[0114] Each target area has a third-priority real-time task, and the required completion time of the third-priority real-time task is 7 days. After the first-priority and second-priority real-time tasks are assigned dates, there are still two target areas: Area 11 and Area 12. The third-priority real-time tasks F11 and F12 have no assigned processing dates. Therefore, the third-priority real-time tasks of Area 11 and Area 12 need to be assigned on Thursday and Friday of the first week. Combined with the actual average magnitude of the allocation of to-do tasks, Area 11 and Area 12 are adjacent target areas. The third-priority real-time tasks F11 and F12 can be assigned to the same date for centralized processing, such as Friday.

[0115] After allocating the processing dates for multiple real-time tasks of different priorities and belonging to different target areas, the target user's to-do task list is generated as shown in Table 1 below:

[0116] Table 1 To-do list for target users

[0117]

[0118] A second possible implementation method is to assign the priority of the periodic tasks, which include both real-time and periodic tasks, to the fourth and fifth priority levels, respectively, based on the periodic tasks' task cycles. The fourth- and fifth-priority periodic tasks belonging to the first and second regions and the first-priority real-time task belonging to the first region are assigned to the same date. The fourth- and fifth-priority periodic tasks belonging to the same target region as the second- or third-priority real-time task are then assigned to the corresponding processing date for the same target region.

[0119] That is, according to different target areas corresponding to different processing dates in the to-do task list of the target user determined by the real-time task, the periodic tasks belonging to the target area are processed on the same date.

[0120] As an example, see Figure 4 As shown in FIG, another target area diagram of a to-do task provided in an embodiment of the present application. Figure 4 It can be seen that the jurisdiction that the target user is responsible for has 12 target areas, the task cycle of the fourth priority periodic tasks is biweekly, and each target area has the fourth priority tasks, including A1 to A12, and the task cycle of the fifth priority periodic tasks is monthly. Each target area has the fifth priority tasks, including B1 to B12 and C1 to C12.

[0121] The required completion time for first-priority real-time tasks is one day. These include D1 and D10, which are first-priority real-time tasks located in regions 1 and 10. The required completion time for second-priority real-time tasks is three days. These include E1 to E9, which are second-priority real-time tasks located in regions 1 through 9. The required completion time for third-priority real-time tasks is seven days. These include F1 to F12, which are third-priority real-time tasks located in regions 1 through 12.

[0122] Based on the target areas assigned to different dates in the target user's to-do task list determined by the real-time task, the periodic tasks belonging to the target area are assigned to the date. The target user's to-do task list determined by the real-time task can be shown in Table 1. After the periodic tasks are assigned, the target user's to-do task list is generated as shown in Table 2 below:

[0123] Table 2 To-do list for target users

[0124]

[0125]

[0126] A third possible implementation is that the to-do tasks include only periodic tasks, and the priorities of the periodic tasks can be determined as sixth and seventh priority based on the periodic tasks' task cycles. The sixth and seventh priority periodic tasks belonging to the third area and the fourth area adjacent to the third area are assigned to the same date. That is, the sixth and seventh priority periodic tasks belonging to the same target area or adjacent target areas are assigned to the same date.

[0127] That is, when there is no real-time task, periodic tasks with different task periods belonging to the same target domain are allocated to the same date according to the task period of the periodic task.

[0128] As an example, see Figure 5 As shown in FIG, it is a schematic diagram of a target area to which another to-do task belongs provided by an embodiment of the present application. Figure 5 It can be seen that the jurisdiction under the target user's responsibility has 12 target areas. The task cycle of the sixth-priority periodic task is biweekly. Every target area has the sixth-priority periodic task, including A1 to A12. The task cycle of the seventh-priority periodic task is monthly. Every target area has the seventh-priority periodic task, including B1 to B12 and C1 to C12.

[0129] You can pre-set three days a week as the days for target users to handle to-do tasks, such as Tuesday, Wednesday and Friday, so that they can achieve maximum efficiency every time they handle to-do tasks.

[0130] For the periodic tasks of the sixth priority with a biweekly task cycle, such as A1 to A12, the periodic tasks of the sixth priority will be randomly assigned to 3 days a week within a month according to the area and task cycle. For the periodic tasks of the seventh priority with a monthly task cycle, such as B1 to B12 and C1 to C12, the periodic tasks of the seventh priority and the periodic tasks of the sixth priority in the same target area will be assigned to the same date for processing according to the target area to which the date determined by the periodic tasks of the sixth priority belongs.

[0131] That is to say, for periodic tasks of different priorities, the task cycle and target area are combined to realize the cross-combination of periodic tasks, and according to the principle of proximity, the efficiency of handling the target user's to-do tasks is maximized by combining adjacent target areas, avoiding the waste of handling time due to unreasonable planning of the target area.

[0132] Assign processing dates to periodic tasks and generate a to-do task list for the target user as shown in Table 3 below:

[0133] Table 3 To-do list for target users

[0134]

[0135]

[0136] From the above three ways of allocating multiple to-do tasks, it can be seen that the generated to-do task lists are different depending on the types of tasks included in the to-do tasks. The above three situations are only exemplary and can be implemented in combination. For example, a to-do task list of periodic tasks can be formed first. After obtaining the real-time tasks that have occurred, the to-do task list can be updated based on the priority of the real-time tasks so that the real-time tasks can be processed in a timely manner. When there are no real-time tasks, the to-do task list continues to be generated according to the periodic tasks. This is because real-time tasks have many factors such as randomness, real-timeness, and unpredictability. Therefore, when a real-time task is generated, the to-do task list can be optimized and adjusted in combination with the new real-time task to achieve the goal of optimizing task handling.

[0137] In an embodiment of the present application, if the number of multiple to-do tasks on the same date in the to-do list exceeds the preset maximum daily processing time, the task processing time of the multiple to-do tasks in the to-do list will be adjusted. In other words, by presetting the maximum daily processing time, the unreasonable distribution of to-do tasks on a single day can be avoided as much as possible.

[0138] Specifically, based on the actual processing time requirements, dates with a large number of to-do tasks can be adjusted to available dates to optimize the to-do task list.

[0139] Referring to the to-do task list shown in Table 2, a large number of to-do tasks are assigned on Monday, but no to-do tasks are assigned on Thursday. In this case, some to-do tasks in two adjacent areas on Monday, Area 9 and Area 10, can be adjusted to Thursday for processing. The priority of the adjusted to-do tasks meets the task processing time requirements. For example, the periodic tasks A9, A10, C9, and B10 of Area 9 and Area 10, as well as the real-time tasks F9 and F10, can be adjusted to Thursday for processing.

[0140] Table 4 To-do list for target users

[0141]

[0142]

[0143] In an embodiment of the present application, a to-do path can be generated based on the target areas in the to-do list, so that the target user can complete multiple to-do tasks according to the to-do path. In other words, based on the task completion time and target area, combined with the to-do list, multiple to-do tasks with assigned completion dates are grouped according to the target area according to the optimal completion path to achieve maximum task completion efficiency.

[0144] As an example, see Figure 6 As shown, a to-do path schematic diagram provided in an embodiment of the present application, combined with the to-do task list table 4, the to-do tasks assigned on Monday of the first week can be combined with the road network service to perform actual path planning to generate a to-do path. The actual target areas for processing are area 1, area 2, area 9, and area 10, and the number of to-do tasks in area 1 and area 2 is relatively large. Therefore, the target user starts from the office location, and after completing the to-do tasks in area 1 and area 2, returns to the office location through areas 10 and 9.

[0145] Thus, the task scheduling method provided by the embodiment of the present application divides the periodic tasks of grassroots staff into multiple target areas and task processing times according to their management jurisdiction, and evenly distributes them. At the same time, combined with real-time task triggering, the to-do task list is further optimized and distributed, generating a to-do task list and path planning for the day, helping grassroots staff improve the quality and efficiency of task processing. In addition, after the real-time tasks are generated every day, subsequent periodic tasks can be further optimized and distributed to ensure real-time updates of the to-do task list and accurate and efficient task allocation.

[0146] An embodiment of the present application provides a task scheduling method, which determines the target areas to which multiple to-do tasks that a target user needs to handle belong respectively, the target area is obtained by regional division of the jurisdiction that the target user is responsible for, and determines the priority of the to-do task according to the task handling time of the to-do task, and assigns multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas to the same date, and generates a to-do task list for the target user. That is to say, after obtaining the target areas to which multiple to-do tasks belong respectively, the priority can be subsequently determined according to the priority of the to-do task, which is determined according to the task handling time of the to-do task. Multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas are assigned to the same date, which is equivalent to automatically realizing task scheduling, planning the task handling order and time, maximizing the task handling efficiency, and generating a to-do task list, which can reduce the situation of missed tasks.

[0147] Second embodiment

[0148] This embodiment will introduce a task scheduling device. For related content, please refer to the above method embodiment.

[0149] See also Figure 7 , is a schematic diagram of the composition of a task scheduling device provided in this embodiment, the device 700 includes:

[0150] The first determining unit 710 is configured to determine target areas to which multiple pending tasks to be handled by a target user belong. The target areas are obtained by dividing the jurisdiction of the target user.

[0151] A second determining unit 720 is configured to determine the priority of the to-be-done task according to the task processing time of the to-be-done task;

[0152] The allocating unit 730 is configured to allocate multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas to the same date, and generate a to-do task list for the target user.

[0153] In one implementation of this embodiment, the to-do task includes a real-time task, and the priority includes a first priority, a second priority, and a third priority;

[0154] The first determining unit 710 is configured to:

[0155] According to the required completion time of the real-time task, the priority of the to-do task is determined to be the first priority, the second priority and the third priority, and the required completion time corresponding to the first priority, the second priority and the third priority increases in sequence.

[0156] In an implementation form of the embodiment, the target region comprises a first region and a second region adjacent to each other.

[0157] The assigning unit 730 is configured to:

[0158] assign the real-time tasks of the second priority and the third priority belonging to the first region and the second region to a first date according to the first region to which the real-time tasks of the first priority belong;

[0159] assign the real-time tasks of the second priority and the third priority not belonging to the first region and the second region to a date other than the first date, and generate a to-do list of the target user.

[0160] In an implementation form of the embodiment, the to-do tasks further comprise periodic tasks, and the priorities comprise a fourth priority and a fifth priority.

[0161] The first determining unit 710 is configured to:

[0162] determine the priorities of the to-do tasks as the fourth priority and the fifth priority according to a task period of the periodic tasks, and the task periods corresponding to the fourth priority and the fifth priority increase in turn.

[0163] The assigning unit 730 is configured to:

[0164] assign the periodic tasks of the fourth priority and the fifth priority belonging to the first region and the second region and the real-time tasks of the first priority belonging to the first region to a same date.

[0165] In an implementation form of the embodiment, the to-do tasks comprise periodic tasks, and the priorities comprise a sixth priority and a seventh priority.

[0166] The first determining unit 710 is configured to:

[0167] determine the priorities of the to-do tasks as the sixth priority and the seventh priority according to a task period of the periodic tasks, and the task periods corresponding to the sixth priority and the seventh priority increase in turn.

[0168] In an implementation form of the embodiment, the target region comprises a third region and a fourth region adjacent to each other.

[0169] The assigning unit 730 is configured to:

[0170] assign the periodic tasks of the sixth priority and the seventh priority belonging to the third region and the fourth region to a same date.

[0171] In one implementation of this embodiment, the apparatus further includes:

[0172] The adjusting unit is configured to adjust the task processing time of the multiple to-do tasks in the to-do task list if the number of the multiple to-do tasks on the same date in the to-do task list is greater than a preset daily maximum processing value.

[0173] In one implementation of this embodiment, the apparatus further includes:

[0174] A generating unit is configured to generate a to-do path according to each target area in the to-do task list, so that the target user can handle multiple to-do tasks according to the to-do path.

[0175] Furthermore, an embodiment of the present application also provides a task scheduling device, comprising: a processor, a memory, and a system bus;

[0176] The processor and the memory are connected via the system bus;

[0177] The memory is used to store one or more programs, and the one or more programs include instructions. When the instructions are executed by the processor, the processor executes any one of the implementation methods of the above-mentioned task scheduling method.

[0178] Furthermore, an embodiment of the present application also provides a computer-readable storage medium, in which instructions are stored. When the instructions are executed on a terminal device, the terminal device executes any one of the implementation methods of the above-mentioned task scheduling method.

[0179] Furthermore, an embodiment of the present application also provides a computer program product, which, when running on a terminal device, enables the terminal device to execute any one of the implementation methods of the above-mentioned task scheduling method.

[0180] Through the description of the above embodiments, it can be seen that those skilled in the art can clearly understand that all or part of the steps in the above-mentioned embodiment methods can be implemented by means of software plus the necessary general hardware platform. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which can be stored in a storage medium such as ROM / RAM, a magnetic disk, an optical disk, etc., and includes a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network communication device such as a media gateway, etc.) to execute the methods described in each embodiment of the present application or certain parts of the embodiments.

[0181] It should be noted that the various embodiments described herein are described in progressive order of complexity where appropriate. Therefore, features and concepts described in one or more embodiments should be understood to be applicable to other embodiments as well, unless explicitly described otherwise.

[0182] It should also be noted that, as used in the specification and in the claims, the article "a", "an", or "the" are intended to not be limiting, but are intended to mean "one or more". It will be further noted that the various links described herein can be coupled together in different ways, sizing, and / or order, depending in part on specific implementation needs and preferences, and alternatives having the same or similar function would be understood to be within the scope of the application. Furthermore, expressions such as "at least one of X, Y and Z" when preceding a list of two or more members, are comprehended to refer to alternatives such as "X," "Y," "Z," "two of X, Y and Z," "three of X, Y and Z," "at least one of X and Y," "at least one of X or Y," and so on, and not merely "each member of the list." Also, the term "about" means that quantities, dimensions, sizes, formulations, parameters, shapes and other characteristics need not be exact, but can be approximated and / or broader than the required values within an acceptable range of values or limits, and uses the term "substantially" in the sense of "considerably" or "for the most part", i.e., the conceivably described characteristic is largely, though not necessarily wholly, what is specified.

[0183] The foregoing description of the disclosed embodiments enables a person skilled in the art to implement or use the application. Numerous modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein can be applied to other embodiments without departing from the spirit or scope of the application. Therefore, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A task scheduling method, characterized in that: The method comprises: Determine target areas to which multiple pending tasks to be handled by the target user belong, wherein the target areas are obtained by dividing the jurisdictions for which the target user is responsible; Determining the priority of the pending task according to the task processing time of the pending task; Allocating multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas to the same date, and generating a to-do task list for the target user; The to-do tasks include real-time tasks, and the priorities include a first priority, a second priority, and a third priority; Determining the priority of the to-do task according to the task processing time of the to-do task includes: Determining the priorities of the to-do tasks as a first priority, a second priority, and a third priority according to the required completion time of the real-time task, wherein the required completion time corresponding to the first priority, the second priority, and the third priority increases in sequence; The target area includes a first area and a second area that are adjacent to each other; The step of allocating multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas to the same date to generate a to-do task list for the target user includes: Allocate the second-priority and third-priority real-time tasks belonging to the first and second regions to a first date according to the first region to which the first-priority real-time task belongs; The real-time tasks of the second priority and the third priority that do not belong to the first area and the second area are allocated to dates other than the first date, and a to-do task list of the target user is generated.

2. The method according to claim 1, characterized in that The to-do tasks also include periodic tasks, and the priorities include the fourth priority and the fifth priority; Determining the priority of the to-do task according to the task processing time of the to-do task includes: Determining the priorities of the to-be-done tasks as the fourth priority and the fifth priority according to the task cycles of the periodic tasks, wherein the task cycles corresponding to the fourth priority and the fifth priority increase in sequence; The step of allocating multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas to the same date to generate a to-do task list for the target user includes: The periodic tasks of the fourth priority and the fifth priority belonging to the first area and the second area and the real-time task of the first priority belonging to the first area are assigned to the same date.

3. The method according to claim 1, characterized in that The to-do tasks include periodic tasks, and the priorities include the sixth priority and the seventh priority; Determining the priority of the to-do task according to the task processing time of the to-do task includes: According to the task period of the periodic task, the priorities of the to-be-done tasks are determined to be the sixth priority and the seventh priority, and the task periods corresponding to the sixth priority and the seventh priority increase in sequence.

4. The method according to claim 3, characterized in that The target area includes adjacent third and fourth areas; The step of allocating multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas to the same date to generate a to-do task list for the target user includes: The periodic tasks of the sixth priority and the seventh priority belonging to the third area and the fourth area are assigned to the same date.

5. The method according to any one of claims 1 to 4, characterized in that The method further comprises: If the number of multiple to-do tasks on the same date in the to-do task list is greater than a preset daily maximum processing time, the task processing time of the multiple to-do tasks in the to-do task list is adjusted.

6. The method according to any one of claims 1 to 4, characterized in that: The method further comprises: A to-do path is generated according to each target area in the to-do task list, so that the target user can handle multiple to-do tasks according to the to-do path.

7. A task scheduling device, characterized in that: The device comprises: A first determining unit is configured to determine target areas to which multiple pending tasks to be handled by a target user belong, wherein the target areas are obtained by dividing the jurisdiction of the target user; A second determining unit, configured to determine the priority of the to-be-done task according to the task processing time of the to-be-done task; an allocating unit, configured to allocate multiple to-do tasks of different priorities in the same target area and / or in adjacent target areas to the same date, and generate a to-do task list for the target user; The to-do tasks include real-time tasks, and the priorities include a first priority, a second priority, and a third priority; The first determining unit is configured to: Determining the priorities of the to-do tasks as a first priority, a second priority, and a third priority according to the required completion time of the real-time task, wherein the required completion time corresponding to the first priority, the second priority, and the third priority increases in sequence; The target area includes a first area and a second area that are adjacent to each other; The allocation unit is used to: Allocate the second-priority and third-priority real-time tasks belonging to the first and second regions to a first date according to the first region to which the first-priority real-time task belongs; The real-time tasks of the second priority and the third priority that do not belong to the first area and the second area are allocated to dates other than the first date, and a to-do task list of the target user is generated.

8. A task scheduling device, characterized in that: include: Processor, memory, system bus; The processor and the memory are connected via the system bus; The memory is configured to store one or more programs, wherein the one or more programs include instructions, and when the instructions are executed by the processor, the processor is enabled to perform the method according to any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that The computer-readable storage medium stores instructions, and when the instructions are executed on a terminal device, the terminal device executes the method according to any one of claims 1 to 6.

Images