Store patrol task allocation method, system and equipment and computer readable storage medium

By adopting long-term tasks and random task allocation strategies in store inspection tasks, the problems of uneven number of executor stores and cumbersome configuration in the existing technology are solved, and the uniform distribution and efficient allocation of store inspection tasks are achieved, and the inspection is improved. Intelligence and efficiency of tasks.

CN118982172APending Publication Date: 2024-11-19SUZHOU WANDIANZHANG NETWORK TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410968556.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-19
Publication Date
2024-11-19

AI Technical Summary

Technical Problem

The existing store inspection task allocation method is based on the relationship between the person and the store, which leads to excessive or dispersed number of executors in a certain area, resulting in unnecessary overhead, and cumbersome configuration and lack of efficiency.

Method used

Using long-term tasks and random task allocation strategies, by creating random tasks, allocating stores according to the total number of store pools and preset strategies, the execution cycles until the store inspection threshold is reached, ensuring the uniformity and efficiency of store allocation, and the store pool is automatically updated to re-open. Assign tasks that do not comply with the rules.

Benefits of technology

It realizes even distribution and efficient distribution of store tasks, shortens manual allocation time, ensures that all stores can be allocated, and improves the intelligence and efficiency of store inspection tasks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118982172A_ABST
    Figure CN118982172A_ABST
Patent Text Reader

Abstract

The invention discloses a store patrol task allocation method, system and device and a computer readable storage medium, and relates to the technical field of intelligent store patrol. A long-time task including a random task is created, and the current random task is allocated to a store according to a random strategy; and when stores generated by random allocation corresponding to the random tasks are confirmed to be cited, completing the creation of the current random tasks, updating the total number of the store pools, allocating the next round of random tasks according to the sum of the updated total number of the store pools, circularly executing the next round of random tasks, and ending the tasks for a long time until the total number of the stores reaches a store patrol threshold value. According to the shop inspection task allocation method, the number of the shops is obtained in the to-be-allocated area according to the proportion, the shops with the authority of the executors in the allocation areas can be accurately and averagely allocated, the shops are repeatedly executed according to the rules, and after allocation is completed, the shops can be finely adjusted, so that the allocation efficiency is improved. And the time cost of manual dispatching is shortened. And setting an automatic updating time point in the store pool, reloading the stores which do not accord with the rule in the distributed tasks at regular time, and continuing to distribute the stores, thereby ensuring that all the stores execute the store inspection tasks.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of intelligent store patrol technology, and in particular to a store patrol task allocation method, device, equipment and computer-readable storage medium. Background Art

[0002] In the prior art, the store patrol task allocation method is based on the relationship between people and stores. This allocation method may result in one person executing a large number of stores in a certain area, or one person executing stores in scattered stores, resulting in unnecessary expenses for some executors during the execution process. In addition, this store patrol task allocation method is relatively cumbersome when configuring. In view of this, how to improve the rationality and efficiency of store patrol task allocation has become a technical problem that needs to be solved urgently by those skilled in the art. Summary of the invention

[0003] The purpose of this application is to provide a store patrol task allocation method, device, equipment and computer-readable storage medium, which can efficiently implement store patrol task allocation and more reasonably implement task allocation.

[0004] In order to solve the above technical problems, the present application provides a method for allocating store inspection tasks, including:

[0005] Creating a long-term task, wherein the long-term task includes at least one random task;

[0006] The current random task is assigned to a store according to a random strategy. When the store generated by the random assignment corresponding to the random task is confirmed and referenced, the creation of the current random task is completed, the total number of the store pool is updated, and the next round of random tasks is assigned according to the sum of the updated total number of the store pool;

[0007] The next round of random tasks is executed in a loop until the total number of stores reaches the store inspection threshold, and the long-term task ends.

[0008] In some embodiments, the long-term task parameters include the total number of stores in the store pool and the store pool update time. The total number of stores in the store pool is the number of all stores that meet the requirements of the current enterprise. Random tasks are allocated based on the number of stores and a preset random allocation strategy, and the executor of the current random task is designated.

[0009] In some embodiments, the long-term task must be affiliated with a store pool, and a random task can only be created when the total number of stores in the store pool is not zero.

[0010] In some embodiments, the random task is referenced specifically in that the store randomly selected by the random task is referenced into the corresponding task creation, and a corresponding execution task is generated.

[0011] In some embodiments, the store pool update specifically includes synchronizing the valid stores to which the user belongs, and then traversing all tasks that need to be executed that are created by random tasks, and updating the total number of stores in the store pool according to the assessment rules set when the long-term tasks are created.

[0012] In some embodiments, the store patrol execution percentage is (m*n) / total number of stores, where m is the number of store patrol executors determined by all stores of the user, and n is the number of store patrol tasks that the store patrol executor needs to complete; several executors are randomly assigned m*n store patrol tasks, and from the number of stores a that each executor is responsible for, a*(m*n / total number of stores) stores are randomly selected to perform store patrols.

[0013] In some embodiments, the total number of stores in the next round of random tasks is updated according to the current status of each store, or the total number of stores in the next round of random tasks is updated according to the status of the store inspection tasks in the last several random tasks that have been assigned and completed.

[0014] In order to solve the above technical problems, the present application also provides a store inspection task allocation system, including:

[0015] A creation module, used for creating a long-term task, wherein the long-term task includes at least one random task;

[0016] An allocation module is used to allocate stores for the current random task according to a random strategy. When the store generated by the random allocation corresponding to the random task is confirmed and referenced, the current random task creation is completed, the total number of store pools is updated, and the next round of random tasks is allocated according to the sum of the updated total number of store pools;

[0017] The loop module is used to loop and execute the next round of random tasks until the total number of stores reaches the store inspection threshold, and the long-term task ends.

[0018] In order to solve the above technical problems, the present application also provides a store inspection task allocation device, including:

[0019] Memory for storing computer programs;

[0020] A processor is used to implement the steps of the above-mentioned store inspection task allocation method when executing the computer program.

[0021] In order to solve the above technical problems, the present application also provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the store patrol task allocation method as described above are implemented.

[0022] The store inspection task allocation method, system, device and storage medium provided in the present application create a long-term task including a random task, allocate the current random task to the store according to the random strategy, and complete the creation of the current random task when the random task corresponding to the randomly allocated store is confirmed and referenced, update the total number of store pools, and allocate the next round of random tasks according to the sum of the updated total number of store pools, and execute the next round of random tasks in a loop until the total number of stores reaches the store inspection threshold and the long-term task ends. The store inspection task allocation method proposed in the present application obtains the number of stores in the area to be allocated according to the proportion, and can accurately allocate them evenly among the authorized stores of the executors in each allocated area, and repeats the execution of stores according to the rules. After the allocation is completed, the stores can be fine-tuned, which shortens the time spent on manual allocation. The store pool sets the time point for automatic update, and regularly reloads the stores that do not meet the rules in the allocated tasks and continues to allocate them, to ensure that all stores will perform the store inspection tasks.

[0023] It can be seen that the store inspection task allocation method, system, equipment and storage medium provided in the present application can distribute the stores to the executors relatively evenly, and can also automatically reallocate the stores that did not meet the requirements according to the previous execution, re-inspect these stores, and filter them according to the stores that have already been executed in the enterprise, without the need for repeated execution, so that the execution is more intelligent and efficient.

[0024] The store patrol task allocation device, equipment and computer-readable storage medium provided in this application all have the above-mentioned technical effects. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0026] Figure 1 A flowchart of a method for allocating store inspection tasks provided in an embodiment of the present application;

[0027] Figure 2 An interface diagram created for a long-duration task provided in an embodiment of the present application;

[0028] Figure 3 An interface diagram created for the random tasks provided in the embodiment of the present application;

[0029] Figure 4 A schematic diagram of a store patrol task allocation device provided in an embodiment of the present application;

[0030] Figure 5 A schematic diagram of a store patrol task allocation device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0031] The core of this application is to provide a store patrol task allocation method, device, equipment and computer-readable storage medium, which can efficiently implement store patrol task allocation and more reasonably implement task allocation.

[0032] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0033] This application integrates all valid stores under the enterprise, and randomly obtains stores in proportion in different patrol areas according to the number of people and stores who need to perform tasks, ensuring that the proportion of stores in each patrol area is the same, and obtains random stores in each patrol area. If there are enough stores, the stores obtained in the patrol area are grouped according to the regional executors in the patrol area, and the number of stores of the regional executors is used to obtain the number of stores that should be allocated to each regional executor again in proportion, ensuring that the proportion of the number of stores under each executor is the same, and then the final stores are summarized. In order to allow executors to execute quickly, the stores executed by each executor cannot span three regions, so the summarized stores are grouped by region, sorted from small to large, and assigned to executors in sequence, ensuring maximum efficiency of store patrols.

[0034] Specifically, please refer to Figure 1 , Figure 1 A flowchart of a method for allocating store inspection tasks provided in an embodiment of the present application is provided. Figure 1 As shown, the method includes:

[0035] S101: Creating a long-term task, wherein the long-term task includes at least one random task;

[0036] In some embodiments, a long-term task including one or more random tasks is created. The long-term task parameters include the total number of stores in the store pool, the store pool update time, etc. The total number of stores in the store pool is the number of all stores that meet the requirements of the current enterprise. Random tasks are assigned based on the number of stores and a preset random allocation strategy, and the executors of the current random task are designated, as well as the number of stores executed by each executor.

[0037] The long-term task is a task without a fixed end time. The end time of the long-term task is determined by the total number of stores in the relevant store pool when the long-term task is created. When the total number of stores is zero, the long-term task ends. Figure 2 As shown, the long-term task includes the plan name, store pool update time, status, store update rules, etc. The total number of stores will be obtained in real time according to the effective stores under the enterprise at the same time as the task is created, that is, the store is within the validity period and the store status is open for business. The store pool update time can be set, and the default setting is the 1st of each month; the store update rules include stores with a patrol status of "not executed" and stores with patrol scores lower than x%, where x can be set freely. The total number of stores stored in the store pool is the total number of stores to be patrolled. Long-term tasks must be affiliated with a store pool. Random tasks can only be created when the total number of stores in the store pool is not zero. One store can correspond to multiple random tasks.

[0038] S102: The current random task is assigned a store according to a random strategy. When the store generated by the random assignment corresponding to the random task is confirmed and referenced, the current random task creation is completed, the total number of the store pool is updated, and the next round of random tasks is assigned according to the sum of the updated total number of the store pool;

[0039] When the store randomly generated by the random task is confirmed and referenced, the creation of the current random task is completed. After the creation of the execution task is completed, the total number of store pools is updated, and the next round of random tasks are allocated according to the sum of the total number of store pools after the update. Among them, the random task being referenced means that the store randomly generated by the random task is referenced to the corresponding task creation, and the corresponding execution task is generated. In this embodiment, only after the current random task is referenced can the second random task be created to continue the cycle. The creation of random tasks is shown in the attached figure. Figure 3 As shown, the random task includes the executor, the number of stores executed by each person, the total number of stores executed, the number of stores that can be allocated, the proportion of the number of stores executed, etc. Among them, multiple executors can be set, and the number of stores executed by each person can also be configured.

[0040] Store pool update includes processing long-term tasks that need to be triggered for update on the same day, specifically, first, synchronizing the valid stores belonging to the enterprise, then traversing all tasks that need to be executed created by random tasks, and updating the total number of stores in the store pool according to the assessment rules set when creating the long-term tasks. The assessment rules can be "not assessed", "assessment does not meet requirements", etc. "Not assessed" specifically includes whether the store inspection task is executed; "assessment does not meet requirements" specifically includes whether the store inspection task is executed and whether it is qualified or not.

[0041] Among them, the total number of stores in the next random task is updated according to the current status of each store (such as the store inspection score, whether the store inspection is qualified), or the total number of stores can be updated according to the store inspection task status (whether the store inspection task is executed / qualified or not) in the last several random tasks that have been assigned and completed.

[0042] In this embodiment, m executors are determined for all stores of an enterprise. Each executor needs to complete the store inspection task of n stores. At this time, the store inspection execution percentage = m*n / total number of stores. This execution percentage is used as the coefficient for randomly allocating store inspections.

[0043] The company's stores are distributed in several regions, and all stores are managed by k executors. One store corresponds to one executor, and one executor can correspond to several stores. Multiple executors are randomly assigned m*n store inspection tasks, and a*(m*n / total number of stores) is randomly selected from the number of stores a that each executor is responsible for. It should be noted that the number of stores that need to be confirmed in the random allocation, that is, the randomly generated stores, need to be confirmed by the creator before they can be used in the dispatching tasks related to the store inspection tasks.

[0044] According to the status of the stores assigned to the random tasks, the total number of stores is updated after the reference is confirmed, and a new round of random tasks is set according to the updated total number of stores. This achieves the randomness and scientificity of the release of store inspection tasks.

[0045] S103: The next round of random tasks is executed in a loop until the total number of stores reaches the store inspection threshold, and the long-term task ends.

[0046] In this embodiment, the next round of random tasks is executed cyclically. When the total number of stores reaches the store inspection threshold, the current long-term task ends and the store inspection task stops. The store inspection threshold is the total number of stores being 0 or in the range of 0-10. Of course, the store inspection threshold can be set as needed according to actual conditions.

[0047] The store inspection task allocation method provided in the above embodiment can be applied to the efficient allocation of store inspection tasks, and mainly achieves the following technical effects: (1) Dynamically load stores that meet the requirements under the enterprise into the store pool. (2) Long-term tasks do not interfere with each other, and the trigger mechanisms are independent of each other. (3) It can be determined whether a store needs to be re-executed based on the completion status of the execution tasks created by each referenced random task. (4) Stores are relatively balanced, and the proportion of stores executed by regional managers remains consistent.

[0048] To sum up, in the prior art, the allocation method is based on the relationship between people and stores. As a result, it may happen that the executor executes a large number of stores in a certain area, or the executor's execution stores are relatively scattered, causing unnecessary expenses for some executors during the execution process, and it is more cumbersome when configuring. The store inspection task allocation method provided in this application obtains the number of stores in the area to be allocated according to the proportion, and can accurately distribute it evenly among the authorized stores of the executors in each allocated area, and can also repeat the execution of stores according to the rules. After the allocation is completed, the store can be fine-tuned, which shortens the time spent on manual allocation. After confirming the use of the currently generated plan, the corresponding store in the enterprise store pool will be removed, and it will not be allocated in the next plan. The store pool sets an automatic update time point, and regularly adds back the stores that do not meet the rules in the allocated tasks, and continues the subsequent allocation, which can ensure that all stores can be allocated.

[0049] In this application, the stores assigned to the executors can be relatively evenly distributed, or they can be automatically reallocated based on the stores that did not meet the requirements and rechecked, and filtered based on the stores that have already been executed in the enterprise, without the need for repeated execution, making the execution more intelligent and efficient. It should be noted that this application can also manually add stores that have already been executed.

[0050] This application also provides a store inspection task allocation system, and the system described below can be referenced in correspondence with the method described above. Figure 4 , Figure 4 A schematic diagram of a store inspection task allocation system provided in an embodiment of the present application, combined with Figure 4 As shown, the system includes:

[0051] A creation module, used for creating a long-term task, wherein the long-term task includes at least one random task;

[0052] An allocation module is used to allocate stores for the current random task according to a random strategy. When the store generated by the random allocation corresponding to the random task is confirmed and referenced, the current random task creation is completed, the total number of store pools is updated, and the next round of random tasks is allocated according to the sum of the updated total number of store pools;

[0053] The loop module is used to loop and execute the next round of random tasks until the total number of stores reaches the store inspection threshold, and the long-term task ends.

[0054] The store inspection task allocation system provided in the present application includes a creation module, an allocation module, and a loop module. The system creates a long-term task including a random task, allocates stores to be inspected according to a random strategy, updates the total number of store pools according to the strategy, and allocates the next round of random tasks according to the sum of the updated total number of store pools. The next round of random tasks is executed in a loop until the total number of stores reaches the store inspection threshold, and the long-term task ends.

[0055] This application also provides a store inspection task allocation device, refer to Figure 5 As shown, the device includes a memory 1 and a processor 2 .

[0056] Memory 1, used for storing computer programs;

[0057] Processor 2 is used to execute the computer program to implement the following steps:

[0058] Creating a long-term task, wherein the long-term task includes at least one random task;

[0059] The current random task is assigned to a store according to a random strategy. When the store generated by the random assignment corresponding to the random task is confirmed and referenced, the creation of the current random task is completed, the total number of the store pool is updated, and the next round of random tasks is assigned according to the sum of the updated total number of the store pool;

[0060] The next round of random tasks is executed in a loop until the total number of stores reaches the store inspection threshold, and the long-term task ends.

[0061] For an introduction to the equipment provided in this application, please refer to the above method embodiments, and this application will not go into details here.

[0062] The present application also provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the following steps can be implemented:

[0063] Creating a long-term task, wherein the long-term task includes at least one random task;

[0064] The current random task is assigned to a store according to a random strategy. When the store generated by the random assignment corresponding to the random task is confirmed and referenced, the creation of the current random task is completed, the total number of the store pool is updated, and the next round of random tasks is assigned according to the sum of the updated total number of the store pool;

[0065] The next round of random tasks is executed in a loop until the total number of stores reaches the store inspection threshold, and the long-term task ends.

[0066] The computer-readable storage medium may include: a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and other media that can store program codes.

[0067] For an introduction to the computer-readable storage medium provided in this application, please refer to the above method embodiment, and this application will not go into details here.

[0068] The various embodiments in the specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the various embodiments can be referred to each other. For the system, device, and computer-readable storage medium disclosed in the embodiments, since they correspond to the methods disclosed in the embodiments, the description is relatively simple, and the relevant parts can be referred to the method part description.

[0069] Professionals may further appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in the above description according to function. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professionals and technicians may use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0070] The steps of the method or algorithm described in conjunction with the embodiments disclosed herein may be implemented directly using hardware, a software module executed by a processor, or a combination of the two. The software module may be placed in a random access memory (RAM), a memory, a read-only memory (ROM), an electrically programmable ROM, an electrically erasable programmable ROM, a register, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.

[0071] The above is a detailed introduction to the store patrol task allocation method, system, device and computer-readable storage medium provided by the present application. This article uses specific examples to illustrate the principles and implementation methods of the present application. The description of the above embodiments is only used to help understand the method of the present application and its core idea. It should be pointed out that for ordinary technicians in this technical field, without departing from the principles of the present application, several improvements and modifications can be made to the present application, and these improvements and modifications also fall within the scope of protection of the claims of the present application.

Claims

1. A method for allocating store inspection tasks, characterized in that: include: Creating a long-term task, wherein the long-term task includes at least one random task; The current random task is assigned to a store according to a random strategy. When the store generated by the random assignment corresponding to the random task is confirmed and referenced, the creation of the current random task is completed, the total number of the store pool is updated, and the next round of random tasks is assigned according to the sum of the updated total number of the store pool; The next round of random tasks is executed in a loop until the total number of stores reaches the store inspection threshold, and the long-term task ends.

2. The method for allocating store inspection tasks according to claim 1, characterized in that: The long-term task parameters include the total number of stores in the store pool and the store pool update time. The total number of stores in the store pool is the number of all stores that meet the requirements of the current enterprise. Random tasks are allocated based on the number of stores and a preset random allocation strategy, and the executor of the current random task is designated.

3. The method for allocating store inspection tasks according to claim 1, characterized in that: The long-term task must be affiliated with the store pool, and a random task can only be created when the total number of stores in the store pool is not zero.

4. The method for allocating store inspection tasks according to claim 1, characterized in that: The random task is referenced in that the store randomly selected by the random task is referenced to the corresponding task creation, and a corresponding execution task is generated.

5. The method for allocating store inspection tasks according to claim 1, characterized in that: The store pool update specifically includes synchronizing the valid stores to which the user belongs, and then traversing all the tasks that need to be executed created by random tasks, and updating the total number of stores in the store pool according to the assessment rules set when creating the long-term tasks.

6. The method for allocating store inspection tasks according to claim 1, characterized in that: The store patrol execution percentage is (m*n) / total number of stores, where m is the number of store patrol executors determined by all the user's stores, and n is the number of store patrol tasks that the store patrol executor needs to complete; several executors are randomly assigned m*n store patrol tasks, and from the number of stores a that each executor is responsible for, a*(m*n / total number of stores) stores are randomly selected to perform store patrols.

7. The method for allocating store inspection tasks according to claim 1, characterized in that: The total number of stores in the next round of random tasks is updated according to the current status of each store, or the total number of stores in the next round of random tasks is updated according to the status of the store inspection tasks in the last several random tasks that have been assigned and completed.

8. A store inspection task allocation system, characterized in that: include: A creation module, used for creating a long-term task, wherein the long-term task includes at least one random task; An allocation module is used to allocate stores for the current random task according to a random strategy. When the store generated by the random allocation corresponding to the random task is confirmed and referenced, the current random task creation is completed, the total number of store pools is updated, and the next round of random tasks is allocated according to the sum of the updated total number of store pools; The loop module is used to loop and execute the next round of random tasks until the total number of stores reaches the store inspection threshold, and the long-term task ends.

9. A store patrol task allocation device, characterized in that: include: Memory for storing computer programs; A processor, configured to implement the steps of the store patrol task allocation method as described in any one of claims 1 to 7 when executing the computer program.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the store patrol task allocation method according to any one of claims 1 to 7 are implemented.