CN111950908A - Scheduling task configuration pushing method and device, computer and storage medium - Google Patents
Scheduling task configuration pushing method and device, computer and storage medium Download PDFInfo
- Publication number
- CN111950908A CN111950908A CN202010814641.6A CN202010814641A CN111950908A CN 111950908 A CN111950908 A CN 111950908A CN 202010814641 A CN202010814641 A CN 202010814641A CN 111950908 A CN111950908 A CN 111950908A
- Authority
- CN
- China
- Prior art keywords
- task
- user
- priority
- scheduling
- scheduling task
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
Abstract
The application relates to a scheduling task configuration pushing method, a scheduling task configuration pushing system, a scheduling task configuration pushing computer and a storage medium. The method comprises the steps of obtaining a scheduling task and an urgency parameter of the scheduling task; determining a priority corresponding to the emergency degree parameter according to the emergency degree parameter; analyzing the scheduling task to obtain a task geographic position; and pushing the scheduling task to the user within the preset range of the task geographic position according to the priority of the scheduling task. By obtaining the priority of the scheduling task and the geographic position of the scheduling task, the scheduling task can be distributed and pushed to the corresponding user according to the priority and the geographic position of the scheduling task, so that the scheduling of the scheduling task is more reasonable and efficient, and the scheduling efficiency of the scheduling task is improved.
Description
Technical Field
The present application relates to the field of task pushing technologies, and in particular, to a method and an apparatus for pushing scheduling task configuration, a computer, and a storage medium.
Background
With the continuous development of economy, various emergencies generated in the life and economic activities of people are increased. The problem is that the dispatch center needs to dispatch police rapidly to avoid larger loss in the face of increasing various emergencies. However, at present, police force is allocated manually, so that the dispatching work intensity is high, the dispatching efficiency is low, and in some cases, the dispatching is unreasonable due to the fact that police force distribution cannot be accurately and globally planned, and certain hidden dangers exist.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a method, an apparatus, a computer, and a storage medium for pushing a configuration of a scheduled task.
A scheduling task configuration pushing method, the method comprising:
acquiring a scheduling task and an urgency parameter of the scheduling task;
determining a priority corresponding to the emergency degree parameter according to the emergency degree parameter;
analyzing the scheduling task to obtain a task geographic position;
and pushing the scheduling task to the user within the preset range of the task geographic position according to the priority of the scheduling task.
In one embodiment, the step of pushing the scheduled task to the user within the preset range of the task geographic location according to the priority of the scheduled task includes:
detecting whether the priority of the scheduling task is higher than or equal to a preset priority;
when the priority of the scheduling task is higher than or equal to the preset priority, detecting whether a user exists in a preset range of the geographic position of the task;
and when detecting that a user exists in a preset range of the task geographic position, pushing the scheduling task to the user.
In one embodiment, the step of pushing the scheduling task to the user when it is detected that the user exists within a preset range of the geographic location of the task includes:
when detecting that a user exists in a preset range of the task geographic position, detecting whether the task state of the user is idle;
when the task state of the user is detected to be idle, pushing the scheduling task to the user;
when the task state of the user is detected to be a task execution state, detecting whether the priority of the task currently executed by the user is lower than the priority of the scheduling task;
and when the priority of the current task executed by the user is lower than the priority of the scheduling task, sending suspension information to the user and pushing the scheduling task to the user.
In one embodiment, the step of detecting whether a user exists within a preset range of the task geographic location further comprises:
when detecting that no user exists in the preset range of the task geographic position, acquiring a user closest to the task geographic position;
and pushing the scheduling task to the nearest user to the geographic position of the task.
In one embodiment, the step of detecting whether the priority of the scheduled task is higher than or equal to a preset priority further includes:
when the priority of the scheduling task is lower than the preset priority, acquiring the task state of each user;
acquiring users with task states being idle, and calculating the distance between the users with the task states being idle and the geographic position of the task;
determining a user with a task state which is closest to the task geographical position and is idle;
pushing the scheduled task to the nearest idle user to the task geographic location.
In an embodiment, in the step of pushing the scheduling task to the user within a preset range of the geographic location of the task according to the priority of the scheduling task, the preset range is related to the priority of the scheduling task, and the higher the priority of the scheduling task is, the smaller the preset range is.
7. A scheduled task configuration push apparatus, the apparatus comprising:
the emergency degree parameter acquisition module is used for acquiring a scheduling task and an emergency degree parameter of the scheduling task;
the priority determining module is used for determining the priority corresponding to the emergency degree parameter according to the emergency degree parameter;
the task geographic position module is used for analyzing the scheduling task to obtain a task geographic position;
and the scheduling task pushing module is used for pushing the scheduling task to the user within the preset range of the task geographic position according to the priority of the scheduling task.
In one embodiment, the scheduling task pushing module comprises:
the priority detection unit is used for detecting whether the priority of the scheduling task is higher than or equal to a preset priority;
the range user detection unit is used for detecting whether a user exists in a preset range of the task geographic position or not when the priority of the scheduling task is higher than or equal to the preset priority;
and the scheduling task pushing unit is used for pushing the scheduling task to the user when detecting that the user exists in the preset range of the task geographic position.
A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
acquiring a scheduling task and an urgency parameter of the scheduling task;
determining a priority corresponding to the emergency degree parameter according to the emergency degree parameter;
analyzing the scheduling task to obtain a task geographic position;
and pushing the scheduling task to the user within the preset range of the task geographic position according to the priority of the scheduling task.
A computer-readable storage medium, on which a computer program is stored which, when executed by a processor, carries out the steps of:
acquiring a scheduling task and an urgency parameter of the scheduling task;
determining a priority corresponding to the emergency degree parameter according to the emergency degree parameter;
analyzing the scheduling task to obtain a task geographic position;
and pushing the scheduling task to the user within the preset range of the task geographic position according to the priority of the scheduling task.
According to the scheduling task configuration pushing method, the scheduling task configuration pushing device, the computer and the storage medium, the scheduling task can be distributed and pushed to the corresponding users according to the priority and the geographical position of the scheduling task by obtaining the priority and the geographical position of the scheduling task, so that the scheduling of the scheduling task is more reasonable and efficient, and the scheduling efficiency of the scheduling task is improved.
Drawings
FIG. 1 is a diagram of an application environment for a push method for scheduling task configuration in one embodiment;
FIG. 2 is a flowchart illustrating a method for pushing scheduling task configuration in one embodiment;
FIG. 3 is a block diagram of a scheduling task configuration pushing device in one embodiment;
FIG. 4 is a diagram illustrating an internal structure of a computer device according to an embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
The scheduling task configuration pushing method provided by the application can be applied to the application environment shown in fig. 1. Wherein the terminal 102 communicates with the server 104 via a network. The terminal 102 may be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices, and the server 104 may be implemented by an independent server or a server cluster formed by a plurality of servers. The server 104 acquires a scheduling task and an urgency parameter of the scheduling task; determining a priority corresponding to the emergency degree parameter according to the emergency degree parameter; analyzing the scheduling task to obtain a task geographic position; and pushing the scheduling task to a terminal within a preset range of the geographic position of the task according to the priority of the scheduling task.
It should be understood that the scheduling task configuration pushing method of the present application can be applied to the scheduling of the alert task, and can also be applied to the scheduling of other businesses of the enterprise and public institution, and for convenience of illustration and understanding, the following embodiments will be further described with reference to the scheduling applied to the alert task.
In one embodiment, as shown in fig. 2, a method for pushing a configuration of a scheduling task is provided, which is described by taking the method as an example applied to the server in fig. 1, and includes the following steps:
In particular, the scheduling task is input by a background person or generated by the system in response to a telephone call by a calling user, and in some embodiments, the scheduling task may also be input by the calling user on the terminal through an application. Specifically, the calling user is a service object of a scheduling task, the scheduling task is used for being executed by an executing user, and the executing user is a user for executing the scheduling task. For example, the calling user is an alarm person, and the executive user is an alarm. The urgency parameter is used for identifying the urgency of the scheduling task, the urgency parameter can be represented by a numerical value or a character string, and the urgency parameter can be input by background personnel, a calling user in a telephone call or the calling user on a terminal through an application program.
It should be understood that, in order to avoid the error of inputting the urgency parameter by the calling user, in an embodiment, a scheduling task and a scheduling task attribute are obtained, and an urgency parameter corresponding to the scheduling task attribute is obtained according to the scheduling task attribute, in this embodiment, the urgency parameter is determined by the scheduling task attribute, the scheduling task attribute is used to represent the attribute of the scheduling task, for example, the value of the scheduling task attribute is a character string, the value of the scheduling task attribute is a chinese character or an english character, in this embodiment, an application program on a terminal provides a pull-down alternative menu, which provides a plurality of selectable scheduling task attributes, for example, the scheduling task attribute for the calling user to select includes "traffic accident, no casualty", "traffic accident, no injury of personnel, no death", "traffic accident, no death of personnel"), The method has the advantages that the method can determine the urgency degree parameters of the scheduling tasks by selecting the attributes of the scheduling tasks without calling the users to input the urgency degree parameters by themselves, and effectively avoids the calling users from inputting the urgency degree parameters by mistake.
And 220, determining the priority corresponding to the emergency degree parameter according to the emergency degree parameter.
In this embodiment, the urgency parameter in each numerical range corresponds to a priority, and scheduling tasks with different priorities are executed in different orders.
And step 230, analyzing the scheduling task to obtain the geographic position of the task.
In this embodiment, the scheduling task records information such as personal information of the calling user, a task geographic location, a calling time, and a scheduling task attribute, where the personal information of the calling user includes identity information, age information, and gender information of the calling user, and the identity information may be identity card information or driver license information. In this step, the geographic position of the task recorded in the scheduling task is obtained by analyzing the scheduling task, so that a user executing the scheduling task can know the geographic position, and the scheduling task is executed.
And 240, pushing the scheduling task to the user within the preset range of the task geographic position according to the priority of the scheduling task.
In this step, the user within the preset range of the geographic position of the task refers to a user capable of executing the scheduling task, such as a police officer, and the user within the preset range of the geographic position of the task is selected, so that the user closest to the geographic position of the scheduling task can arrive at the site to execute the scheduling task as soon as possible. In addition, the scheduling tasks are distributed and pushed according to the priority, so that the scheduling tasks with higher priority can be distributed and pushed preferentially. According to the priority of the scheduling task, the scheduling task is sequentially pushed to the users within the preset range of the task geographic position according to the order of the priority. In this embodiment, the tasks with higher priorities are prioritized in the pushing order, so that the more urgent scheduling tasks can be preferentially distributed, and the scheduling tasks with the urgency are preferentially distributed under the condition that the task load of the police officer is saturated, so that the more serious emergency can be processed in time.
In the above embodiment, by obtaining the priority of the scheduling task and the geographic position of the scheduling task, the scheduling task can be distributed and pushed to the corresponding user according to the priority and the geographic position of the scheduling task, so that the scheduling of the scheduling task is more reasonable and efficient, and the scheduling efficiency of the scheduling task is improved.
In one embodiment, the step of pushing the scheduled task to the user within the preset range of the task geographic location according to the priority of the scheduled task includes: detecting whether the priority of the scheduling task is higher than or equal to a preset priority; when the priority of the scheduling task is higher than or equal to the preset priority, detecting whether a user exists in a preset range of the geographic position of the task; and when detecting that a user exists in a preset range of the task geographic position, pushing the scheduling task to the user.
In this embodiment, the priority may be represented by a numerical value, for example, the priority is 1, 2, 3, 4, and 5, and the smaller the numerical value, the higher the priority. For example, the predetermined priority is 3. When the priority of the scheduling task is higher than the preset priority, the scheduling task is preferentially distributed to users with short distance, therefore, when the priority of the scheduling task is higher than the preset priority, whether an executing user exists in the preset range of the distance between the executing user and the geographic position of the task is detected, and if the executing user exists in the preset range, the scheduling task is pushed to the executing user. Therefore, the scheduling task with higher priority is preferentially distributed to the executing users closer to the geographic position of the scheduling task, and the processing efficiency of the scheduling task with higher priority is improved.
In an embodiment, after the step of detecting whether the priority of the scheduling task is higher than or equal to a preset priority, the step of broadcasting the scheduling task to each user within a second preset range of the geographic location of the task when the priority of the scheduling task is lower than the preset priority, after receiving task viewing information of the user, detecting the time for the task viewing information of each user, pushing the scheduling task to the user with the earliest time for the task viewing information, and broadcasting a message that the task has been pushed to other users.
In this embodiment, the second preset range is greater than the preset range in the foregoing embodiment, the task viewing information is read information fed back to the server after the user views the broadcasted scheduling task, and the pushed message is used to indicate that the scheduling task is pushed and allocated. When the priority of the scheduling task is low, the scheduling task is broadcasted to each user, so that each user can check the scheduling task, the scheduling task is pushed to the user based on the time of the task checking information of each user, the scheduling task can be sent to the user who receives and browses the scheduling task earlier, because the second preset range is larger than the preset range, the user far away can receive the broadcast of the scheduling task, and because the priority of the scheduling task is low, the user far away can execute the scheduling task. By broadcasting the pushed task message to other users, other users can know that the scheduling task is distributed.
In one embodiment, when the priority of the scheduling task is lower than the preset priority, the scheduling task is broadcasted to each user within a second preset range of the geographic position of the task, wherein the broadcasted scheduling task is presented on a terminal in a preview mode, the broadcasted scheduling task can receive a first viewing instruction and a second viewing instruction on the terminal, when the terminal receives the first viewing instruction, the terminal feeds back task viewing information to a server, and when the terminal receives the second viewing instruction, the terminal deletes the previewed scheduling task and feeds back busy information to the server. In this embodiment, when the user receives the broadcasted scheduling task, the broadcasted scheduling task may be checked in two ways, when the scheduling task is opened and checked with the first checking instruction, the task checking information may be normally fed back to the server, and when the scheduling task is opened and checked with the second checking instruction, it is indicated that the current user is busy and cannot execute the broadcasted scheduling task, so the second checking instruction is adopted to check the broadcasted scheduling task.
In this embodiment, after the step of broadcasting the scheduling task to each of the users within the second preset range of the geographic location of the task, the method further includes deleting the user corresponding to the busy information from a broadcast list when the busy information fed back by the user is received, and adding the user corresponding to the busy information to the broadcast list after the first preset time. In this embodiment, when busy information fed back by a user is received, it is indicated that the user is busy at this time and cannot execute a scheduling task, so that the user is deleted from the broadcast list, and if there is a scheduling task that needs to be broadcast within a first preset time, the scheduling task does not need to be sent to the busy user during broadcasting, and after a period of time, that is, after the first preset time, the user is added to the broadcast list again, and the user can receive the broadcast scheduling task.
For example, the first viewing instruction is generated by a user sliding a screen, and the second viewing instruction is generated by a user lighting up the screen and turning off the screen. In this embodiment, after broadcasting a scheduling task to each terminal, a server detects an instruction received on a screen of a terminal of a user, detects, when it is detected that the terminal receives a sliding instruction of the user, a time at which each terminal receives the sliding instruction of the user, pushes the scheduling task to a user with the earliest received time of the sliding instruction, and broadcasts a message that the task has been pushed to other users; when the terminal detects that the terminal receives a screen lightening instruction and a screen extinguishing instruction of a user in sequence within second preset time, the user who receives the screen lightening instruction and the screen extinguishing instruction in sequence is deleted from the broadcast list, and after the first preset time, the user who receives the screen lightening instruction and the screen extinguishing instruction in sequence is added into the broadcast list.
Specifically, the second preset time is less than the first preset time, and the second preset time is a shorter time, which indicates that the user lights up the screen for viewing and then turns off the screen for a short time, indicating that the user is overwhelmed with the scheduled task. Therefore, the user is determined to be a busy user.
In the embodiment, the deletion of the user pushed by the scheduling task and the broadcast list is determined by detecting the instruction on the broadcast terminal in real time, so that the pushing efficiency and the broadcasting efficiency of the scheduling task can be effectively improved.
In one embodiment, the step of pushing the scheduling task to the user when it is detected that the user exists within a preset range of the geographic location of the task includes: when detecting that a user exists in a preset range of the task geographic position, detecting whether the task state of the user is idle; when the task state of the user is detected to be idle, pushing the scheduling task to the user; when the task state of the user is detected to be a task execution state, detecting whether the priority of the task currently executed by the user is lower than the priority of the scheduling task; and when the priority of the current task executed by the user is lower than the priority of the scheduling task, sending suspension information to the user and pushing the scheduling task to the user.
In this embodiment, the states of the executing user include an idle state and a task executing state, where in the idle state, the user does not currently execute the task, and in the task executing state, it indicates that the user is currently executing the task. Therefore, when the state of the user within the preset range from the task geographic position is idle, the scheduling task is pushed to the user; and when the user state in the preset range is not idle, acquiring the priority of the task currently executed by the user, and if the priority of the task currently executed by the user is lower, sending suspension information to a terminal of the user to enable the user to suspend executing the current task, pushing the scheduling task with higher priority to the user, enabling the scheduling task with higher priority to be processed preferentially, and enabling an emergency and a major event to be processed preferentially. After the task with higher priority is executed, the task which is suspended earlier is resumed.
In one embodiment, after the step of sending suspension information to the user and pushing the scheduling task to the user, the method further includes: and acquiring task execution completion information fed back by the user terminal, and receiving suspension completion information sent by the user terminal. In this embodiment, after the user executes the task with the higher priority, the execution of the task that was suspended earlier is resumed.
In one embodiment, after the step of sending suspension information to the user and pushing the scheduling task to the user, the method further includes: and sending the scheduling tasks corresponding to the suspension information into a task queue to be allocated, and pushing each scheduling task in the task queue to be allocated to a user according to the geographic position of the task according to the sequence of the task queue to be allocated. In this embodiment, after the task currently executed by the user is suspended, the suspended task enters the task queue to be allocated, the task is allocated again, and the task is allocated to the user within the preset range of the corresponding task geographic position, so that the suspended task can be allocated as soon as possible, and the task processing efficiency is improved.
In one embodiment, the step of detecting whether a user exists within a preset range of the task geographic location further comprises: when detecting that no user exists in the preset range of the task geographic position, acquiring a user closest to the task geographic position; and pushing the scheduling task to the nearest user to the geographic position of the task.
In this embodiment, when there is no corresponding execution user within a preset range from the geographic position of the task, the user closest to the geographic position of the task is determined, so that the scheduling task can be executed as early as possible.
In one embodiment, the step of detecting whether the priority of the scheduled task is higher than or equal to a preset priority further includes: when the priority of the scheduling task is lower than the preset priority, acquiring the task state of each user; acquiring users with task states being idle, and calculating the distance between the users with the task states being idle and the geographic position of the task; determining a user with a task state which is closest to the task geographical position and is idle; pushing the scheduled task to the nearest idle user to the task geographic location.
In this embodiment, when the priority of the scheduling task is higher, the scheduling task is allocated to the user whose task state is idle and whose geographical position is closest to the task, so that the task with higher priority can be processed as soon as possible.
In an embodiment, in the step of pushing the scheduling task to the user within a preset range of the geographic location of the task according to the priority of the scheduling task, the preset range is related to the priority of the scheduling task, and the higher the priority of the scheduling task is, the smaller the preset range is.
In this embodiment, the higher the priority of the scheduling task is, the smaller the preset range is, that is, the closer the user pushed by the scheduling task is to the geographic location of the task, so that the user closest to the geographic location of the scheduling task can quickly catch up to the scene to execute the scheduling task.
In an embodiment, after the step of pushing the scheduling task to the user within the preset range of the task geographic location, the method further includes receiving task execution completion information fed back by the user terminal, generating an end identifier for the scheduling task, associating the scheduling task with the end identifier, and deleting the scheduling task from a task list. In this embodiment, the completion of the scheduling task is indicated by the end identifier, and the scheduling task is deleted in the task list, so that the scheduling task is prevented from occupying resources.
In one embodiment, a scheduling task configuration pushing system is provided, which includes a reporting terminal, an executing terminal, and a server, where the reporting terminal and the executing terminal are connected to the server through a network, the server includes a memory, a processor, and a computer program stored in the memory and capable of running on the processor, and when the processor executes the computer program, the following steps are implemented: acquiring a scheduling task and an urgency parameter of the scheduling task; determining a priority corresponding to the emergency degree parameter according to the emergency degree parameter; analyzing the scheduling task to obtain a task geographic position; and pushing the scheduling task to an execution terminal within a preset range of the geographic position of the task according to the priority of the scheduling task.
And the reporting terminal is configured with a reporting application program, and the reporting application program is used for acquiring the scheduling task and the scheduling task attribute input by a reporting user/calling user and sending the scheduling task and the scheduling task attribute to the server. And the computer program on the server acquires the corresponding emergency degree parameter according to the scheduling task attribute and acquires the priority according to the emergency degree parameter.
And configuring a task application program on the execution terminal for executing the scheduling task, and executing the scheduling task by a user after receiving the scheduling task. And the execution terminal is also used for suspending the current task after receiving the suspension information, and feeding back the task execution completion information to the server after receiving the task execution completion instruction of the execution user.
It should be understood that, although the steps in the flowchart of fig. 2 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least a portion of the steps in fig. 2 may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
In one embodiment, as shown in fig. 3, there is provided a scheduling task configuration pushing apparatus, including:
an urgency parameter obtaining module 310, configured to obtain a scheduling task and an urgency parameter of the scheduling task;
a priority determining module 320, configured to determine a priority corresponding to the urgency parameter according to the urgency parameter;
a task geographic location module 330, configured to parse the scheduling task to obtain a task geographic location;
and the scheduling task pushing module 340 is configured to push the scheduling task to a user within a preset range of the task geographic location according to the priority of the scheduling task.
In one embodiment, the scheduling task pushing module comprises:
the priority detection unit is used for detecting whether the priority of the scheduling task is higher than or equal to a preset priority;
the range user detection unit is used for detecting whether a user exists in a preset range of the task geographic position or not when the priority of the scheduling task is higher than or equal to the preset priority;
and the scheduling task pushing unit is used for pushing the scheduling task to the user when detecting that the user exists in the preset range of the task geographic position.
In one embodiment, the scheduling task pushing unit includes:
the idle state detection subunit is used for detecting whether the task state of the user is idle or not when detecting that the user exists in the preset range of the task geographic position;
the scheduling task pushing subunit is used for pushing the scheduling task to the user when the task state of the user is detected to be idle;
the priority detection subunit is configured to detect whether the priority of the task currently executed by the user is lower than the priority of the scheduling task when it is detected that the task state of the user is the task execution;
and the suspension and push subunit is used for sending suspension information to the user and pushing the scheduling task to the user when the priority of the current task executed by the user is lower than the priority of the scheduling task.
In one embodiment, the scheduling task pushing module further comprises:
a nearest user acquiring unit, configured to acquire a nearest user from the task geographic location when it is detected that no user exists within a preset range of the task geographic location;
and the distance nearest task pushing unit is used for pushing the scheduling task to the nearest user from the geographic position of the task.
In one embodiment, the scheduling task pushing module further comprises:
the task state detection unit is used for acquiring the task state of each user when the priority of the scheduling task is lower than the preset priority;
the user distance calculation unit is used for acquiring users with idle task states and calculating the distance between the users with the idle task states and the task geographic position;
the nearest user determining unit is used for determining the user with the task state which is nearest to the task geographic position and is idle;
and the idle user task pushing unit is used for pushing the scheduling task to the nearest idle user away from the geographic position of the task.
In one embodiment, the preset range is related to the priority of the scheduling task, and the higher the priority of the scheduling task is, the smaller the preset range is.
For specific limitations of the scheduling task configuration pushing device, reference may be made to the above limitations of the scheduling task configuration pushing method, which is not described herein again. The modules in the scheduling task configuration pushing device can be wholly or partially implemented by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a server, the internal structure of which may be as shown in fig. 4. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer device is used for storing scheduling task configuration push data. The network interface of the computer device is used for communicating with an external user terminal through a network connection. The computer program is executed by a processor to implement a scheduled task configuration push method.
Those skilled in the art will appreciate that the architecture shown in fig. 4 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is provided, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
acquiring a scheduling task and an urgency parameter of the scheduling task;
determining a priority corresponding to the emergency degree parameter according to the emergency degree parameter;
analyzing the scheduling task to obtain a task geographic position;
and pushing the scheduling task to the user within the preset range of the task geographic position according to the priority of the scheduling task.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
detecting whether the priority of the scheduling task is higher than or equal to a preset priority;
when the priority of the scheduling task is higher than or equal to the preset priority, detecting whether a user exists in a preset range of the geographic position of the task;
and when detecting that a user exists in a preset range of the task geographic position, pushing the scheduling task to the user.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
when detecting that a user exists in a preset range of the task geographic position, detecting whether the task state of the user is idle;
when the task state of the user is detected to be idle, pushing the scheduling task to the user;
when the task state of the user is detected to be a task execution state, detecting whether the priority of the task currently executed by the user is lower than the priority of the scheduling task;
and when the priority of the current task executed by the user is lower than the priority of the scheduling task, sending suspension information to the user and pushing the scheduling task to the user.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
when detecting that no user exists in the preset range of the task geographic position, acquiring a user closest to the task geographic position;
and pushing the scheduling task to the nearest user to the geographic position of the task.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
when the priority of the scheduling task is lower than the preset priority, acquiring the task state of each user;
acquiring users with task states being idle, and calculating the distance between the users with the task states being idle and the geographic position of the task;
determining a user with a task state which is closest to the task geographical position and is idle;
pushing the scheduled task to the nearest idle user to the task geographic location.
In an embodiment, the step of pushing the scheduling task to the user within a preset range of the geographic location of the task according to the priority of the scheduling task is further implemented when the processor executes the computer program, where the preset range is related to the priority of the scheduling task, and the higher the priority of the scheduling task is, the smaller the preset range is.
In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of:
acquiring a scheduling task and an urgency parameter of the scheduling task;
determining a priority corresponding to the emergency degree parameter according to the emergency degree parameter;
analyzing the scheduling task to obtain a task geographic position;
and pushing the scheduling task to the user within the preset range of the task geographic position according to the priority of the scheduling task.
In one embodiment, the computer program when executed by the processor further performs the steps of:
detecting whether the priority of the scheduling task is higher than or equal to a preset priority;
when the priority of the scheduling task is higher than or equal to the preset priority, detecting whether a user exists in a preset range of the geographic position of the task;
and when detecting that a user exists in a preset range of the task geographic position, pushing the scheduling task to the user.
In one embodiment, the computer program when executed by the processor further performs the steps of:
when detecting that a user exists in a preset range of the task geographic position, detecting whether the task state of the user is idle;
when the task state of the user is detected to be idle, pushing the scheduling task to the user;
when the task state of the user is detected to be a task execution state, detecting whether the priority of the task currently executed by the user is lower than the priority of the scheduling task;
and when the priority of the current task executed by the user is lower than the priority of the scheduling task, sending suspension information to the user and pushing the scheduling task to the user.
In one embodiment, the computer program when executed by the processor further performs the steps of:
when detecting that no user exists in the preset range of the task geographic position, acquiring a user closest to the task geographic position;
and pushing the scheduling task to the nearest user to the geographic position of the task.
In one embodiment, the computer program when executed by the processor further performs the steps of:
when the priority of the scheduling task is lower than the preset priority, acquiring the task state of each user;
acquiring users with task states being idle, and calculating the distance between the users with the task states being idle and the geographic position of the task;
determining a user with a task state which is closest to the task geographical position and is idle;
pushing the scheduled task to the nearest idle user to the task geographic location.
In one embodiment, the step of pushing the scheduled task to the user within a preset range of the geographic location of the task according to the priority of the scheduled task, which is further implemented when the computer program is executed by the processor, is related to the priority of the scheduled task, and the higher the priority of the scheduled task is, the smaller the preset range is.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. A scheduling task configuration pushing method, the method comprising:
acquiring a scheduling task and an urgency parameter of the scheduling task;
determining a priority corresponding to the emergency degree parameter according to the emergency degree parameter;
analyzing the scheduling task to obtain a task geographic position;
and pushing the scheduling task to the user within the preset range of the task geographic position according to the priority of the scheduling task.
2. The method of claim 1, wherein the step of pushing the scheduled task to users within a preset range of the task geographic location according to the priority of the scheduled task comprises:
detecting whether the priority of the scheduling task is higher than or equal to a preset priority;
when the priority of the scheduling task is higher than or equal to the preset priority, detecting whether a user exists in a preset range of the geographic position of the task;
and when detecting that a user exists in a preset range of the task geographic position, pushing the scheduling task to the user.
3. The method of claim 2, wherein the step of pushing the scheduled task to the user upon detecting the presence of the user within a predetermined range of the geographic location of the task comprises:
when detecting that a user exists in a preset range of the task geographic position, detecting whether the task state of the user is idle;
when the task state of the user is detected to be idle, pushing the scheduling task to the user;
when the task state of the user is detected to be a task execution state, detecting whether the priority of the task currently executed by the user is lower than the priority of the scheduling task;
and when the priority of the current task executed by the user is lower than the priority of the scheduling task, sending suspension information to the user and pushing the scheduling task to the user.
4. The method of claim 2, wherein the step of detecting the presence of a user within a predetermined range of the geographic location of the task is further followed by:
when detecting that no user exists in the preset range of the task geographic position, acquiring a user closest to the task geographic position;
and pushing the scheduling task to the nearest user to the geographic position of the task.
5. The method of claim 2, wherein the step of detecting whether the priority of the scheduled task is higher than or equal to a preset priority further comprises:
when the priority of the scheduling task is lower than the preset priority, acquiring the task state of each user;
acquiring users with task states being idle, and calculating the distance between the users with the task states being idle and the geographic position of the task;
determining a user with a task state which is closest to the task geographical position and is idle;
pushing the scheduled task to the nearest idle user to the task geographic location.
6. The method according to any one of claims 1 to 5, wherein the step of pushing the scheduled task to the user within a preset range of the geographic location of the task according to the priority of the scheduled task is performed, the preset range is related to the priority of the scheduled task, and the higher the priority of the scheduled task is, the smaller the preset range is.
7. A scheduled task configuration push apparatus, the apparatus comprising:
the emergency degree parameter acquisition module is used for acquiring a scheduling task and an emergency degree parameter of the scheduling task;
the priority determining module is used for determining the priority corresponding to the emergency degree parameter according to the emergency degree parameter;
the task geographic position module is used for analyzing the scheduling task to obtain a task geographic position;
and the scheduling task pushing module is used for pushing the scheduling task to the user within the preset range of the task geographic position according to the priority of the scheduling task.
8. The apparatus of claim 1, wherein the scheduled task push module comprises:
the priority detection unit is used for detecting whether the priority of the scheduling task is higher than or equal to a preset priority;
the range user detection unit is used for detecting whether a user exists in a preset range of the task geographic position or not when the priority of the scheduling task is higher than or equal to the preset priority;
and the scheduling task pushing unit is used for pushing the scheduling task to the user when detecting that the user exists in the preset range of the task geographic position.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method of any of claims 1 to 6 are implemented when the computer program is executed by the processor.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010814641.6A CN111950908A (en) | 2020-08-13 | 2020-08-13 | Scheduling task configuration pushing method and device, computer and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010814641.6A CN111950908A (en) | 2020-08-13 | 2020-08-13 | Scheduling task configuration pushing method and device, computer and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111950908A true CN111950908A (en) | 2020-11-17 |
Family
ID=73342922
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010814641.6A Pending CN111950908A (en) | 2020-08-13 | 2020-08-13 | Scheduling task configuration pushing method and device, computer and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111950908A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113592224A (en) * | 2021-06-21 | 2021-11-02 | 同伦拍拍科技服务有限公司 | Bad asset disposal management system |
| CN115509723A (en) * | 2022-11-01 | 2022-12-23 | 中科雨辰科技有限公司 | Data processing system for acquiring non-target task object |
| CN115686847A (en) * | 2022-11-01 | 2023-02-03 | 中科雨辰科技有限公司 | Data processing system for acquiring target task object |
| CN115936331A (en) * | 2022-11-01 | 2023-04-07 | 中科雨辰科技有限公司 | Data processing system for obtaining target task object based on distance |
Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080244584A1 (en) * | 2007-03-26 | 2008-10-02 | Smith Gary S | Task scheduling method |
| WO2017165941A1 (en) * | 2016-03-31 | 2017-10-05 | Cae Inc. | Method, device and system for continuously recommending a deployment of emergency vehicle units |
| US20170357256A1 (en) * | 2016-06-14 | 2017-12-14 | Fuji Xerox Co., Ltd. | Robot control system and recording medium |
| CN107657379A (en) * | 2017-09-26 | 2018-02-02 | 广州平云小匠科技有限公司 | Task preferentially distributing method, device and system |
| CN108074642A (en) * | 2017-12-29 | 2018-05-25 | 青岛大学附属医院 | Emergency medical service method and system, computer installation and readable storage medium storing program for executing |
| US20180322442A1 (en) * | 2017-05-05 | 2018-11-08 | Servicenow, Inc. | Systems and methods for dynamically scheduling tasks across an enterprise |
| CN108876140A (en) * | 2018-06-12 | 2018-11-23 | 广东电网有限责任公司 | A kind of dispatching method, device, server and the medium of power communication maintenance task |
| CN109325702A (en) * | 2018-10-10 | 2019-02-12 | 宁夏峰尚科技有限公司 | Method for scheduling task and device |
| CN109830092A (en) * | 2017-12-30 | 2019-05-31 | 湖南汇博电子科技股份有限公司 | Fire-fighting and rescue dispatching method, device and readable storage medium storing program for executing |
| CN110276548A (en) * | 2019-06-20 | 2019-09-24 | 北京三快在线科技有限公司 | A kind of distribution method and device of dispatching business |
| CN110472849A (en) * | 2019-08-01 | 2019-11-19 | 阳光财产保险股份有限公司 | Maintenance task dispatching method, client and server-side |
| CN110826930A (en) * | 2019-11-12 | 2020-02-21 | 杭州安恒信息技术股份有限公司 | Security task scheduling method, device, equipment and readable storage medium |
| CN111027873A (en) * | 2019-12-16 | 2020-04-17 | 广州星迪智能光电科技有限公司 | Task arrangement method |
| CN111210172A (en) * | 2020-04-21 | 2020-05-29 | 成都派沃特科技股份有限公司 | Method, device, equipment and storage medium for dispatching police officers |
| CN111311078A (en) * | 2020-01-21 | 2020-06-19 | 青梧桐有限责任公司 | Rent work order distribution method, system, electronic equipment and readable storage medium |
-
2020
- 2020-08-13 CN CN202010814641.6A patent/CN111950908A/en active Pending
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080244584A1 (en) * | 2007-03-26 | 2008-10-02 | Smith Gary S | Task scheduling method |
| WO2017165941A1 (en) * | 2016-03-31 | 2017-10-05 | Cae Inc. | Method, device and system for continuously recommending a deployment of emergency vehicle units |
| US20170357256A1 (en) * | 2016-06-14 | 2017-12-14 | Fuji Xerox Co., Ltd. | Robot control system and recording medium |
| US20180322442A1 (en) * | 2017-05-05 | 2018-11-08 | Servicenow, Inc. | Systems and methods for dynamically scheduling tasks across an enterprise |
| CN107657379A (en) * | 2017-09-26 | 2018-02-02 | 广州平云小匠科技有限公司 | Task preferentially distributing method, device and system |
| CN108074642A (en) * | 2017-12-29 | 2018-05-25 | 青岛大学附属医院 | Emergency medical service method and system, computer installation and readable storage medium storing program for executing |
| CN109830092A (en) * | 2017-12-30 | 2019-05-31 | 湖南汇博电子科技股份有限公司 | Fire-fighting and rescue dispatching method, device and readable storage medium storing program for executing |
| CN108876140A (en) * | 2018-06-12 | 2018-11-23 | 广东电网有限责任公司 | A kind of dispatching method, device, server and the medium of power communication maintenance task |
| CN109325702A (en) * | 2018-10-10 | 2019-02-12 | 宁夏峰尚科技有限公司 | Method for scheduling task and device |
| CN110276548A (en) * | 2019-06-20 | 2019-09-24 | 北京三快在线科技有限公司 | A kind of distribution method and device of dispatching business |
| CN110472849A (en) * | 2019-08-01 | 2019-11-19 | 阳光财产保险股份有限公司 | Maintenance task dispatching method, client and server-side |
| CN110826930A (en) * | 2019-11-12 | 2020-02-21 | 杭州安恒信息技术股份有限公司 | Security task scheduling method, device, equipment and readable storage medium |
| CN111027873A (en) * | 2019-12-16 | 2020-04-17 | 广州星迪智能光电科技有限公司 | Task arrangement method |
| CN111311078A (en) * | 2020-01-21 | 2020-06-19 | 青梧桐有限责任公司 | Rent work order distribution method, system, electronic equipment and readable storage medium |
| CN111210172A (en) * | 2020-04-21 | 2020-05-29 | 成都派沃特科技股份有限公司 | Method, device, equipment and storage medium for dispatching police officers |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113592224A (en) * | 2021-06-21 | 2021-11-02 | 同伦拍拍科技服务有限公司 | Bad asset disposal management system |
| CN115509723A (en) * | 2022-11-01 | 2022-12-23 | 中科雨辰科技有限公司 | Data processing system for acquiring non-target task object |
| CN115686847A (en) * | 2022-11-01 | 2023-02-03 | 中科雨辰科技有限公司 | Data processing system for acquiring target task object |
| CN115936331A (en) * | 2022-11-01 | 2023-04-07 | 中科雨辰科技有限公司 | Data processing system for obtaining target task object based on distance |
| CN115509723B (en) * | 2022-11-01 | 2023-10-20 | 中科雨辰科技有限公司 | Data processing system for acquiring non-target task object |
| CN115936331B (en) * | 2022-11-01 | 2023-10-27 | 中科雨辰科技有限公司 | Data processing system for acquiring target task object based on distance |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111950908A (en) | Scheduling task configuration pushing method and device, computer and storage medium | |
| CN107146012B (en) | Risk event processing method and system | |
| CN110839055B (en) | Task processing method, device and system | |
| CN108269386B (en) | Short message sending device, short message issuing device and system for emergency early warning information | |
| CN111143163B (en) | Data monitoring method, device, computer equipment and storage medium | |
| US20190261154A1 (en) | Communication between responders | |
| CN108446172B (en) | Data calling method and device, computer equipment and storage medium | |
| CN107577578B (en) | Method, device and equipment for counting delay of NFS operation word and storage medium | |
| CN111507571B (en) | Emergency group scheduling method, device, computer equipment and storage medium | |
| CN112511580A (en) | Message pushing method, device, storage medium and equipment | |
| WO2019140738A1 (en) | Method for avoiding excess return visits, and electronic apparatus and computer-readable storage medium | |
| CN109697112B (en) | Distributed intensive one-stop operating system and implementation method | |
| CN106802821B (en) | Method and device for identifying installation source of application program | |
| CN109918099A (en) | Service routine dissemination method, device, computer equipment and storage medium | |
| CN110888790B (en) | Log management method and device, electronic equipment and storage medium | |
| CN113010306A (en) | Service data processing method and device, computer equipment and storage medium | |
| CN112187898A (en) | Data access system, method and device based on public security network | |
| CN112182295A (en) | Business processing method and device based on behavior prediction and electronic equipment | |
| CN112818204B (en) | Service processing method, device, equipment and storage medium | |
| CN113806438A (en) | Warehousing and preprocessing method and system based on massive BCP data files | |
| CN112330291A (en) | Remote service auditing method and device, computer equipment and storage medium | |
| CN113676244B (en) | Control method and system based on satellite mobile communication terminal | |
| CN111857914B (en) | Method and device for acquiring operation information of application program on terminal, storage medium and terminal | |
| CN110764970B (en) | Event monitoring information processing method, system and computer readable storage medium | |
| CN111836243B (en) | Information processing method, system and equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |