CN117764343A - Task assignment method and system - Google Patents
Task assignment method and system Download PDFInfo
- Publication number
- CN117764343A CN117764343A CN202311790431.8A CN202311790431A CN117764343A CN 117764343 A CN117764343 A CN 117764343A CN 202311790431 A CN202311790431 A CN 202311790431A CN 117764343 A CN117764343 A CN 117764343A
- Authority
- CN
- China
- Prior art keywords
- task
- cleaning
- information
- reporting
- time
- 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
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000004140 cleaning Methods 0.000 claims abstract description 213
- 238000012216 screening Methods 0.000 claims description 8
- 238000012163 sequencing technique Methods 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 4
- 238000012545 processing Methods 0.000 description 12
- 238000004422 calculation algorithm Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 238000004590 computer program Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 238000007499 fusion processing Methods 0.000 description 1
- 239000011521 glass Substances 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000012549 training Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a task assignment method and a system, wherein the method comprises the following steps: acquiring a plurality of reporting task information; the reporting task information comprises reporting time, task type, task area and task deadline; predicting task duration according to task types; calculating the priority of the reporting task according to the reporting time, the task duration, the task type, the task area and the task deadline; acquiring cleaning information; the cleaning information comprises cleaning ID, cleaning work content, cleaning position information and cleaning time information; determining a target cleaning ID according to the priority of the reporting task, the cleaning work content, the cleaning position information and the cleaning time information; and sending the task to the target cleaning ID according to the priority of the reported task.
Description
Technical Field
The present invention relates to the field of data processing, and in particular, to a task dispatch method and system.
Background
When the property is used for arranging the cleaning task, the property can only perform fixed time arrangement on a fixed area, temporary occurrences or customer complaints cannot be treated in time, and temporary scheduling cannot be reasonably arranged, because the working position of the cleaning personnel cannot be obtained in real time or whether the cleaning personnel have tasks to do again, so that a long time can be taken to find a proper person, for example, the property has a problem in receiving the customer complaints, the property needs to explain the situation of the cleaning lead, the lead can need to go to the scene to determine what is, needs several people, needs tools and the like, then reorganizes the personnel to find the proper person, and the series of operations take a long time, what is a method to skip the complicated procedures in the middle?
The complex and fixed processes can be automatically processed, and after the reporting task is received, proper personnel can be directly found, so that the problem can be solved as soon as possible.
Disclosure of Invention
The embodiment of the invention aims to provide a task order sending method and a task order sending system, which are used for solving the problems in the prior art.
In a first aspect, the present invention provides a task dispatch method, the method including:
acquiring a plurality of reporting task information; the reporting task information comprises reporting time, task type, task area and task deadline;
predicting task duration according to the task type;
calculating the priority of the reporting task according to the reporting time, the task duration, the task type, the task area and the task deadline;
acquiring cleaning information; the cleaning information comprises a cleaning ID, cleaning work content, cleaning position information and cleaning time information;
determining a target cleaning ID according to the priority of the reporting task, the cleaning work content, the cleaning position information and the cleaning time information;
and sending the task to a target cleaning ID according to the priority of the reporting task.
In one possible implementation manner, the predicting the task duration according to the task type specifically includes:
through tau n+1 ＝α*τ n +(1-α)*τ n Predicting task duration;
wherein τ n The n-th task duration; τ n+1 Is the n+1th task duration; alpha is an empirical value representing the relevant value of the same type of task.
In one possible implementation manner, calculating the priority of the task according to the reporting time, the task duration, the task type, the task area and the task deadline specifically includes:
calculating first dimension information of each reporting task according to the reporting time;
calculating second dimension information of each reporting task according to the task duration;
according to the task area and the task type, calculating third dimension information of the reported task;
calculating fourth dimension information of the reporting task according to the task deadline;
calculating target dimension information of a task according to the first dimension information and/or the second dimension information and/or the third dimension information and/or the fourth dimension information;
and determining the priority of each reporting task according to the target dimension information of each reporting task.
In one possible implementation manner, the calculating the second dimension information of each reporting task according to the task duration specifically includes:
determining the waiting time of the task;
and calculating second dimension information of the reporting task according to the reporting time and the waiting time.
In one possible implementation manner, the calculating third dimension information of the reporting task according to the task area and the task type specifically includes:
according to the people flow information, determining first importance degree information of a task area;
determining second importance information of each task type according to the task type information;
and calculating third dimension information of the reporting task according to the first importance degree information and the second importance degree information.
In one possible implementation manner, calculating the priority of the task according to the reporting time, the task duration, the task type, the task area and the task deadline specifically includes:
according to the task areas and the task types, reporting tasks with the same task areas and the same task types are arranged in the same queue; each queue has a priority according to the task type;
and sequencing the priority of the reporting tasks of the same queue according to the first dimension information, the second dimension information and/or the fourth dimension information.
In one possible implementation manner, the determining the target cleaning ID according to the priority of the reporting task, the cleaning work content, the cleaning position information and the cleaning time information specifically includes:
according to the task area and the task type, determining a cleaning ID which is consistent with the task type in the task area;
acquiring cleaning position information and cleaning time information of the cleaning ID;
screening the cleaning ID according to the cleaning position information and the cleaning time information to obtain a target cleaning ID;
and sending the reporting task of the same queue to the screened target cleaning ID according to the priority.
In one possible implementation manner, the determining the target cleaning ID according to the priority of the reporting task, the cleaning work content, the cleaning position information and the cleaning time information specifically includes:
determining task intensity information according to the task type;
according to the task intensity information, determining a cleaning ID which is consistent with the task type in the task area;
acquiring cleaning time information of the cleaning ID;
screening the cleaning ID according to the cleaning time information to obtain a target cleaning ID;
sequencing the priority of the reporting tasks of the same queue according to the fourth-dimension information;
and sending the report tasks in the queue to the target cleaning ID according to the order of the deadline.
In one possible implementation, the method further includes:
determining keywords of the reporting task information;
and determining the target cleaning ID according to the cleaning work content.
In a second aspect, the present invention provides a task order system, the system comprising:
the first acquisition module is used for acquiring a plurality of reporting task information; the reporting task information comprises reporting time, task type, task area and task deadline;
the prediction module is used for predicting task duration according to the task type;
the calculation module is used for calculating the priority of the reporting task according to the reporting time, the task duration, the task type, the task area and the task deadline;
the second acquisition module is used for acquiring the cleaning information; the cleaning information comprises a cleaning ID, cleaning work content, cleaning position information and cleaning time information;
the determining module is used for determining a target cleaning ID according to the priority of the reporting task, the cleaning work content, the cleaning position information and the cleaning time information;
and the sending module is used for sending the task to a target cleaning ID according to the priority of the reporting task.
In a third aspect, the present invention provides a computer server comprising: memory, processor, and transceiver;
the processor is used for coupling with the memory, reading and executing the instructions in the memory to realize the task dispatch method of the first aspect;
the transceiver is coupled to the processor and is controlled by the processor to transmit and receive messages.
In a fourth aspect, the present invention provides a chip system, comprising a processor coupled to a memory, the memory storing program instructions that when executed by the processor implement the task dispatch method of any one of the first aspects.
In a fifth aspect, the present invention provides a computer readable storage medium having a computer program stored thereon, the computer program being executed by a processor to perform the task assignment method according to any one of the first aspects.
By applying the task scheduling method provided by the embodiment of the invention, aiming at the reported task, the priority of the reported task is calculated according to the reporting time, the task duration, the task type, the task area and the task deadline; according to the priority of the reporting task, the task is sent to the target cleaning ID, so that the reporting task is automatically and rapidly distributed to cleaning staff, the priority of the task is considered, the cleaning priority is also considered, and the matching degree between the task and the cleaning staff is improved in the distribution process.
Drawings
FIG. 1 is a flowchart of a task dispatch method according to an embodiment of the present invention;
FIG. 2 is a diagram illustrating the job time of 4 tasks according to a first embodiment of the present invention;
FIG. 3 is a schematic diagram of the 4 tasks of FIG. 2 ordered according to a shortest job first algorithm;
FIG. 4 is a schematic diagram of a task order device according to a second embodiment of the present invention;
fig. 5 is a schematic diagram of a computer server according to a third embodiment of the present invention;
fig. 6 is a schematic diagram of a chip system according to a fourth embodiment of the present invention;
fig. 7 is a schematic structural diagram of a computer readable storage medium according to a fifth embodiment of the present invention.
Detailed Description
The present application is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be combined with each other. The present application will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Example 1
The first embodiment of the invention provides a task dispatching method which can be applied to the processing of cleaning tasks which are temporarily reported, such as reporting type tasks of temporary reporting, complaint suggestions and the like, and the task has high processing time limit requirements. The execution subject of the present application is a device, a terminal, a server, or the like having an arithmetic capability. As shown in fig. 1, the present application includes the steps of:
step 110, obtaining a plurality of reporting task information; the reporting task information comprises reporting time, task type, task area and task deadline;
specifically, the task information may be information of a problem reported by a user through an applet during use, or complaint of the user, or a problem found by a manager during inspection.
The reporting time is the time when the server receives the reporting task information, the task type is the type of the reporting task, for example, the reporting task information can be divided into complaints, tours and the like according to the source of the reporting task information, the task area is a problematic area, for example, the floor of the A land, the hand sink of the B land, and the task deadline is the time when the task needs to be completed before the time.
Step 120, predicting task duration according to task type;
in some reporting tasks, the task duration is not set, and the historical task duration corresponding to the task type can be queried, so that the task duration is determined according to the historical task duration.
Specifically, the application can be performed by τ n+1 ＝α*τ n +(1-α)*τ n Predicting task duration;
wherein τ n The n-th task duration; τ n+1 Is the n+1th task duration; alpha is an empirical value representing the relevant value of the same type of task.
If α=0, τ n+1 ＝τ n The historical task duration can be directly used as the task duration of this time.
Step 130, calculating the priority of the reporting task according to the reporting time, the task duration, the task type, the task area and the task deadline;
in one example, first dimension information of each reporting task is calculated according to reporting time; calculating second dimension information of each reporting task according to the task duration; according to the task area and the task type, calculating third dimension information of the reported task; calculating fourth dimension information of the reporting task according to the task deadline; calculating target dimension information of the task according to the first dimension information, and/or the second dimension information, and/or the third dimension information, and/or the fourth dimension information; and determining the priority of each reporting task according to the target dimension information of each reporting task.
Specifically, the priorities of the tasks with different reporting times are represented by the first dimension information. The first dimension information represents an association relationship between the reporting time and the task priority, for example, the first dimension information may be a functional representation, an association relationship, or scoring information between the reporting time and the priority of the reporting task. The second dimension information represents an association relationship between the task duration and the task priority, for example, the second dimension information may be a functional representation, or an association relationship, or scoring information between the task duration and the task priority. The third dimension information may be an association between the task area, the task type, and the task priority, for example, the third dimension information representation is a functional representation, an association, or scoring information between the task area, the task type, and the task priority. The fourth dimension information represents an association between the deadline and the task priority, for example, the fourth dimension information may be a function representation, an association formula, or scoring information.
The method and the device can perform fusion processing on the first dimension information to the fourth dimension information to obtain target dimension information, for example, weight values of each dimension information are obtained through training through historical data in advance, and therefore the target dimension information is obtained through fusion according to the weight values.
Specifically, the priority confirmation is performed according to the working time, and the method has the following theoretical basis:
as shown in fig. 2, the 4 jobs a, B, C, D have respective job times 8,4,4,4, and if run sequentially in fig. 2, the a, B, C, D turnarounds are 8, 12, 16, 20, and the average turnarounds are 14 minutes ((8+12+16+20)/4=14). The turn-around time is the time required from task submission to task completion, including waiting time and running time, and by the shortest job priority algorithm, as shown in fig. 3, the turn-around time of a, B, C and D is 4, 8, 12 and 20, and the average turn-around time is 11 minutes.
Assuming the case of 4 jobs, the run times are a, b, c, d, respectively, the first job ends at time a, the second ends at time a+b, and so on. The average turn-around time is (4a+3b+2c+d)/4. It is clear that a has the greatest effect on the average, so a should be the shortest priority job, followed by b, then c, and finally d it only affects its turn-around time. Therefore, the method and the device can order the reporting tasks according to the shortest job priority algorithm and the task duration.
The theoretical basis for determining the third dimension information according to the task area and the task type is as follows:
and each task area can determine first importance degree information according to the traffic of people, second importance degree information is arranged between each type of tasks, and third importance degree information is obtained through calculation according to the first importance degree information and the second importance degree information.
In an example, the first importance degree information is represented by a weight value, for example, the people flow of each area is collected in real time, the first importance degree information of each task area is distinguished by the weight value according to the people flow of a preset duration, and accordingly, each task type has the importance degree information, and the second importance degree information of the task type can be distinguished by the weight value, so that the application can obtain the third dimension information according to the task area and the task type.
The emergency degree of the reporting task can be judged through the deadline, and the fourth-dimension information of each reporting task can be obtained according to the deadline. For example, the fourth dimension information may be scoring information, as shown in table 1:
| time (deadline-current time) | Priority level |
| ≤10(min) | 10 |
| 10<t≤20(min) | 7 |
| ...... |
TABLE 1
In this embodiment, the application may calculate the target dimension information of the task according to the first dimension information, and/or the second dimension information, and/or the third dimension information, and/or the fourth dimension information.
Furthermore, when calculating the second dimension information, the method can also calculate by combining the waiting time, and specifically, the waiting time of the task is determined; and calculating second dimension information of the reporting task according to the reporting time and the waiting time. Where latency = start time-commit time. The second dimension information is associated with (latency + task duration)/task duration.
As shown in table 2:
TABLE 2
In table 2: the first task: r1= [2+ (8:00-8:00) ]/2=1; i.e. the first task selects task a;
the second task: due to the first task 10:00 is completed, then assume that the start time of the second task is 10:00, calculating the value when B is taken as the second task
R2= [50+ (10:00-8:50) ]/50=2.4; calculating a value r3= [10+ (10:00-9:00) ]/10=7 when B is taken as the second task; calculating the value r4= [20+ (10:00-9:50) ]/20=1.5 when C is taken as the second task; c is selected as the second task because the corresponding value of C is the largest;
third task: since the completion time of the second task C is 10:10, assume that the start time of the third task is 10:10 calculating the value of B as the third task
R2= [50+ (10:10-8:50) ]/50=2.6; calculating a value r4= [20+ (10:10-9:50) ]/20=2 when D is taken as the third task; b is selected as a third task because B corresponds to the maximum value;
fourth task: since the completion time of the third task B is 11:00, assume that the start time of the fourth task is 11:00, calculating the value when D is taken as the fourth task
R2= [20+ (11:00-9:50) ]/20=4.5, so the fourth task selects D.
In another alternative implementation, to avoid walking around, resulting in time waste on the tool's find or road, the region tasks or the same type of task are ordered by multi-level queue priority.
According to the task area and the task type, reporting tasks with the same task area and the same task type are arranged in the same queue; each queue has a priority according to the task type; and sequencing the priority of the reporting tasks of the same queue according to the first dimension information, the second dimension information and/or the fourth dimension information.
A plurality of ready queues are arranged, and different priorities are respectively given, such as gradual reduction. For example, the queue 1 is a task of the same type in a region, for example, a garbage can for cleaning a toilet is arranged behind the queue when the toilet has the task for cleaning the garbage can, so that the task for cleaning the garbage can is completed and then the next task for the queue is carried out; the queue 2 is a zone task, when the cleaning is performed and the floor is cleaned, a glass cleaning task is carried out on the zone, the task is arranged behind the queue until the zone is completed, and the next task is executed again.
Step 140, acquiring cleaning information;
specifically, the cleaning ID, the cleaning work content, the cleaning position information and the cleaning time information in the task area can be obtained according to the task area. The cleaning content and the cleaning time information can be associated with a cleaning ID, and the cleaning content and the cleaning time information can be obtained by inquiring the cleaning ID, wherein the cleaning time information comprises, but is not limited to, a scheduling table, a working time and a working time.
Step 150, determining a target cleaning ID according to the priority of the reporting task, the cleaning work content, the cleaning position information and the cleaning time information;
and 160, sending the task to the target cleaning ID according to the priority of the reported task.
In an alternative implementation, determining a cleaning ID which is consistent with the task type in the task area according to the task area and the task type; acquiring cleaning position information and cleaning time information of the cleaning ID; screening the cleaning ID according to the cleaning position information and the cleaning time information to obtain a target cleaning ID; and sending the report tasks of the same queue to the screened target cleaning ID according to the priority.
In another example, task strength information is determined based on task type; according to the task intensity information, determining a cleaning ID which is consistent with the task type in the task area; acquiring cleaning time information of the cleaning ID; screening the cleaning ID according to the cleaning time information to obtain a target cleaning ID; sequencing the priority of the reporting tasks of the same queue according to the fourth-dimension information; and sending the report tasks in the queue to the target cleaning ID according to the order of the deadline.
The task type can be specific contents such as mopping, maintenance equipment, lawn cleaning and the like, and the cleaning information can also comprise cleaning age, cleaning sex and cleaning skill, so that the task strength is determined according to the task type, and cleaning IDs which are satisfied by the age, sex and cleaning skill are obtained through screening.
In still another alternative implementation manner, the present application may also determine the cleaning ID in the task area through the task area, and then sequentially send the task to the cleaning ID according to the cleaning information, including the cleaning time information, and according to the reporting time of the task.
In still another alternative implementation manner, the present application may further determine the cleaning ID in the task area through the task area, and then sequentially send the task to the cleaning ID according to the cleaning information, including the cleaning time information, and according to the task duration.
In yet another alternative implementation, the present application may also send the task to the cleaning ID via the task deadline.
In still another alternative implementation manner, the present application may further send the report task information to the cleaning ID according to the cleaning content, and divide the working content for each cleaning person, for example, a is responsible for ground working, B is responsible for wall working, C is responsible for maintaining the elevator, and for the report task information, keyword screening is performed, for example, if the report content is bad, the report task information is pushed to the person responsible for maintaining the elevator according to the report content.
In yet another alternative implementation, the target cleaning ID is determined based on the task area and the cleaning time information; and sending the report task to the target cleaning ID according to the task duration. This algorithm is to ensure fairness. The basic idea is that if a plurality of tasks exist at the same time, the tasks are firstly distributed evenly according to the working time of the tasks, if the tasks are more, the rest of the tasks are distributed evenly to other people again, and if the tasks are not enough, the tasks need to wait. If the reporting task is the sequential reporting, the cleaning time is required by the cleaning time from the off-duty time to the cleaning time of the existing task, the working time required by the reporting task is required by the reporting task, and the reporting task is preferentially distributed to the cleaning with more residual time.
The scene is shown in Table 3, two cleaning A and B are present.
| Cleaning keeping clean | Time required for existing task | Time from work hours |
| A | 40 minutes | For 2 hours |
| B | 50 minutes | 1 hour |
TABLE 3 Table 3
The task duration of the four reporting tasks is shown in table 4:
TABLE 4 Table 4
The residual time of the cleaning A is 80 minutes, and the residual time of the cleaning B is 10 minutes. And arranging a task 3 and a task 4 for the cleaning A according to the task duration, arranging a task 1 for the cleaning B, reserving the task 2, and continuing to wait for other cleaning to work.
If the rest time of the cleaning staff is too long, but the time required by the task is still not met, the cleaning staff can be smoothly used for cleaning the next time. For example, the remaining time of the cleaning A is 50 minutes, the time required for a new task is 60 minutes, the task still needs to be assigned to the cleaning A, and when the cleaning A is checked out and is off duty, if the task is not completed, the task is redistributed to cleaning personnel meeting the conditions.
In still another optional implementation manner, the method can also predict task tools according to task types, judge whether cleaning carries task tools, when cleaning does not carry task tools, obtain transit time between a storage chamber of task tools and cleaning position information, judge whether reporting tasks have association relations with other tasks, and calculate completion time of the association tasks when the association relations exist, so that target time is calculated according to transit time and/or association time, and a target cleaning ID is determined according to target time; and sending the reporting tasks of the same queue to the target cleaning ID according to the priority.
For example, the remaining time T1 of the person currently in the working state and the person in the idle state; time T2 for personnel to take tools; task duration T3; the task needs to rely on the time T4 for completing other tasks; and obtaining the target time according to the sum of T1, T2, T3 and T4.
By applying the task scheduling method provided by the embodiment of the invention, aiming at the reported task, the priority of the reported task is calculated according to the reporting time, the task duration, the task type, the task area and the task deadline; according to the priority of the reporting task, the task is sent to the target cleaning ID, so that the reporting task is automatically and rapidly distributed to cleaning staff, the priority of the task is considered, the cleaning priority is also considered, and the matching degree between the task and the cleaning staff is improved in the distribution process.
Example two
A second embodiment of the present invention provides a task order system, as shown in FIG. 4, including: a first acquisition module 410, a prediction module 420, a calculation module 430, a second acquisition module 440, a determination module 450, and a transmission module 460.
The first obtaining module 410 is configured to obtain a plurality of reporting task information; the reporting task information comprises reporting time, task type, task area and task deadline;
the prediction module 420 is configured to predict a task duration according to a task type;
the calculating module 430 is configured to calculate a priority of the reporting task according to the reporting time, the task duration, the task type, the task area, and the task deadline;
the second obtaining module 440 is configured to obtain sanitation information; the cleaning information comprises cleaning ID, cleaning work content, cleaning position information and cleaning time information;
the determining module 450 is configured to determine a target cleaning ID according to the priority of the reporting task, the cleaning content, the cleaning position information, and the cleaning time information;
the sending module 460 sends the task to the target cleaning ID according to the priority of the reporting task.
The device provided in the second embodiment of the present invention may perform the method steps in the first embodiment of the method, and its implementation principle and technical effects are similar, and are not described herein again.
It should be noted that, it should be understood that the division of the modules of the above apparatus is merely a division of a logic function, and may be fully or partially integrated into a physical entity or may be physically separated. And these modules may all be implemented in software in the form of calls by the processing element; or can be realized in hardware; the method can also be realized in a form of calling software by a processing element, and the method can be realized in a form of hardware by a part of modules. For example, the determining module may be a processing element that is set up separately, may be implemented in a chip of the above apparatus, or may be stored in a memory of the above apparatus in the form of program code, and may be called by a processing element of the above apparatus and execute the functions of the determining module. The implementation of the other modules is similar. In addition, all or part of the modules can be integrated together or can be independently implemented. The processing element described herein may be an integrated circuit having signal processing capabilities. In implementation, each step of the above method or each module above may be implemented by an integrated logic circuit of hardware in a processor element or an instruction in a software form.
For example, the modules above may be one or more integrated circuits configured to implement the methods above, such as: one or more specific integrated circuits (Application Specific Integrated Circuit, ASIC), or one or more microprocessors (Digital Signal Processor, DSP), or one or more field programmable gate arrays (Field Programmable Gate Array, FPGA), or the like. For another example, when a module above is implemented in the form of a processing element scheduler code, the processing element may be a general purpose processor, such as a central processing unit (CentralProcessing Unit, CPU) or other processor that may invoke the program code. For another example, the modules may be integrated together and implemented in the form of a System-on-a-chip (SOC).
In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, produces, in whole or in part, the procedures or functions described in accordance with embodiments of the present application. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wired (e.g., coaxial cable, fiber optic, digital subscriber line ((Digital Subscriber Line, DSL)), or wireless (e.g., infrared, wireless, bluetooth, microwave, etc.) means, the computer-readable storage medium may be any available medium that can be accessed by the computer or a data storage device such as a server, data center, etc., that contains an integration of one or more available media, the available media may be magnetic media (e.g., floppy disk, hard disk, tape), optical media (e.g., DVD), or semiconductor media (e.g., solid state disk, SSD), etc.
Example III
A third embodiment of the present invention provides a computer server, as shown in FIG. 5, including: memory, processor, and transceiver;
the processor is coupled to the memory, reads and executes the instructions in the memory, so as to implement any one of the task dispatch methods provided in the first embodiment;
the transceiver is coupled to the processor, and the processor controls the transceiver to transmit and receive messages.
Example IV
A fourth embodiment of the present invention provides a chip system, as shown in fig. 6, including a processor, where the processor is coupled to a memory, and the memory stores program instructions, and when the program instructions stored in the memory are executed by the processor, any one of the task assignment methods provided in the first embodiment is implemented.
Example five
A fifth embodiment of the present invention provides a computer readable storage medium, as shown in fig. 7, including a program or an instruction, where when the program or the instruction runs on a computer, any one of the task assignment methods provided in the first embodiment is implemented.
Those of skill would further appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative elements and steps are described above generally in terms of function in order to clearly illustrate the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied in hardware, in a software module executed by a processor, or in a combination of the two. The software modules may be disposed in Random Access Memory (RAM), memory, read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
The foregoing detailed description of the invention has been presented for purposes of illustration and description, and it should be understood that the invention is not limited to the particular embodiments disclosed, but is intended to cover all modifications, equivalents, alternatives, and improvements within the spirit and principles of the invention.
Claims (10)
1. A method of task dispatch, the method comprising:
acquiring a plurality of reporting task information; the reporting task information comprises reporting time, task type, task area and task deadline;
predicting task duration according to the task type;
calculating the priority of the reporting task according to the reporting time, the task duration, the task type, the task area and the task deadline;
acquiring cleaning information; the cleaning information comprises a cleaning ID, cleaning work content, cleaning position information and cleaning time information;
determining a target cleaning ID according to the priority of the reporting task, the cleaning work content, the cleaning position information and the cleaning time information;
and sending the reporting task to a target cleaning ID according to the priority of the reporting task.
2. The method according to claim 1, wherein predicting task duration according to the task type specifically includes:
through tau n+1 ＝α*τ n +(1-α)*τ n Predicting task duration;
wherein τ n The n-th task duration; τ n+1 Is the n+1th task duration; alpha is an empirical value representing the relevant value of the same type of task.
3. The method of claim 1, wherein calculating the priorities of the tasks according to the reporting time, the task duration, the task type, the task area, and the task deadline specifically comprises:
calculating first dimension information of each reporting task according to the reporting time;
calculating second dimension information of each reporting task according to the task duration;
according to the task area and the task type, calculating third dimension information of the reported task;
calculating fourth dimension information of the reporting task according to the task deadline;
calculating target dimension information of a task according to the first dimension information and/or the second dimension information and/or the third dimension information and/or the fourth dimension information;
and determining the priority of each reporting task according to the target dimension information of each reporting task.
4. The method of claim 3, wherein calculating second dimension information of each reporting task according to task duration specifically includes:
determining the waiting time of the task;
and calculating second dimension information of the reporting task according to the reporting time and the waiting time.
5. The method of claim 3, wherein calculating third dimension information of the reporting task according to the task area and the task type specifically includes:
according to the people flow information, determining first importance degree information of a task area;
determining second importance information of each task type according to the task type information;
and calculating third dimension information of the reporting task according to the first importance degree information and the second importance degree information.
6. The method of claim 3, wherein calculating the priorities of the tasks according to the reporting time, the task duration, the task type, the task area, and the task deadline specifically includes:
according to the task areas and the task types, reporting tasks with the same task areas and the same task types are arranged in the same queue; each queue has a priority according to the task type;
and sequencing the priority of the reporting tasks of the same queue according to the first dimension information, the second dimension information and/or the fourth dimension information.
7. The method of claim 6, wherein determining the target cleaning ID based on the priority of the reporting task, the cleaning work content, the cleaning location information, and the cleaning time information comprises:
according to the task area and the task type, determining a cleaning ID which is consistent with the task type in the task area;
acquiring cleaning position information and cleaning time information of the cleaning ID;
screening the cleaning ID according to the cleaning position information and the cleaning time information to obtain a target cleaning ID;
and sending the reporting task of the same queue to the screened target cleaning ID according to the priority.
8. The method of claim 6, wherein determining the target cleaning ID based on the priority of the reporting task, the cleaning work content, the cleaning location information, and the cleaning time information comprises:
determining task intensity information according to the task type;
according to the task intensity information, determining a cleaning ID which is consistent with the task type in the task area;
acquiring cleaning time information of the cleaning ID;
screening the cleaning ID according to the cleaning time information to obtain a target cleaning ID;
sequencing the priority of the reporting tasks of the same queue according to the fourth-dimension information;
and sending the report tasks in the queue to the target cleaning ID according to the order of the deadline.
9. The method according to claim 1, wherein the method further comprises:
determining keywords of the reporting task information;
and determining the target cleaning ID according to the cleaning work content.
10. A task order system, the system comprising:
the first acquisition module is used for acquiring a plurality of reporting task information; the reporting task information comprises reporting time, task type, task area and task deadline;
the prediction module is used for predicting task duration according to the task type;
the calculation module is used for calculating the priority of the reporting task according to the reporting time, the task duration, the task type, the task area and the task deadline;
the second acquisition module is used for acquiring the cleaning information; the cleaning information comprises a cleaning ID, cleaning work content, cleaning position information and cleaning time information;
the determining module is used for determining a target cleaning ID according to the priority of the reporting task, the cleaning work content, the cleaning position information and the cleaning time information;
and the sending module is used for sending the task to a target cleaning ID according to the priority of the reporting task.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311790431.8A CN117764343A (en) | 2023-12-22 | 2023-12-22 | Task assignment method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311790431.8A CN117764343A (en) | 2023-12-22 | 2023-12-22 | Task assignment method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117764343A true CN117764343A (en) | 2024-03-26 |
Family
ID=90310209
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311790431.8A Pending CN117764343A (en) | 2023-12-22 | 2023-12-22 | Task assignment method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117764343A (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114037293A (en) * | 2021-11-11 | 2022-02-11 | 中国建设银行股份有限公司 | Task allocation method, device, computer system and medium |
| CN114579265A (en) * | 2020-12-02 | 2022-06-03 | 腾讯科技（深圳）有限公司 | Task query method and device and storage medium |
| CN115438821A (en) * | 2022-09-15 | 2022-12-06 | 中国银行股份有限公司 | Intelligent queuing method and related device |
| CN115660694A (en) * | 2022-09-29 | 2023-01-31 | 三一集团有限公司 | After-sales service order distribution method, device and machine |
| CN115907413A (en) * | 2022-12-14 | 2023-04-04 | 北京小趣智品科技有限公司 | Cleaning task processing method and device |
| CN115965197A (en) * | 2022-12-14 | 2023-04-14 | 北京小趣智品科技有限公司 | Cleaning task order sending method and device |
| CN116151547A (en) * | 2022-12-14 | 2023-05-23 | 北京小趣智品科技有限公司 | Cleaning task execution method and device |
| CN116402315A (en) * | 2023-06-01 | 2023-07-07 | 北京容大友信科技有限公司 | Event reporting task response method and device |
| CN116542781A (en) * | 2023-05-05 | 2023-08-04 | 中国平安财产保险股份有限公司 | Task allocation method, device, computer equipment and storage medium |
-
2023
- 2023-12-22 CN CN202311790431.8A patent/CN117764343A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114579265A (en) * | 2020-12-02 | 2022-06-03 | 腾讯科技（深圳）有限公司 | Task query method and device and storage medium |
| CN114037293A (en) * | 2021-11-11 | 2022-02-11 | 中国建设银行股份有限公司 | Task allocation method, device, computer system and medium |
| CN115438821A (en) * | 2022-09-15 | 2022-12-06 | 中国银行股份有限公司 | Intelligent queuing method and related device |
| CN115660694A (en) * | 2022-09-29 | 2023-01-31 | 三一集团有限公司 | After-sales service order distribution method, device and machine |
| CN115907413A (en) * | 2022-12-14 | 2023-04-04 | 北京小趣智品科技有限公司 | Cleaning task processing method and device |
| CN115965197A (en) * | 2022-12-14 | 2023-04-14 | 北京小趣智品科技有限公司 | Cleaning task order sending method and device |
| CN116151547A (en) * | 2022-12-14 | 2023-05-23 | 北京小趣智品科技有限公司 | Cleaning task execution method and device |
| CN116542781A (en) * | 2023-05-05 | 2023-08-04 | 中国平安财产保险股份有限公司 | Task allocation method, device, computer equipment and storage medium |
| CN116402315A (en) * | 2023-06-01 | 2023-07-07 | 北京容大友信科技有限公司 | Event reporting task response method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108683818B (en) | Method, system, equipment and storage medium for distributing seats in call center | |
| US7302450B2 (en) | Workload scheduler with resource optimization factoring | |
| CN109766175A (en) | Resource elastic telescopic system and its dispatching method towards high-performance calculation on cloud | |
| CN107682417B (en) | Task allocation method and device for data nodes | |
| KR19980042903A (en) | Production control device that can control the start of work of each equipment in the equipment group considering the buffer capacity of the equipment group | |
| CN110012062B (en) | Multi-computer-room task scheduling method and device and storage medium | |
| US10606650B2 (en) | Methods and nodes for scheduling data processing | |
| WO2018099090A1 (en) | Method and apparatus for determining main scheduler from cloud computing system | |
| Dong et al. | Off-service placement in inpatient ward network: Resource pooling versus service slowdown | |
| CN115862823B (en) | Intelligent scheduling method and system for equipment based on mobile network | |
| Babiceanu et al. | Real-time holonic scheduling of material handling operations in a dynamic manufacturing environment | |
| CN108268965A (en) | For resource allocation, for the vehicles scheduling method and its device | |
| CN115907413A (en) | Cleaning task processing method and device | |
| CN115064253A (en) | Medical equipment scheduling method, device, equipment and storage medium | |
| CN116151547A (en) | Cleaning task execution method and device | |
| CN108268543B (en) | Database acquisition method and device | |
| CN110991846A (en) | Service personnel task allocation method, device, equipment and storage medium | |
| CN117764343A (en) | Task assignment method and system | |
| CN114090259A (en) | Resource allocation method, device, electronic equipment and storage medium | |
| CN106980917A (en) | Generation objective complementary energy attendant's dispatching method | |
| JP2006107167A (en) | Scheduling system, scheduling program and scheduling method | |
| CN112990624A (en) | Task allocation method, device, equipment and storage medium | |
| CN108572862B (en) | Flow scheduling method and flow scheduling equipment | |
| CN115759565A (en) | Work order distribution method, device, equipment and computer storage medium | |
| CN108549959A (en) | Automatic send a car method and device, computer readable storage medium, terminal |
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 |