First-line website personnel task arrangement method, device and equipment and storage medium

By obtaining the tasks of front-line outlets and the working hours of staff, if the preset threshold is reached, new scheduling personnel will be added, and tasks are allocated using operation algorithms, which solves the problem of efficient task arrangement in the existing technology and improves logistics operation efficiency.

CN119647834APending Publication Date: 2025-03-18SHENZHEN YUEHUA EXPRESS CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411615808.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-11-13
Publication Date
2025-03-18

AI Technical Summary

Technical Problem

The existing technology cannot achieve efficient and reasonable task arrangements for front-line outlets, resulting in slower transportation time and reduced service quality.

Method used

By obtaining the tasks and working hours of staff for the current working day of the point department, if the timeout tasks, external request tasks and working hours exceed the preset threshold, new scheduling personnel will be added. Using the operation algorithm, we maximize the matching of task time and free time periods to obtain the official scheduled time period, and assign timeout tasks and external requested tasks to the new scheduled personnel.

Benefits of technology

The matching of tasks and new scheduling personnel has been achieved, time-out tasks and external inquiry tasks are assigned efficiently and reasonably, the work efficiency of personnel at the front-line outlets has been improved, the staff shortage has been alleviated, and the overall logistics operation efficiency has been improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119647834A_ABST
    Figure CN119647834A_ABST
Patent Text Reader

Abstract

The invention discloses a first-line website personnel task arrangement method and device, equipment and a storage medium. The method comprises the steps of obtaining a task and a working time length; if the task duration of the overtime task is greater than a first preset threshold value or the task duration of the external task is greater than a second preset threshold value and the working duration is greater than a third preset threshold value, adding scheduling personnel; a first target function is formed by maximizing the total task consumed time when the tasks are distributed to the candidate scheduling time periods, and a first constraint condition is formed according to the total task consumed time when the tasks are distributed to the candidate scheduling time periods, so that a formal scheduling time period is obtained; and forming a second target function by maximizing the total task consumed time of the tasks distributed in the formal scheduling time period, and forming a second constraint condition according to the starting time and the ending time of the formal scheduling time period so as to distribute the overtime tasks and / or the external tasks to the formal scheduling time period. By utilizing the method disclosed by the invention, efficient and reasonable task arrangement can be realized.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of logistics technology, and in particular to a method, device, equipment and storage medium for allocating tasks for front-line network personnel. Background Art

[0002] The key to efficient operation of the logistics industry lies in the collaborative work of front-line outlets. Once there is a shortage of staff at the front-line outlets, it may lead to problems such as slower transportation time and reduced service quality, which will directly affect the company's brand image and development. With tens of thousands of outlets across the country, it is crucial for the company's management to quickly understand whether there is a shortage of staff at the front-line outlets.

[0003] Usually, the industry often establishes an indicator monitoring system to determine whether there is a shortage of personnel in front-line outlets, such as personnel performance, working hours, workload, etc. However, although this indicator system monitoring method is simple and easy to use, it is not accurate enough and cannot well reflect the problem of whether the real tasks of front-line outlets match the new personnel, and thus cannot achieve efficient and reasonable task arrangement. Summary of the invention

[0004] The present invention provides a method, device, equipment and storage medium for arranging tasks for front-line network personnel, so as to solve the technical problem that the prior art front-line network technology cannot achieve efficient and reasonable task arrangement.

[0005] In order to solve the above technical problems, in a first aspect, the present invention provides a method for allocating tasks for frontline network personnel, the method comprising:

[0006] Get the tasks including overtime tasks and outsourced tasks and the working hours of the staff of the department on the current working day;

[0007] If the task duration of the overtime task of the branch is greater than the first preset threshold or the task duration of the external task of the branch is greater than the second preset threshold, and the working time of the branch staff is greater than the third preset threshold, then a new staff member is added to the shift;

[0008] A first objective function is formed by maximizing the total task time consumed by the tasks assigned to the candidate scheduling time period, and a first constraint condition is formed based on that the total task time consumed by the tasks assigned to the candidate scheduling time period is less than the total idle time in the candidate scheduling time period, so as to obtain the official scheduling time period of the newly added scheduling personnel;

[0009] A second objective function is formed by maximizing the total task time of the tasks assigned within the formal scheduling time period, and a second constraint condition is formed according to the start time and end time of the formal scheduling time period, the start time and end time of the task, and the travel time between adjacent inserted tasks, so as to allocate the overtime task and / or the outsourced task to the formal scheduling time period of the newly added scheduled personnel.

[0010] Optionally, the second objective function is formed by maximizing the total task time of the tasks assigned within the formal scheduling time period, and the second constraint condition is formed according to the start time and end time of the scheduling time period, the start time and end time of the task, and the travel time between adjacent inserted tasks, including:

[0011] The second objective function is Among them, t i is the time taken for the current task i, q ik Indicates whether the current task i is executed in the idle time period k within the formal scheduling time period. If so, q ik =1, otherwise q ik =0;

[0012] The second constraint condition includes

[0013]

[0014] Among them, e i Indicates the end time of the current task i, s i Indicates the start time of the current task i, E indicates the end time of the formal shift time period, S indicates the start time of the formal shift time period, idle_s k is the start time of idle time period k within the formal scheduling time period, idle_e k represents the end time of the idle time period k within the formal scheduling time period, d (i-1)i represents the time taken to travel between the previous task i-1 and the current task i, d i(i+1) It represents the time taken to travel between the current task i and the next task i+1 of the current task, n is the number of tasks, m is the number of idle time periods within the formal scheduling time period, Indicates that each task is assigned only once. Indicates that each task is assigned to only one idle time period.

[0015] Optionally, the first objective function is formed by maximizing the total task time consumed by the tasks assigned to the candidate scheduling time period, and the first constraint condition is formed according to the total time consumed by the tasks assigned to the candidate scheduling time period being less than the total idle time in the candidate scheduling time period, including:

[0016] The first objective function is Among them, c i represents the time taken by the current task i, x ij Indicates whether the current task i is successfully assigned to the candidate scheduling time j. If successful, x ij =1, otherwise 0;

[0017] The first constraint condition includes:

[0018]

[0019] Among them, b j represents the length of the idle time period of candidate scheduling time period j, y j Indicates whether the candidate scheduling time period is selected. If selected, y j =1, otherwise 0, end_t i-1 <start_t i Indicates that the end time of the previous task i-1 is earlier than the start time of the current task i. Indicates that the task can only be assigned to one candidate shift period. Indicates that only one candidate scheduling time period can be selected, n is the number of tasks, and h is the number of candidate scheduling time periods.

[0020] Optionally, allocating the overtime task and / or the outsourced task to the formal scheduling time period of the newly added scheduling personnel includes:

[0021] The second objective function is solved by using a heuristic algorithm. If the total task time consumed by the tasks assigned within the official scheduling time period of the newly added scheduling personnel is greater than a fourth preset threshold, the task scheduling plan for the newly added scheduling personnel is output to assign the overtime tasks and / or the outsourced tasks to the official scheduling time period of the newly added scheduling personnel. Otherwise, the solution of the second objective function is terminated.

[0022] Optionally, after outputting the task scheduling plan for the newly added scheduling personnel, the method further includes:

[0023] The overtime tasks and / or the outsourced tasks assigned to the newly added shift personnel are removed from the task list of the point department, and the tasks are updated;

[0024] Re-determine whether to add new scheduled personnel based on the updated task. If so, assign the updated task to the official scheduling time period of the newly added scheduled personnel based on the first objective function and the first constraint, as well as the second objective function and the second constraint; until the total task time consumed in the official scheduling time period of the newly added scheduled personnel after the updated task is assigned to the updated task is no longer greater than the fourth preset threshold, or the requirements for adding new scheduled personnel are not met.

[0025] Optionally, obtaining the official scheduling time period of the newly added scheduled personnel includes:

[0026] The first objective function is solved by using an integer programming algorithm to obtain the official scheduling time period of the newly added scheduled personnel.

[0027] Optionally, the step of obtaining the tasks including overtime tasks and external tasks and the working hours of the staff of the department on the current working day may further include:

[0028] The tasks whose task duration exceeds the fifth preset threshold and the working duration whose duration is 0 are both deleted.

[0029] In a second aspect, the present invention provides a first-line network personnel task arrangement device, including a data acquisition module, a personnel addition module, a shift allocation module and a task allocation module;

[0030] The data acquisition module is used to obtain the tasks including overtime tasks and external tasks and the working hours of the staff of the branch on the current working day;

[0031] The personnel adding module is used to add new personnel to the schedule when the task duration of the overtime task of the point department is greater than the first preset threshold or the task duration of the external task of the point department is greater than the second preset threshold, and the working time of the staff of the point department is greater than the third preset threshold;

[0032] The scheduling allocation module is used to maximize the total task time consumed by the tasks assigned to the candidate scheduling time period to form a first objective function, and to form a first constraint condition based on the total task time consumed by the tasks assigned to the candidate scheduling time period being less than the total idle time in the candidate scheduling time period, so as to obtain the official scheduling time period of the newly added scheduling personnel;

[0033] The task allocation module is used to form a second objective function by maximizing the total task time of the tasks assigned within the formal scheduling time period, and to form a second constraint condition based on the start time and end time of the formal scheduling time period, the start time and end time of the task, and the travel time between adjacent inserted tasks, so as to allocate the overtime task and / or the outsourced task to the formal scheduling time period of the newly added scheduled personnel.

[0034] In a third aspect, the present invention provides a task arrangement device for front-line network personnel, including a memory and a processor, wherein:

[0035] The memory is used to store computer programs;

[0036] The processor is used to read the program in the memory and execute the steps of the method for arranging tasks for front-line network personnel as provided in the first aspect above.

[0037] In a fourth aspect, the present invention provides a computer-readable storage medium having a readable computer program stored thereon, which, when executed by a processor, implements the steps of the method for allocating tasks for front-line branch personnel as provided in the first aspect above.

[0038] Compared with the prior art, the method, device, equipment and storage medium for arranging tasks for front-line network personnel provided by the present invention have the following beneficial effects:

[0039] Obtain the tasks including overtime tasks and external tasks and the working hours of the staff of the point department on the current working day; if the task duration of the overtime tasks of the point department is greater than the first preset threshold or the task duration of the external tasks of the point department is greater than the second preset threshold, and the working hours of the staff of the point department are greater than the third preset threshold, then add new scheduling personnel to efficiently and reasonably determine whether new scheduling personnel are needed to facilitate subsequent task scheduling; form a first objective function by maximizing the total task time consumed by the tasks assigned to the candidate scheduling time period, and form a first constraint condition based on the total task time consumed by the tasks assigned to the candidate scheduling time period being less than the total idle time in the candidate scheduling time period, so as to obtain the formal schedule of the newly added scheduling personnel time period; a second objective function is formed by maximizing the total task time consumed by the tasks assigned within the formal scheduling time period, and a second constraint condition is formed according to the start time and end time of the formal scheduling time period, the start time and end time of the tasks, and the travel time consumed between adjacent inserted tasks, so as to allocate the overtime tasks and / or the outsourced tasks to the formal scheduling time period of the newly added scheduling personnel; through the above technical solution, the real tasks and the newly added scheduling personnel can be matched, and the overtime tasks and / or the outsourced tasks can be efficiently and reasonably allocated to the formal scheduling time period of the newly added scheduling personnel, thereby achieving efficient and reasonable task scheduling, improving the work efficiency of front-line network personnel, alleviating the shortage of front-line network personnel, and improving the overall logistics operation efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only part of the embodiments of the present invention, rather than all of the embodiments. For ordinary technicians in this field, without paying creative work, other drawings obtained based on these drawings all fall within the scope of protection of this application.

[0041] Figure 1 This is a first flow chart of a method for allocating tasks for frontline network personnel provided by an embodiment of the present invention;

[0042] Figure 2 It is a second flow diagram of a method for arranging tasks for front-line network personnel provided by an embodiment of the present invention;

[0043] Figure 3 It is a structural schematic diagram of a task arrangement device for front-line network personnel provided by an embodiment of the present invention;

[0044] Figure 4 It is a structural schematic diagram of a task arrangement device for front-line network personnel provided by an embodiment of the present invention;

[0045] Figure 5 It is a structural schematic diagram of a computer-readable storage medium provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0046] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0047] In order to make the description of the disclosed content more detailed and complete, the following is an illustrative description of the implementation mode and specific examples of the present invention; however, this is not the only form of implementing or applying the specific embodiments of the present invention. The implementation mode covers the features of multiple specific embodiments and the method steps and their sequence for constructing and operating these specific embodiments. However, other specific embodiments can also be used to achieve the same or equal functions and step sequences. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of this application.

[0048] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the terms used in this way can be interchangeable under appropriate circumstances, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein.

[0049] In the description of the embodiments of the present invention, unless otherwise specified, “ / ” means or, for example, A / B can mean A or B; “and / or” in the text is merely a description of the association relationship of associated objects, indicating that three relationships may exist, for example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, in the description of the embodiments of the present application, “multiple” refers to two or more than two, and other quantifiers are similar. It should be understood that the preferred embodiments described herein are only used to illustrate and explain the present invention, and are not used to limit the present invention, and the embodiments of the present application and the features in the embodiments may be combined with each other without conflict.

[0050] Example 1

[0051] like Figure 1 As shown, it is a first flow chart of a method for arranging tasks for front-line branch personnel provided by an embodiment of the present invention. The method for arranging tasks for front-line branch personnel includes the following steps.

[0052] Step S101, obtaining tasks including overtime tasks and external tasks and working hours of the staff of the branch on the current working day;

[0053] It should be noted that the above-mentioned overtime task may be a task that actually starts execution of the dispatched task later than the required time, and the above-mentioned outsourced task may be a task that is not completed by employees within the enterprise, that is, a dispatched task that is completed by external personnel.

[0054] In a specific embodiment, task data including overtime tasks and outsourced tasks are obtained and summarized according to the dimension of the point department. The task data may include field data such as task code, task type, task start time, task end time, task latitude and longitude, cargo weight and size, etc.; the working hours of each employee of the point department on the day are obtained and summarized according to the dimension of the point department.

[0055] As an optional implementation manner, the step of obtaining the tasks including overtime tasks and external tasks and the working hours of the staff of the site department on the current working day also includes:

[0056] The tasks whose task duration exceeds the fifth preset threshold and the working duration whose duration is 0 are both deleted.

[0057] In a specific embodiment, data such as tasks and working hours of point staff can be pre-processed, that is, data pre-processing is required for some abnormal data, for example, tasks whose duration exceeds the fifth preset threshold are filtered out, and the fifth preset threshold may be 12 hours, etc.; working hour data of employees who are on rest that day or have no scheduled time are excluded, for example, all working hours with a duration of 0 are deleted.

[0058] Step S102, if the task duration of the overtime task of the site is greater than the first preset threshold or the task duration of the external task of the site is greater than the second preset threshold, and the working time of the site staff is greater than the third preset threshold, then add a new staff member to the shift;

[0059] It should be noted that if there are overtime tasks, it will affect the customer experience, and the cost of outsourcing tasks is relatively high. The purpose of adding new scheduling staff is mainly to handle this part of the tasks.

[0060] In a specific embodiment, the conditions for adding new scheduling personnel include: 1. There are overtime tasks, the task duration of the above-mentioned overtime tasks of the point department is greater than the first preset threshold, and the working hours of the staff of the point department on that day are greater than the third preset threshold; or, 2. There are external tasks, the task duration of the above-mentioned external tasks of the point department is greater than the second preset threshold, and the working hours of the staff of the point department on that day are greater than the third preset threshold. If any of the above conditions is met, the point department needs to add new scheduling personnel, otherwise, the point department does not need to add scheduling personnel. The specific settings of the above-mentioned first preset threshold, second preset threshold and third preset threshold can be set according to the management and operation of the business.

[0061] Step S103, forming a first objective function by maximizing the total task time consumed by the tasks assigned to the candidate scheduling time period, and forming a first constraint condition based on the total task time consumed by the tasks assigned to the candidate scheduling time period being less than the total idle time in the candidate scheduling time period, so as to obtain the official scheduling time period of the newly added scheduling personnel;

[0062] In a specific embodiment, multiple candidate scheduling time periods are initialized based on the actual normal scheduling time of the point department, such as 9:00-18:00, 8:00-17:00, etc. The specific number of candidate scheduling time periods to be initialized can be set according to the actual business situation. A scheduling operations model is formed based on the above-mentioned first objective function and the first constraint condition to determine the official scheduling time period for the newly added scheduling personnel.

[0063] As an optional implementation, the first objective function is formed by maximizing the total task time consumed by the tasks assigned to the candidate scheduling time period, and the first constraint condition is formed according to the total time consumed by the tasks assigned to the candidate scheduling time period being less than the total idle time in the candidate scheduling time period, including:

[0064] The first objective function is Among them, c i represents the time taken by the current task i, x ij Indicates whether the current task i is successfully assigned to the candidate scheduling time j. If successful, x ij =1, otherwise 0;

[0065] The first constraint condition includes:

[0066]

[0067] Among them, b j represents the length of the idle time period of candidate scheduling time period j, y j Indicates whether the candidate scheduling time period is selected. If selected, y j =1, otherwise 0, end_ti-1 <start_t i Indicates that the end time of the previous task i-1 is earlier than the start time of the current task i. Indicates that the task can only be assigned to one candidate shift period. Indicates that only one candidate scheduling time period can be selected, n is the number of tasks, and h is the number of candidate scheduling time periods.

[0068] It should be noted that the task duration is the task end time minus the task start time. The idle time period is the time period obtained by subtracting the rest time and the time when no tasks are inserted from the scheduled time period, and the idle time period will change dynamically. For example, if the scheduled time period is 9:00-18:00, minus the rest period, such as 12:00-13:00, then the initial idle time period is 9:00-12:00 and 13:00-18:00; after inserting a task, for example, the task is added to 10:00-11:00, then the idle time period becomes 9:00-10:00, 11:00-12:00, and 13:00-18:00.

[0069] As an optional implementation manner, the step of obtaining the official scheduling time period of the newly added scheduled personnel includes:

[0070] The first objective function is solved by using an integer programming algorithm to obtain the official scheduling time period of the newly added scheduled personnel.

[0071] The integer programming algorithm is used to solve the scheduling operations model to obtain the optimal official scheduling time period for the newly added scheduled personnel.

[0072] Step S104, forming a second objective function by maximizing the total task time of the tasks assigned within the formal scheduling time period, and forming a second constraint condition according to the start time and end time of the formal scheduling time period, the start time and end time of the task, and the travel time between adjacent inserted tasks, so as to allocate the overtime task and / or the outsourced task to the formal scheduling time period of the newly added scheduled personnel.

[0073] The official scheduling time period of the newly added scheduled personnel obtained above is the scheduling time period of the virtual person. A task allocation operations model is formed according to the second objective function and the second constraint condition to allocate overtime tasks and / or outsourced tasks to the official scheduling time period of the newly added scheduled personnel.

[0074] As an optional implementation, the second objective function is formed by maximizing the total task time of the tasks assigned within the formal scheduling time period, and the second constraint condition is formed according to the start time and end time of the scheduling time period, the start time and end time of the task, and the travel time between adjacent inserted tasks, including:

[0075] The second objective function is Among them, t i is the time taken for the current task i, q ik Indicates whether the current task i is executed in the idle time period k within the formal scheduling time period. If so, q ik =1, otherwise q ik =0;

[0076] The second constraint condition includes

[0077]

[0078] Among them, e i Indicates the end time of the current task i, s i Indicates the start time of the current task i, E indicates the end time of the formal shift time period, S indicates the start time of the formal shift time period, idle_s k is the start time of idle time period k within the formal scheduling time period, idle_e k represents the end time of the idle time period k within the formal scheduling time period, d (i-1)i represents the time taken to travel between the previous task i-1 and the current task i, d i(i+1) It represents the time taken to travel between the current task i and the next task i+1 of the current task, n is the number of tasks, m is the number of idle time periods within the formal scheduling time period, Indicates that each task is assigned only once. Indicates that each task is assigned to only one idle time period.

[0079] e i ≤E and s i ≥S means that the start time and end time of the current task must be within the official scheduling time period; s i ≥idle_s k and e i ≤idle_e k Indicates that the start time and end time of the current task are both within the inserted idle time period; i-1 +d (i-i)i ≤s i It means that the end time of the previous task of the current task plus the travel time from the previous task of the current task to the current task is less than or equal to the start time of the inserted current task. That is, when inserting the current task, it is necessary to consider whether the previous task can catch up with the start time of the inserted current task; e i +d i(i+1) ≤s i+1It means that the end time of the current task plus the travel time between the current task and the next task of the current task is less than the start time of the next task after the current task. That is, when inserting the current task, it is necessary to consider not only that starting from the previous task position of the current task, it is necessary to catch up with the start time of the current task, but also that starting from the current task position, it is necessary to catch up with the start time of the next task after the current task.

[0080] As an optional implementation manner, the allocating the overtime task and / or the outsourced task to the formal scheduling time period of the newly added scheduling personnel includes:

[0081] The second objective function is solved by using a heuristic algorithm. If the total task time consumed by the tasks assigned within the official scheduling time period of the newly added scheduling personnel is greater than a fourth preset threshold, the task scheduling plan for the newly added scheduling personnel is output to assign the overtime tasks and / or the outsourced tasks to the official scheduling time period of the newly added scheduling personnel. Otherwise, the solution of the second objective function is terminated.

[0082] It should be noted that the specific setting of the fourth preset threshold can be set according to the management and operation of the business. The heuristic algorithm for solving the second objective function can be a simulated annealing algorithm, an ant colony algorithm, a genetic algorithm, etc., which is not limited in the embodiment of the present invention.

[0083] The second objective function is iteratively solved using a heuristic algorithm. If the task scheduling plan for the newly added shift personnel solved by the current iteration has a total task time of tasks assigned within the formal scheduling time period that is greater than the fourth preset threshold, the task scheduling plan for the newly added shift personnel is output; if the task scheduling plan for the newly added shift personnel solved by the iteration does not satisfy the requirement that the total task time of tasks assigned within the formal scheduling time period is greater than the fourth preset threshold, the iteration is terminated.

[0084] In an embodiment of the present invention, a heuristic algorithm is used to solve the second objective function. When the total task time of the tasks assigned within the formal scheduling time period of the newly added scheduling personnel is greater than a fourth preset threshold, a task scheduling plan for the newly added scheduling personnel is output to assign the overtime tasks and / or the outsourced tasks to the formal scheduling time period of the newly added scheduling personnel. Otherwise, the solution of the second objective function is terminated, thereby ensuring that the task arrangement of the newly added scheduling personnel is more reasonable and efficient.

[0085] As an optional implementation manner, after outputting the task scheduling plan for the newly added scheduling personnel, the method further includes:

[0086] The overtime tasks and / or the outsourced tasks assigned to the newly added shift personnel are removed from the task list of the point department, and the tasks are updated;

[0087] Re-determine whether to add new scheduled personnel based on the updated task. If so, assign the updated task to the official scheduling time period of the newly added scheduled personnel based on the first objective function and the first constraint, as well as the second objective function and the second constraint; until the total task time consumed in the official scheduling time period of the newly added scheduled personnel after the updated task is assigned to the updated task is no longer greater than the fourth preset threshold, or the requirements for adding new scheduled personnel are not met.

[0088] In a specific embodiment, the above-mentioned task list includes all overtime tasks and / or external clearing tasks to be assigned. When the task scheduling plan for the newly added scheduled personnel that meets the conditions is iteratively solved, the overtime tasks and / or external tasks assigned to the newly added scheduled personnel are removed from the task list of the point department. At this time, the tasks of the point department need to be updated. After the tasks are updated, whether to add new scheduled personnel is re-determined based on the updated tasks; when new scheduled personnel need to be added, the scheduling operations model and the task allocation operations model are executed, and the updated tasks are assigned to the official scheduling time period of the newly added scheduled personnel, and the task scheduling plan for the newly added scheduled personnel that meets the conditions is output, and the task list is updated again; the cycle is repeated until the updated tasks execute the task allocation operations model for task allocation, and the assigned tasks do not meet the requirements, that is, the total task time spent in the official scheduling time period assigned to the newly added scheduled personnel is greater than the fourth preset threshold; or, the updated tasks do not meet the requirements of the newly added scheduled personnel.

[0089] According to an embodiment of the present invention, the above-mentioned tasks are updated by removing the above-mentioned overtime tasks and / or the above-mentioned external tasks assigned to the above-mentioned newly added scheduling personnel from the above-mentioned task list of the point department; based on the above-mentioned updated tasks, it is re-determined whether to add new scheduling personnel, and if so, based on the above-mentioned first objective function and the first constraint condition, as well as the second objective function and the second constraint condition, the updated tasks are assigned to the official scheduling time period of the newly added scheduling personnel; until the total task consuming time within the official scheduling time period of the newly added scheduling personnel after the updated tasks are assigned is greater than the fourth preset threshold; all newly added scheduling personnel can be obtained, and tasks can be assigned to the newly added scheduling personnel who meet the conditions, so as to better achieve efficient and reasonable task scheduling.

[0090] The method for allocating tasks for front-line branch personnel provided by an embodiment of the present invention obtains the tasks including overtime tasks and outsourced tasks of the branch department on the current working day and the working hours of the branch department staff; if the task duration of the above-mentioned overtime tasks of the branch department is greater than a first preset threshold value or the task duration of the above-mentioned outsourced tasks of the branch department is greater than a second preset threshold value, and the above-mentioned working hours of the above-mentioned branch department staff are greater than a third preset threshold value, then new scheduling personnel are added to efficiently and reasonably determine whether new scheduling personnel are needed to facilitate subsequent task scheduling; a first objective function is formed by maximizing the total task time consumption of the above-mentioned tasks assigned to the candidate scheduling time period, and according to the total task time consumption of the above-mentioned tasks assigned to the candidate scheduling time period being less than the total idle time in the candidate scheduling time period, The first constraint condition is formed by the time interval to obtain the formal scheduling time period of the above-mentioned newly added scheduling personnel; the second objective function is formed by maximizing the total task time consumed by the tasks assigned within the above-mentioned formal scheduling time period, and the second constraint condition is formed according to the start time and end time of the above-mentioned formal scheduling time period, the start time and end time of the task, and the distance time consumed between adjacent inserted tasks, so as to allocate the above-mentioned overtime tasks and / or the above-mentioned outsourced tasks to the above-mentioned formal scheduling time period of the above-mentioned newly added scheduling personnel; the overtime tasks and / or the outsourced tasks can be efficiently and reasonably allocated to the formal scheduling time period of the newly added scheduling personnel, thereby achieving efficient and reasonable task scheduling, improving the work efficiency of the front-line network personnel, alleviating the shortage of front-line network personnel, and improving the overall logistics operation efficiency.

[0091] like Figure 2 FIG. 1 is a schematic diagram of a second process of a method for arranging tasks for front-line network personnel provided by an embodiment of the present invention. The method for arranging tasks for front-line network personnel may include the following processes:

[0092] Obtain tasks including overtime tasks and outsourced tasks, and calculate the working hours of employees at the point; determine whether there are tasks and work, and whether the tasks and working hours meet the requirements; if so, execute the scheduling operations model to obtain the official scheduling time period of the newly added scheduling personnel, and then execute the task allocation operations model to perform task allocation; under the condition that the task allocation requirements are met, output the task scheduling plan for the newly added scheduling personnel, remove the already assigned tasks from the task list, re-acquire tasks including overtime tasks and outsourced tasks, calculate the working hours of employees at the point, and execute the next task allocation; when there is no task, or the task and working hours do not meet the requirements, or the task assigned by the task allocation operations model does not meet the allocation requirements, end the task allocation.

[0093] For other details in the technical solution of the second process of the method for arranging tasks for front-line branch personnel, please refer to the description of the first process of the method for arranging tasks for front-line branch personnel provided in the above embodiment, which will not be repeated here.

[0094] The method for allocating tasks for front-line outlet personnel provided by the embodiment of the present invention can accurately identify whether there is a staff shortage in the front-line outlets, and provide accurate decision support for the enterprise management.

[0095] Traditionally, personnel inventory of front-line outlets is generally conducted by establishing an indicator monitoring system to determine whether there is a shortage of personnel in the front-line outlets, such as indicators such as personnel performance, working hours, and workload. The front-line outlet personnel task scheduling method provided by the embodiment of the present invention uses an operations research algorithm on the basis of the indicator monitoring system to intelligently match tasks beyond the capabilities of front-line employees with the scheduling times of newly added scheduled personnel, simulate the task allocation of newly added front-line personnel, and determine whether tasks can be allocated to newly added personnel based on the final task allocation plan. It accurately determines whether additional personnel are needed and how many personnel to add, and also determines which tasks should be allocated to the newly added personnel.

[0096] The method for scheduling tasks for front-line branch personnel provided in an embodiment of the present invention proposes a scheduling operations model for new personnel based on the distribution of overtime tasks and outsourced tasks, and obtains the optimal task scheduling plan for new scheduled personnel through integer programming, thereby ensuring that the task arrangement of new personnel is more reasonable and efficient, which has a significant promoting effect on improving the work efficiency of personnel and the overall logistics operation efficiency; then, based on the distribution and scheduling time of overtime tasks and outsourced tasks, an operations model for task allocation is constructed, and through a heuristic search algorithm, a task scheduling plan for new personnel is solved to achieve efficient and reasonable task scheduling, which can improve the work efficiency of front-line branch personnel, alleviate the shortage of front-line branch personnel, and improve the overall logistics operation efficiency.

[0097] Through the task allocation method for front-line outlet personnel provided by the embodiment of the present invention, the enterprise decision-making level can understand the work situation of the front-line outlets more comprehensively and accurately, thereby better guiding the company's management to make decisions, improve the work efficiency of front-line outlet personnel, alleviate the shortage of front-line outlet personnel and thus improve the overall logistics operation efficiency.

[0098] Example 2

[0099] Based on the above-mentioned front-line network personnel task arrangement method, an embodiment of the present invention provides a front-line network personnel task arrangement device, and a structural schematic diagram of the front-line network personnel task arrangement device is shown in FIG. Figure 3 As shown, the first-line network personnel task arrangement device 30 includes a data acquisition module 31, a personnel addition module 32, a shift allocation module 33 and a task allocation module 34;

[0100] The data acquisition module 31 is used to acquire the tasks including overtime tasks and external tasks and the working hours of the staff of the branch on the current working day;

[0101] The personnel adding module 32 is used to add new personnel to the schedule when the task duration of the overtime task of the point department is greater than the first preset threshold or the task duration of the external task of the point department is greater than the second preset threshold, and the working time of the staff of the point department is greater than the third preset threshold;

[0102] The scheduling allocation module 33 is used to maximize the total task time consumed by the tasks assigned to the candidate scheduling time period to form a first objective function, and to form a first constraint condition based on the total task time consumed by the tasks assigned to the candidate scheduling time period being less than the total idle time in the candidate scheduling time period, so as to obtain the official scheduling time period of the newly added scheduling personnel;

[0103] The task allocation module 34 is used to form a second objective function by maximizing the total task time of the tasks assigned within the formal scheduling time period, and to form a second constraint condition based on the start time and end time of the formal scheduling time period, the start time and end time of the task, and the travel time between adjacent inserted tasks, so as to allocate the overtime task and / or the outsourced task to the formal scheduling time period of the newly added scheduled personnel.

[0104] For other details about how the above-mentioned technical solutions are implemented by each module in the above-mentioned task arrangement device for front-line branch personnel, reference can be made to the description of the task arrangement method for front-line branch personnel provided in the above-mentioned embodiment of the invention, which will not be repeated here.

[0105] Example 3

[0106] Based on the above-mentioned method for arranging tasks for front-line network personnel, the embodiment of the present invention further provides a device for arranging tasks for front-line network personnel, as shown in the structural diagram. Figure 4 As shown, the device 40 includes a processor 41 and a memory 42 coupled to the processor 41. The memory 42 stores a computer program, and when the computer program is executed by the processor 41, the processor 41 executes the steps of the method for arranging tasks for front-line network personnel in the above embodiment.

[0107] For other details about the implementation of the above technical solution by the processor 41 in the above-mentioned front-line branch personnel task scheduling device, please refer to the description of the front-line branch personnel task scheduling method provided in the above-mentioned invention embodiment, which will not be repeated here.

[0108] Among them, the processor 41 can also be called a CPU (Central Processing Unit), and the processor 41 may be an integrated circuit chip with signal processing capabilities; the processor 41 can also be a general-purpose processor, DSP (Digital Signal Process), ASIC (Application Specific Integrated Circuit), FPGA (Field Programmable Gate Array) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, among which the general-purpose processor can be a microprocessor or the processor 41 can also be any conventional processor, etc.

[0109] Example 4

[0110] like Figure 5 As shown, the embodiment of the present invention also provides a schematic diagram of the structure of a computer-readable storage medium, on which a readable computer program 51 is stored; wherein the computer program 51 can be stored in the above storage medium in the form of a software product, including a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor to execute all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a magnetic disk or an optical disk, a ROM (Read-Only Memory), a RAM (Random Access Memory), or a terminal device such as a computer, a server, a mobile phone, or a tablet.

[0111] In the several embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the above modules is only a logical function division. There may be other division methods in actual implementation, such as multiple modules or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or modules, which can be electrical, mechanical or other forms.

[0112] The modules described above as separate components may or may not be physically separated, and the components shown as modules may or may not be physical modules, that is, they may be located in one place or distributed on multiple network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0113] In addition, each functional module in each embodiment of the present application may be integrated into a processing module, or each module may exist physically separately, or two or more modules may be integrated into one module. The above-mentioned integrated module may be implemented in the form of hardware or in the form of a software functional module. If the above-mentioned integrated module is implemented in the form of a software functional module and sold or used as an independent product, it may be stored in a computer-readable storage medium.

[0114] In the above embodiments, all or part of the embodiments may be implemented by software, hardware, firmware or any combination thereof. When implemented by software, all or part of the embodiments may be implemented in the form of a computer program product.

[0115] The above-mentioned computer program product includes one or more computer instructions. When the above-mentioned computer program instructions are loaded and executed on a computer, the above-mentioned process or function according to the embodiment of the present application is generated in whole or in part. The above-mentioned computer may be a general-purpose computer, a special-purpose computer, a computer network or other programmable devices. The above-mentioned computer instructions may be stored in a computer-readable storage medium, or transmitted from a computer-readable storage medium to another computer-readable storage medium, for example, the above-mentioned computer instructions may be transmitted from a website site, a computer, a server or a data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The above-mentioned computer-readable storage medium may be any available medium that a computer can store or a data storage device such as a server, a data center, etc. that includes one or more available media integration. The above-mentioned available medium may be a magnetic medium, (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state drive (SSD)), etc.

[0116] The technical solution provided by the present application is introduced in detail above. The principles and implementation methods of the present application are explained by using specific examples in 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. At the same time, for those skilled in the art, according to the idea of ​​the present application, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as a limitation on the present application.

[0117] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0118] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices and computer program products according to the present application. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of the processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0119] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0120] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0121] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A method for allocating tasks for frontline network personnel, characterized in that: include: Get the tasks including overtime tasks and outsourced tasks and the working hours of the staff of the department on the current working day; If the task duration of the overtime task of the branch is greater than the first preset threshold or the task duration of the external task of the branch is greater than the second preset threshold, and the working time of the branch staff is greater than the third preset threshold, then a new staff member is added to the shift; A first objective function is formed by maximizing the total task time consumed by the tasks assigned to the candidate scheduling time period, and a first constraint condition is formed based on that the total task time consumed by the tasks assigned to the candidate scheduling time period is less than the total idle time in the candidate scheduling time period, so as to obtain the official scheduling time period of the newly added scheduling personnel; A second objective function is formed by maximizing the total task time of the tasks assigned within the formal scheduling time period, and a second constraint condition is formed according to the start time and end time of the formal scheduling time period, the start time and end time of the task, and the travel time between adjacent inserted tasks, so as to allocate the overtime task and / or the outsourced task to the formal scheduling time period of the newly added scheduled personnel.

2. The method for allocating tasks for frontline network personnel according to claim 1, characterized in that: The second objective function is formed by maximizing the total task time of the tasks assigned within the formal scheduling time period, and the second constraint condition is formed according to the start time and end time of the scheduling time period, the start time and end time of the task, and the travel time between adjacent inserted tasks, including: The second objective function is Among them, t i is the time taken for the current task i, q ik Indicates whether the current task i is executed in the idle time period k within the formal scheduling time period. If so, q ik =1, otherwise q ik =0; The second constraint condition includes Among them, e i Indicates the end time of the current task i, s i Indicates the start time of the current task i, E indicates the end time of the formal shift time period, S indicates the start time of the formal shift time period, idle_s k is the start time of idle time period k within the formal scheduling time period, idle_e k represents the end time of the idle time period k within the formal scheduling time period, d (i-1)i represents the time taken to travel between the previous task i-1 and the current task i, d i(i+1) It represents the time taken to travel between the current task i and the next task i+1 of the current task, n is the number of tasks, m is the number of idle time periods within the formal scheduling time period, Indicates that each task is assigned only once. Indicates that each task is assigned to only one idle time period.

3. The method for allocating tasks for frontline network personnel according to claim 1, characterized in that: The first objective function is formed by maximizing the total task time consumed by the tasks assigned to the candidate scheduling time period, and the first constraint condition is formed according to the total time consumed by the tasks assigned to the candidate scheduling time period being less than the total idle time in the candidate scheduling time period, including: The first objective function is Among them, c i represents the time taken by the current task i, x ij Indicates whether the current task i is successfully assigned to the candidate scheduling time j. If successful, x ij =1, otherwise 0; The first constraint condition includes: Among them, b j represents the length of the idle time period of candidate scheduling time period j, y j Indicates whether the candidate scheduling time period is selected. If selected, y j =1, otherwise 0, end_t i-1 <start_t i Indicates that the end time of the previous task i-1 is earlier than the start time of the current task i. Indicates that the task can only be assigned to one candidate shift time period. Indicates that only one candidate scheduling time period can be selected, n is the number of tasks, and h is the number of candidate scheduling time periods.

4. The method for allocating tasks for frontline network personnel according to claim 1, characterized in that: The method of allocating the overtime task and / or the external task to the formal scheduling time period of the newly added scheduling personnel includes: The second objective function is solved by using a heuristic algorithm. If the total task time consumed by the tasks assigned within the official scheduling time period of the newly added scheduling personnel is greater than a fourth preset threshold, the task scheduling plan for the newly added scheduling personnel is output to assign the overtime tasks and / or the outsourced tasks to the official scheduling time period of the newly added scheduling personnel. Otherwise, the solution of the second objective function is terminated.

5. The method for allocating tasks for frontline network personnel according to claim 4, characterized in that: After outputting the task scheduling plan for the newly added staff, the following is also included: The overtime tasks and / or the outsourced tasks assigned to the newly added shift personnel are removed from the task list of the point department, and the tasks are updated; Re-determine whether to add new scheduled personnel based on the updated task. If so, assign the updated task to the official scheduling time period of the newly added scheduled personnel based on the first objective function and the first constraint, as well as the second objective function and the second constraint; until the total task time consumed in the official scheduling time period of the newly added scheduled personnel after the updated task is assigned to the updated task is no longer greater than the fourth preset threshold, or the requirements for adding new scheduled personnel are not met.

6. The method for allocating tasks for frontline network personnel according to claim 1, characterized in that: The method of obtaining the official scheduling time period of the newly added scheduling personnel includes: The first objective function is solved by using an integer programming algorithm to obtain the official scheduling time period of the newly added scheduled personnel.

7. The method for allocating tasks for frontline network personnel according to claim 1, characterized in that: The acquisition of tasks including overtime tasks and external tasks and working hours of the staff of the point department on the current working day also includes: The tasks whose task duration exceeds the fifth preset threshold and the working duration whose duration is 0 are both deleted.

8. A task arrangement device for front-line network personnel, characterized in that: It includes data acquisition module, personnel addition module, shift allocation module and task allocation module; The data acquisition module is used to obtain the tasks including overtime tasks and external tasks and the working hours of the staff of the branch on the current working day; The personnel adding module is used to add new personnel to the schedule when the task duration of the overtime task of the point department is greater than the first preset threshold or the task duration of the external task of the point department is greater than the second preset threshold, and the working time of the staff of the point department is greater than the third preset threshold; The scheduling allocation module is used to maximize the total task time consumed by the tasks assigned to the candidate scheduling time period to form a first objective function, and to form a first constraint condition based on the total task time consumed by the tasks assigned to the candidate scheduling time period being less than the total idle time in the candidate scheduling time period, so as to obtain the official scheduling time period of the newly added scheduling personnel; The task allocation module is used to form a second objective function by maximizing the total task time of the tasks assigned within the formal scheduling time period, and to form a second constraint condition based on the start time and end time of the formal scheduling time period, the start time and end time of the task, and the travel time between adjacent inserted tasks, so as to allocate the overtime task and / or the outsourced task to the formal scheduling time period of the newly added scheduled personnel.

9. A task arrangement device for front-line network personnel, characterized in that: comprising a memory and a processor, wherein: The memory is used to store computer programs; The processor is used to read the computer program in the memory and execute the steps of the method for arranging tasks for front-line network personnel as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: A readable computer program is stored thereon, and when the program is executed by a processor, the steps of the method for arranging tasks for front-line network personnel as described in any one of claims 1 to 7 are implemented.