Seat scheduling method and device, electronic equipment and storage medium
By calculating the manpower gap and available shifts during the period, the problem of optimal solution to difficult-to-find problems in large-scale seating scheduling is solved, and rapid and effective resource allocation is achieved, and employee satisfaction and service quality are improved.
Patent Information
- Application Number
- CN202411065940.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-05
- Publication Date
- 2024-11-19
AI Technical Summary
It is difficult for the existing technology to quickly find the optimal solution to the large-scale seat scheduling problem, and existing algorithms are difficult to deal with complex scheduling constraints in a short period of time, making it difficult to achieve effective resource allocation.
By obtaining the manpower needs of each time period, calculating the manpower gap in the time period, determining the maximum manpower gap in the time period, obtaining available shifts and scheduling, supporting equivalent calculations of the same team and skill levels in the same group, filtering invalid searches according to constraints, and customizing scheduling Priority.
It realizes the rapid finding the optimal solution for large-scale scheduling, optimizes resource allocation, reduces invalid searches, is suitable for complex business scenarios, and improves employee satisfaction and service quality.
Smart Images

Figure CN118982193A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of computer technology, and in particular to an agent scheduling method, device, electronic equipment and storage medium. Background Art
[0002] Agent scheduling plays a key role in the call center industry. It not only involves the effective use of human resources, but also affects employee satisfaction and customer service quality. An excellent scheduling plan should take into account business needs, employee preferences and compliance requirements, and achieve the optimal allocation of resources through scientific methods and technical means. For call centers, agent scheduling is a systematic project that requires the comprehensive use of data analysis, human resource planning and on-site management to achieve the goal of improving efficiency and ensuring quality.
[0003] The scheduling problem is an NP-HARD problem, but when the schedule is complex and there are many constraints, it is very difficult to solve and it is difficult to find the optimal solution. Existing scheduling algorithms:
[0004] Linear programming algorithm and integer programming algorithm are only suitable for solving small-scale scheduling problems and cannot select shifts according to user needs and predetermined priorities.
[0005] Genetic algorithm, simulated annealing algorithm: For large-scale scheduling problems, it is difficult for the algorithm to find a better solution in a short time (such as within half an hour).
[0006] Therefore, there is an urgent need for a scheduling method that can solve large-scale scheduling problems and quickly find the optimal scheduling method. Summary of the invention
[0007] The purpose of the present invention is to overcome the above-mentioned technical deficiencies and provide a seat scheduling method, device, electronic device and storage medium suitable for financial technology or other related technical fields, so as to solve the technical problems in the prior art that large-scale seat scheduling cannot be carried out and the scheduling method is difficult to quickly find the optimal solution.
[0008] In order to achieve the above technical objectives, the present invention adopts the following technical solutions:
[0009] In a first aspect, the present invention provides a seat scheduling method, comprising the following steps:
[0010] Obtain manpower requirements for each time period;
[0011] Based on the manpower demand in each time period, calculate the manpower gap in each time period;
[0012] Based on the manpower gaps in each time period, determine the time period corresponding to the manpower gap in the largest time period;
[0013] Obtain all available shifts and corresponding constraints for the time period corresponding to the manpower shortage in the maximum time period, and calculate all available shifts for the time period corresponding to the manpower shortage in the maximum time period;
[0014] The seats are scheduled based on all available shifts in the time period corresponding to the manpower gap in the maximum time period.
[0015] In some embodiments, the calculating of the manpower gap in each time period based on the manpower demand in each time period includes:
[0016] Obtain the number of people scheduled for each time period and the skill proficiency of the scheduled personnel;
[0017] The time period manpower shortage of each time period is calculated based on the time period manpower demand of each time period, the number of people scheduled for each time period, and the skill proficiency of the scheduled personnel.
[0018] In some embodiments, the determining of the time period corresponding to the maximum time period manpower gap based on the time period manpower gap of each time period includes:
[0019] Based on the manpower gaps in each time period, calculate the manpower gap in the maximum time period;
[0020] Based on the manpower gap in the largest time period, determine the time period corresponding to the manpower gap in the largest time period.
[0021] In some embodiments, the determining of the time period corresponding to the manpower gap in the maximum time period based on the manpower gap in the maximum time period includes:
[0022] When there is only one time period for the manpower gap in the maximum time period, the time period is used as the time period corresponding to the manpower gap in the maximum time period; when there are multiple time periods for the manpower gap in the maximum time period, the time point with the largest number of manpower gaps in the maximum time period within the preset period is used as the time period corresponding to the manpower gap in the maximum time period.
[0023] In some embodiments, obtaining all schedulable manpower and corresponding constraints for the time period corresponding to the manpower gap in the maximum time period, and calculating all available shifts for the time period corresponding to the manpower gap in the maximum time period, includes:
[0024] Obtain all schedulable manpower and corresponding constraints for the time period corresponding to the manpower shortage in the maximum time period;
[0025] Based on the constraint conditions, all available shifts of each of the schedulable manpower are calculated.
[0026] In some embodiments, the constraints include shift event processing constraints and shift schedule minimum time interval processing constraints, wherein the shift time processing constraints are used to constrain the time point when the shift event occurs, and the shift schedule minimum time interval processing constraints are used to constrain the shortest time interval between shifts.
[0027] In some embodiments, scheduling seats based on all available shifts in the time period corresponding to the manpower gap in the maximum time period includes:
[0028] Based on all available shifts in the time period corresponding to the manpower gap in the maximum time period, calculating the manpower contribution of each available shift;
[0029] The shift with the largest human contribution is calculated, and seats are scheduled based on the shift with the largest human contribution.
[0030] In a second aspect, the present invention further provides a seat scheduling device, comprising:
[0031] The manpower demand acquisition module is used to obtain the manpower demand in each time period;
[0032] A gap calculation module is used to calculate the time period manpower gap of each time period based on the manpower demand of each time period;
[0033] A time period determination module is used to determine the time period corresponding to the maximum time period manpower gap based on the time period manpower gaps of each time period;
[0034] An available shift calculation module is used to obtain all available shift manpower and corresponding constraints for the time period corresponding to the manpower gap in the maximum time period, and calculate all available shifts for the time period corresponding to the manpower gap in the maximum time period;
[0035] The shift scheduling module is used to schedule seats based on all available shifts in the time period corresponding to the manpower gap in the maximum time period.
[0036] In a third aspect, the present invention further provides an electronic device, comprising: a processor and a memory;
[0037] The memory stores a computer program executable by the processor;
[0038] When the processor executes the computer program, the steps in the agent scheduling method described above are implemented.
[0039] In a fourth aspect, the present invention further provides a computer-readable storage medium, wherein the computer-readable storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to implement the steps in the agent scheduling method as described above.
[0040] Compared with the prior art, the seat scheduling method, device, electronic device and storage medium provided by the present invention first obtain the manpower demand of each time period; then, based on the manpower demand of each time period, calculate the time period manpower gap of each time period; then, based on the time period manpower gap of each time period, determine the time period corresponding to the maximum time period manpower gap; then, obtain all the schedulable manpower and corresponding constraints of the time period corresponding to the maximum time period manpower gap, calculate all the available shifts of the time period corresponding to the maximum time period manpower gap; finally, schedule the seats based on all the available shifts of the time period corresponding to the maximum time period manpower gap. The present invention is based on the maximum manpower demand gap of the time period to be scheduled as the initial scheduling time point, searches for suitable available shifts, selects suitable personnel, and schedules, supports the same group and the same shift, supports shift events, supports equivalent calculation by skill level, and does not need to generate a large number of initial scheduling results, and then filters according to constraints, avoiding many invalid searches, and can customize the scheduling priority according to needs, which is convenient for improvement and optimization according to specific business scenarios. BRIEF DESCRIPTION OF THE DRAWINGS
[0041] Figure 1 is a flow chart of the agent scheduling method provided by an embodiment of the present invention;
[0042] Figure 2 is a flowchart of step S200 in the seat scheduling method provided by an embodiment of the present invention;
[0043] Figure 3 is a flowchart of step S300 in the seat scheduling method provided by an embodiment of the present invention;
[0044] Figure 4 This is a flowchart of step S400 in the agent scheduling method provided by an embodiment of the present invention;
[0045] Figure 5 is a flowchart of step S500 in the seat scheduling method provided by an embodiment of the present invention;
[0046] Figure 6 is a schematic diagram of functional modules of the seat scheduling device provided by an embodiment of the present invention;
[0047] Figure 7 It is a schematic diagram of the hardware structure of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0048] 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 embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.
[0049] Agent scheduling plays a key role in the call center industry. It not only involves the effective use of human resources, but also affects employee satisfaction and customer service quality. An excellent scheduling plan should take into account business needs, employee preferences and compliance requirements, and achieve the optimal allocation of resources through scientific methods and technical means. For call centers, agent scheduling is a systematic project that requires the comprehensive use of data analysis, manpower planning and on-site management to achieve the goal of improving efficiency and ensuring quality. The scheduling problem is an NP-HARD problem, but when the schedule is more complex and there are more constraints, it is very difficult to solve and it is difficult to find the optimal solution. The scheduling methods in the existing technology are only suitable for small-scale scheduling or it is impossible to find a better solution within a short period of time.
[0050] Therefore, the present invention provides a method for scheduling seats, which first obtains the manpower demand of each time period; then, based on the manpower demand of each time period, calculates the time period manpower gap of each time period; then, based on the time period manpower gap of each time period, determines the time period corresponding to the maximum time period manpower gap; then, obtains all the schedulable manpower and corresponding constraints of the time period corresponding to the maximum time period manpower gap, calculates all available shifts of the time period corresponding to the maximum time period manpower gap; finally, based on all available shifts of the time period corresponding to the maximum time period manpower gap, schedules seats.
[0051] Among them, the manpower gap in each time period is obtained based on the manpower demand in each time period, the number of people scheduled in each time period, and the skill proficiency of the scheduling personnel.
[0052] The time period corresponding to the maximum time period manpower gap is first calculated by the maximum time period manpower gap, and then determined by the manpower gap of the maximum time period, wherein the determination of the time period will be specially handled for special circumstances to ensure the optimization of the results.
[0053] Available shifts are obtained through all schedulable manpower and constraints in the time period corresponding to the manpower gap in the maximum time period, where the constraints constrain the time point when the shift event occurs and the shortest time between shifts, thereby avoiding invalid searches.
[0054] The final seat scheduling plan is calculated based on the human contribution of the available shifts. The human contribution of all available shifts is calculated, and then the shift with the largest human contribution is determined. Finally, the seats are scheduled based on the shift with the largest human contribution.
[0055] For details, please refer to Figure 1 , Figure 1The flowchart of a method for scheduling agents provided by an embodiment of the present invention is a schematic diagram. The method for scheduling agents involved in the present invention can be used in scheduling agents in the financial field to quickly find the optimal scheduling method, and is suitable for large-scale scheduling. The method for scheduling agents involved in the present invention can be executed by an electronic device that can perform operations such as receiving or sending data, and can be various electronic devices with a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, portable computers, and desktop servers, etc. Figure 1 As shown, the method specifically includes the following steps S100 to S500.
[0056] S100. Obtaining manpower requirements in each time period.
[0057] In this embodiment, the manpower demand for agents during a time period refers to the number of agents required for each time period determined through scientific prediction and calculation models based on the fluctuations in the call center's call volume and traffic volume in different time periods, so as to ensure service levels and optimize human resource allocation.
[0058] First of all, the prediction of call volume is an indispensable part of the agent manpower arrangement. Therefore, when obtaining specific manpower needs, it is crucial to select highly relevant historical data as the basis for call volume prediction. The statistical interval of historical data is usually recommended to be 15 minutes, which can not only reflect the actual changes in call volume, but also avoid losing important information due to excessive statistical intervals. In addition, the average call time (AHT) is also an important reference indicator. It not only affects the service level, but also is related to many factors such as the agent's proficiency, time period, mood, etc. Therefore, collecting and analyzing historical AHT is of great significance for manpower arrangement.
[0059] Secondly, using accurate prediction models to predict the traffic volume is the basis for scientific scheduling. Weekday models and holiday models are two different prediction strategies. Weekday traffic volume often shows periodic characteristics, so a relative time model can be selected; while holidays need to be predicted based on data similar to holidays. These prediction models can help schedulers grasp future manpower needs more accurately.
[0060] Furthermore, regarding the specific manpower calculation method, there are two methods: Erlang calculation formula and computer simulation method. Erlang calculation formula predicts the possibility of answering delay by setting the number of employees and the number of calls, and further calculates the number of people required to meet a specific service level. This method is simple and fast, but it has many assumptions, such as not considering the situation where customers give up waiting. In contrast, the computer simulation method predicts various situations by simulating the actual situation of calls entering the system. Although it takes longer, it can provide more accurate and rich data information.
[0061] In this embodiment, it is assumed that the manpower demand for each time period is known and can be directly obtained. For example, there are 7 shifts in a week, and one shift is scheduled every 15 minutes. The manpower demand (FTE) every 15 minutes has been calculated and only needs to be retrieved from the database.
[0062] S200: Calculate the manpower gap in each time period based on the manpower demand in each time period.
[0063] In this embodiment, the time period manpower gap in each time period refers to the difference between the number of seats scheduled in the call center and the number of seats required in a specific time period. Specifically, in the operation of the call center, effectively managing the manpower gap in the seat time period is a key factor in ensuring service quality and customer satisfaction. This requires the comprehensive use of data analysis, scheduling optimization, technology application, and personnel management. Through the implementation of these strategies, not only can the customer waiting time caused by insufficient manpower be reduced, but also the overall service efficiency and quality can be improved, thereby maintaining an advantage in the fierce market competition. Therefore, the embodiment of the present invention calculates the time period manpower gap in each time period, thereby providing a basis for subsequent scheduling.
[0064] S300: Based on the time period manpower gaps in each time period, determine the time period corresponding to the maximum time period manpower gap.
[0065] In this embodiment, after obtaining the time period manpower gap in each time period, the maximum time period manpower gap can be calculated, and then the time period corresponding to the maximum time period manpower gap can be determined, and then based on the maximum manpower demand gap in the time period to be scheduled as the initial scheduling time point, suitable available shifts are searched, and suitable personnel are selected for scheduling.
[0066] S400, obtaining all schedulable manpower and corresponding constraints for the time period corresponding to the manpower gap in the maximum time period, and calculating all available shifts for the time period corresponding to the manpower gap in the maximum time period.
[0067] In this embodiment, firstly, all the schedulable manpower in the time period corresponding to the manpower gap in the maximum time period is obtained, wherein the schedulable manpower refers to the total number of agents included in the scheduling plan within a specific work cycle (usually a week or a month) according to the business operation needs and the personal situation of the employees (such as availability, skills, qualifications, etc.). Accurately evaluating the schedulable manpower is crucial for the call center. It is directly related to whether it can efficiently respond to customer needs and ensure the service level. By analyzing historical data, the customer consultation volume in different time periods and the human resources required for the corresponding time periods can be understood. This helps to predict future manpower needs and provide a basis for formulating scheduling plans. After obtaining all the schedulable manpower in the time period corresponding to the manpower gap in the maximum time period, all available shifts are selected from the schedulable manpower according to the constraints, and then the seats can be scheduled according to all available shifts in the future. The constraints constrain whether all schedulable manpower can be included in the scheduling plan, thereby avoiding invalid scheduling.
[0068] S500: Schedule seats based on all available shifts in the time period corresponding to the manpower shortage in the maximum time period.
[0069] In this embodiment, after obtaining the available shifts in the time period corresponding to the manpower gap in the maximum time period, the shifts can be arranged according to the available shifts. Specifically, in order to ensure that the manpower gap is as balanced as possible and to calculate the shifts equivalently according to the skill level of the agents, the shifts can be arranged by calculating the manpower contribution of all available shifts, thereby finding the local optimal solution, and it is suitable for scheduling with a large number of people.
[0070] In an embodiment of the present invention, the manpower demand of each time period is first obtained; then, based on the manpower demand of each time period, the manpower gap of each time period is calculated; then, based on the manpower gap of each time period, the time period corresponding to the maximum time period manpower gap is determined; then, all the schedulable manpower and corresponding constraints of the time period corresponding to the manpower gap of the maximum time period are obtained, and all available shifts of the time period corresponding to the manpower gap of the maximum time period are calculated; finally, seats are scheduled based on all available shifts of the time period corresponding to the manpower gap of the maximum time period. The present invention uses the maximum manpower demand gap of the time period to be scheduled as the initial scheduling time point, searches for suitable available shifts, selects suitable personnel, and schedules shifts. It supports the same group and the same shift, supports shift events, and supports equivalent calculation by skill level. It does not need to generate a large number of initial scheduling results, and then filters them according to constraints, avoiding many invalid searches. The scheduling priority can be customized according to needs, which is convenient for improvement and tuning according to specific business scenarios.
[0071] In some embodiments, see Figure 2 , the step S200 specifically includes:
[0072] S210, obtaining the number of people scheduled for each time period and the skill proficiency of the scheduling personnel;
[0073] S220: Calculate the time manpower gap for each time period based on the time manpower demand for each time period, the number of people scheduled for each time period, and the skill proficiency of the scheduled personnel.
[0074] In this embodiment, the number of people scheduled for each time period and the skill proficiency of the scheduling personnel are first obtained, wherein the skill proficiency reflects the skill of the scheduling personnel. The greater the skill proficiency, the better the skills of the scheduling personnel, thereby realizing the calculation and scheduling equivalent to the seat skill level. After obtaining the number of people scheduled for each time period and the skill proficiency of the scheduling personnel, the time period manpower gap of each time period can be calculated by a preset calculation formula. Specifically, the calculation formula for the time period manpower gap of each time period is:
[0075]
[0076] in, At time t on day d, the nth person has been scheduled to work. is the skill proficiency of the nth person who has been scheduled at the tth time on the dth day. The larger the value, the better the skill. d*t is the number of people scheduled at time t on day d, Gap d*t Represents the manpower gap at time t on day d.
[0077] In some embodiments, see Figure 3 , the step S300 specifically includes:
[0078] S310, calculating the maximum time period manpower gap based on the time period manpower gap in each time period;
[0079] S320: Based on the manpower gap in the maximum time period, determine the time period corresponding to the manpower gap in the maximum time period.
[0080] In this embodiment, after the manpower gap in each time period is obtained, the manpower gap in the maximum time period can be calculated. Specifically, the calculation formula for the manpower gap in the maximum time period is:
[0081]
[0082] Among them, MaxGap d*t It represents the maximum manpower shortage value from Monday to Sunday, and is at the tth moment on the dth day.
[0083] After obtaining the manpower gap in the maximum time period, the on-duty date d and the inspiration time period t, that is, the time period corresponding to the manpower gap in the maximum time period, can be determined according to the manpower gap in the maximum time period.
[0084] In some embodiments, the determining of the time period corresponding to the manpower gap in the maximum time period based on the manpower gap in the maximum time period includes:
[0085] When there is only one time period for the manpower gap in the maximum time period, the time period is used as the time period corresponding to the manpower gap in the maximum time period; when there are multiple time periods for the manpower gap in the maximum time period, the time point with the largest number of manpower gaps in the maximum time period within the preset period is used as the time period corresponding to the manpower gap in the maximum time period.
[0086] In this embodiment, for the time period corresponding to the maximum time period manpower gap, if there is only one time period, then the time period can be directly used as the on-duty date and inspiration time period. If there are multiple time periods, special processing is required. Specifically, if there are multiple dates d and multiple time points t, the MaxGap d*t If they are the same, then select the day from Monday to Sunday that contains MaxGap d*t The time point t with the largest number of occupancy is the inspiration time period. If there is no available class at time point t, then this time point is eliminated. If there is no available class at all time points on a certain day, then this day is eliminated and the time period is selected again.
[0087] In some embodiments, see Figure 4 , the step S400 specifically includes:
[0088] S410, obtaining all schedulable manpower and corresponding constraints for the time period corresponding to the manpower shortage in the maximum time period;
[0089] S420: Based on the constraint conditions, all available shifts of each of the schedulable manpower are calculated.
[0090] In this embodiment, firstly, all the schedulable manpower m at the time point are obtained, and then the schedulable manpower is screened according to the constraint conditions, and all the available shifts of each manpower are calculated, thereby avoiding invalid search.
[0091] In some embodiments, the constraints include shift event processing constraints and shift schedule minimum time interval processing constraints, wherein the shift time processing constraints are used to constrain the time point when the shift event occurs, and the shift schedule minimum time interval processing constraints are used to constrain the shortest time interval between shifts.
[0092] In this embodiment, the constraint condition is used to select available shifts from the schedulable manpower through constraints, thereby avoiding invalid searches. Specifically, the constraint condition is processed as follows:
[0093] Shift event processing: If the meal start time for a shift is 9:00, 9:15, and 9:30, there are 3 available shifts. If the time to be scheduled is 9:15, then the shift time includes this time point as an unavailable shift.
[0094] Processing of the shortest time interval in the shift schedule: If the end time of the Monday shift is 23:00 and the shortest time between shifts is 12 hours, then the available shift on Tuesday can only start at 11:00 at the earliest.
[0095] Therefore, through the constraints, the available shifts among the schedulable manpower can be screened out. Specifically, all available shifts of the jth schedulable manpower at time t on day d are:
[0096] In some embodiments, see Figure 5 , the step S500 specifically includes:
[0097] S510, calculating the human resource contribution of each available shift based on all available shifts in the time period corresponding to the human resource gap in the maximum time period;
[0098] S520: Calculate the shift with the largest human contribution, and schedule seats based on the shift with the largest human contribution.
[0099] In this embodiment, in a call center environment, the human contribution of the agent is an important performance indicator, which is directly related to the quality of customer service and the operational efficiency of the enterprise. The human contribution of the agent reflects the effectiveness and efficiency of the agent in handling customer inquiries, solving problems, and maintaining or improving customer satisfaction. This includes the performance of individual agents and the overall performance of the team formed by all agents. It is generally obtained through performance indicators and customer feedback. For example, the contribution of the agent is evaluated through specific performance indicators, such as the average time to handle customer inquiries (AHT), customer satisfaction score (CSAT), first time resolution rate (FCR), etc. These indicators can quantify the work efficiency of the agent and the quality of customer service, or through customer satisfaction surveys, complaint records, and letters of praise, etc., the impact of the agent service can be directly understood. In the present invention, it is assumed that the kth available shift of the jth schedulable manpower at time t is The time period covered is
t j ,T j
[0100]
[0101] Where: step function
[0102] After obtaining the human contribution of each available shift, select the shift with the largest human contribution. Specifically, it is calculated using the following formula:
[0103]
[0104] The shift is recorded as:
[0105] Where m is the maximum number of available manpower at time t on day d; K j is the number of available shifts for the jth available manpower at time t on day d.
[0106] It should be noted that in order to achieve the same shifts in the same group as much as possible and the same shifts in a week, when there are multiple time points with the same human contribution, the shifts can be selected for scheduling according to the strategy of "try to schedule the same shifts in a week; try to schedule the same group as much as possible". Specifically, "try to schedule the same shifts in a week" means that when planning the working hours of the agents, try to keep everyone's work shifts fixed and consistent within a week. This is conducive to establishing a stable work model and enabling employees to better arrange their personal lives and work. "Try to schedule the same group as much as possible" means that when scheduling, try to let members of the same work group or team work in the same time period. This is conducive to enhancing teamwork, facilitating mutual communication and support, and improving work efficiency and service quality. By adopting the scheduling strategies of "try to schedule the same shifts in a week" and "try to schedule the same group as much as possible", the present invention can improve the comfort level and service quality of the agents' work through stable working time periods and optimized teamwork.
[0107] When the time period corresponding to the manpower gap in the maximum time period is completed, step S200 to step S500 are re-executed to schedule the next time period, until all available shifts are used up or the specified termination conditions are met, and the scheduling of all seats in all time periods can be completed. The present invention is based on the maximum manpower demand gap in the time period to be scheduled as the initial scheduling time point, searches for suitable available shifts, selects suitable personnel, and schedules, which can solve the problem of large-scale scheduling, and the algorithm has less invalid searches, and the scheduling priority can be customized according to needs, which is convenient for improvement and optimization according to specific business scenarios.
[0108] The technical solution provided by the present invention first obtains the manpower demand of each time period; then, based on the manpower demand of each time period, calculates the manpower gap of each time period; then, based on the manpower gap of each time period, determines the time period corresponding to the manpower gap of the maximum time period; then, obtains all the schedulable manpower and corresponding constraints of the time period corresponding to the manpower gap of the maximum time period, calculates all the available shifts of the time period corresponding to the manpower gap of the maximum time period; finally, based on all the available shifts of the time period corresponding to the manpower gap of the maximum time period, schedules the seats. The present invention takes the maximum manpower demand gap of the time period to be scheduled as the initial scheduling time point, searches for suitable available shifts, selects suitable personnel, and schedules, supports the same group and the same shift, supports shift events, such as flexible meals, walks, supports shifts, the longest working time, the maximum continuous working time and other events, supports equivalent calculation by skill level, and does not need to generate a large number of initial scheduling results, and then filters according to constraints, avoiding many invalid searches, and can customize the scheduling priority according to needs, which is convenient for improvement and optimization according to specific business scenarios.
[0109] In addition, the scientific agent scheduling method provided by the embodiment of the present invention can ensure that there are enough agents to handle customer inquiries during peak hours, reduce customer waiting time, and improve service response speed. Through accurate prediction and adjustment, the scheduling method helps to make full use of human resources and avoid excessive or insufficient manpower allocation, thereby improving overall service efficiency. Moreover, reasonable scheduling can allow employees to better arrange their personal life and work, reduce the impact of working time on private time, thereby enhancing employee job satisfaction and loyalty. Through effective scheduling, employees can avoid working long hours or frequent shifts, reduce work pressure and prevent occupational burnout, and maintain employees' work enthusiasm and health. In addition, fixed shifts and simultaneous on-the-job work of team members facilitate communication and collaboration between teams, improve work efficiency and problem-solving capabilities, and common work experience and time can enhance the connection between team members and cultivate stronger team spirit and corporate culture.
[0110] Another embodiment of the present invention provides a seat scheduling device, see Figure 6 The seat scheduling device includes a manpower demand acquisition module 11, a gap calculation module 12, a time period determination module 13, an available shift calculation module 14 and a scheduling module 15.
[0111] The manpower demand acquisition module 11 is used to acquire the manpower demand in each time period.
[0112] The gap calculation module 12 is used to calculate the manpower gap in each time period based on the manpower demand in each time period.
[0113] The time period determination module 13 is used to determine the time period corresponding to the maximum time period manpower gap based on the time period manpower gaps of each time period.
[0114] The available shift calculation module 14 is used to obtain all schedulable manpower and corresponding constraints for the time period corresponding to the manpower gap in the maximum time period, and calculate all available shifts for the time period corresponding to the manpower gap in the maximum time period.
[0115] The scheduling module 15 is used to schedule seats based on all available shifts in the time period corresponding to the manpower gap in the maximum time period.
[0116] In this embodiment, the manpower demand of each time period is first obtained; then, based on the manpower demand of each time period, the manpower gap of each time period is calculated; then, based on the manpower gap of each time period, the time period corresponding to the maximum time period manpower gap is determined; then, all the schedulable manpower and corresponding constraints of the time period corresponding to the manpower gap of the maximum time period are obtained, and all available shifts of the time period corresponding to the manpower gap of the maximum time period are calculated; finally, based on all available shifts of the time period corresponding to the manpower gap of the maximum time period, seats are scheduled. The present invention is based on the maximum manpower demand gap of the time period to be scheduled as the initial scheduling time point, searches for suitable available shifts, selects suitable personnel, and schedules shifts. It supports the same group and the same shift, supports shift events, and supports equivalent calculation by skill level. It does not need to generate a large number of initial scheduling results, and then filters them according to constraints, avoiding many invalid searches. The scheduling priority can be customized according to needs, which is convenient for improvement and tuning according to specific business scenarios.
[0117] It should be noted that the module referred to in the present invention refers to a series of computer program instruction segments that can complete specific functions, which are more suitable for describing the execution process of agent scheduling than programs. For the specific implementation methods of each module, please refer to the corresponding method embodiments above, which will not be repeated here.
[0118] In some embodiments, the gap calculation module 12 is specifically used to:
[0119] Obtain the number of people scheduled for each time period and the skill proficiency of the scheduled personnel;
[0120] The time period manpower shortage of each time period is calculated based on the time period manpower demand of each time period, the number of people scheduled for each time period, and the skill proficiency of the scheduled personnel.
[0121] In some embodiments, the time period determination module 13 is specifically used to:
[0122] Based on the manpower gaps in each time period, calculate the manpower gap in the maximum time period;
[0123] Based on the manpower gap in the largest time period, determine the time period corresponding to the manpower gap in the largest time period.
[0124] In some embodiments, the determining of the time period corresponding to the manpower gap in the maximum time period based on the manpower gap in the maximum time period includes:
[0125] When there is only one time period for the manpower gap in the maximum time period, the time period is used as the time period corresponding to the manpower gap in the maximum time period; when there are multiple time periods for the manpower gap in the maximum time period, the time point with the largest number of manpower gaps in the maximum time period within the preset period is used as the time period corresponding to the manpower gap in the maximum time period.
[0126] In some embodiments, the available class calculation module 14 is specifically used to:
[0127] Obtain all schedulable manpower and corresponding constraints for the time period corresponding to the manpower shortage in the maximum time period;
[0128] Based on the constraint conditions, all available shifts of each of the schedulable manpower are calculated.
[0129] In some embodiments, the constraints include shift event processing constraints and shift schedule minimum time interval processing constraints, wherein the shift time processing constraints are used to constrain the time point when the shift event occurs, and the shift schedule minimum time interval processing constraints are used to constrain the shortest time interval between shifts.
[0130] In some embodiments, the scheduling module 15 is specifically used for:
[0131] Based on all available shifts in the time period corresponding to the manpower gap in the maximum time period, calculating the manpower contribution of each available shift;
[0132] The shift with the largest human contribution is calculated, and seats are scheduled based on the shift with the largest human contribution.
[0133] Another embodiment of the present invention provides an electronic device, such as Figure 7 As shown, the electronic device 10 includes:
[0134] One or more processors 110 and memory 120, Figure 7 A processor 110 is used as an example for description. The processor 110 and the memory 120 may be connected via a bus or other means. Figure 7 The example of connecting through bus is taken in the following.
[0135] The processor 110 is used to complete various control logics of the electronic device 10, and it can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), a single-chip microcomputer, an ARM (Acorn RISC Machine) or other programmable logic device, a discrete gate or transistor logic, a discrete hardware component, or any combination of these components. In addition, the processor 110 can also be any traditional processor, microprocessor or state machine. The processor 110 can also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors combined with a DSP and / or any other such configuration.
[0136] The memory 120 is a non-volatile computer-readable storage medium that can be used to store non-volatile software programs, non-volatile computer executable programs and modules, such as program instructions corresponding to the agent scheduling method in the embodiment of the present invention. The processor 110 executes various functional applications and data processing of the electronic device 10 by running the non-volatile software programs, instructions and units stored in the memory 120, that is, implements the agent scheduling method in the above method embodiment.
[0137] The memory 120 may include a program storage area and a data storage area, wherein the program storage area may store an operating platform, an application required for at least one function; the data storage area may store data created according to the use of the electronic device 10, etc. In addition, the memory 120 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some embodiments, the memory 120 may optionally include a memory remotely arranged relative to the processor 110, and these remote memories may be connected to the electronic device 10 via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
[0138] One or more units are stored in the memory 120, and when executed by one or more processors 110, the seat scheduling method in any of the above method embodiments is executed, for example, the above described Figure 1 Method steps in:
[0139] Obtain manpower requirements for each time period;
[0140] Based on the manpower demand in each time period, calculate the manpower gap in each time period;
[0141] Based on the manpower gaps in each time period, determine the time period corresponding to the manpower gap in the largest time period;
[0142] Obtain all available shifts and corresponding constraints for the time period corresponding to the manpower shortage in the maximum time period, and calculate all available shifts for the time period corresponding to the manpower shortage in the maximum time period;
[0143] The seats are scheduled based on all available shifts in the time period corresponding to the manpower gap in the maximum time period.
[0144] In some embodiments, the processor 110 further performs the following steps:
[0145] Obtain the number of people scheduled for each time period and the skill proficiency of the scheduled personnel;
[0146] The time period manpower shortage of each time period is calculated based on the time period manpower demand of each time period, the number of people scheduled for each time period, and the skill proficiency of the scheduled personnel.
[0147] In some embodiments, the processor 110 further performs the following steps:
[0148] Based on the manpower gaps in each time period, calculate the manpower gap in the maximum time period;
[0149] Based on the manpower gap in the largest time period, determine the time period corresponding to the manpower gap in the largest time period.
[0150] In some embodiments, the processor 110 further performs the following steps:
[0151] When there is only one time period for the manpower gap in the maximum time period, the time period is used as the time period corresponding to the manpower gap in the maximum time period; when there are multiple time periods for the manpower gap in the maximum time period, the time point with the largest number of manpower gaps in the maximum time period within the preset period is used as the time period corresponding to the manpower gap in the maximum time period.
[0152] In some embodiments, the processor 110 further performs the following steps:
[0153] Obtain all schedulable manpower and corresponding constraints for the time period corresponding to the manpower shortage in the maximum time period;
[0154] Based on the constraint conditions, all available shifts of each of the schedulable manpower are calculated.
[0155] In some embodiments, the constraints include shift event processing constraints and shift schedule minimum time interval processing constraints, wherein the shift time processing constraints are used to constrain the time point when the shift event occurs, and the shift schedule minimum time interval processing constraints are used to constrain the shortest time interval between shifts.
[0156] In some embodiments, the processor 110 further performs the following steps:
[0157] Based on all available shifts in the time period corresponding to the manpower gap in the maximum time period, calculating the manpower contribution of each available shift;
[0158] The shift with the largest human contribution is calculated, and seats are scheduled based on the shift with the largest human contribution.
[0159] Those skilled in the art will understand that Figure 7 The embodiments of the electronic device shown in the figure do not constitute a limitation on the specific composition of the electronic device. In other embodiments, the electronic device may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently. For example, in some embodiments, the electronic device may include a memory, a processor, and a network interface. In such embodiments, the structure and function of the memory and the processor are similar to those in the figure. Figure 7 The embodiments shown are consistent and will not be described again here.
[0160] In another embodiment of the present invention, a computer-readable storage medium is provided. The computer-readable storage medium may be a non-volatile computer-readable storage medium or a volatile computer-readable storage medium. The computer-readable storage medium stores a computer program, wherein when the computer program is executed by a processor, the automatic question-answering method disclosed in the embodiment of the present invention is implemented.
[0161] Those skilled in the art can clearly understand that, for the convenience and simplicity of description, the specific working process of the above-described equipment, devices and units can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here. Those of ordinary skill in the art can appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented with 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 the function. Whether these functions are executed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present invention.
[0162] In the several embodiments provided by the present invention, it should be understood that the disclosed equipment, 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 units is only a logical function division. There may be other division methods in actual implementation. Units with the same function may also be combined into one unit. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interfaces, devices or units, or may be electrical, mechanical or other forms of connection.
[0163] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiments of the present invention.
[0164] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
[0165] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a storage medium. Based on this understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, a background server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), disk or CD-ROM and other media that can store program codes.
[0166] In summary, the seat scheduling method, device, electronic device and storage medium provided by the present invention first obtain the manpower demand of each time period; then, based on the manpower demand of each time period, calculate the time period manpower gap of each time period; then, based on the time period manpower gap of each time period, determine the time period corresponding to the maximum time period manpower gap; then, obtain all the schedulable manpower and corresponding constraints of the time period corresponding to the manpower gap of the maximum time period, calculate all the available shifts of the time period corresponding to the manpower gap of the maximum time period; finally, schedule the seats based on all the available shifts of the time period corresponding to the manpower gap of the maximum time period. The present invention is based on the maximum manpower demand gap of the time period to be scheduled as the initial scheduling time point, searches for suitable available shifts, selects suitable personnel, and schedules, supports the same group and the same shift, supports shift events, supports equivalent calculation by skill level, and does not need to generate a large number of initial scheduling results, and then filters them according to constraints, avoiding many invalid searches, and can customize the scheduling priority according to needs, which is convenient for improvement and tuning according to specific business scenarios.
[0167] The specific implementation of the present invention described above does not constitute a limitation on the protection scope of the present invention. Any other corresponding changes and modifications made based on the technical concept of the present invention should be included in the protection scope of the claims of the present invention.
Claims
1. A seat scheduling method, characterized in that: The steps include: Obtain manpower requirements for each time period; Based on the manpower demand in each time period, calculate the manpower gap in each time period; Based on the manpower gaps in each time period, determine the time period corresponding to the manpower gap in the largest time period; Obtain all available shifts and corresponding constraints for the time period corresponding to the manpower shortage in the maximum time period, and calculate all available shifts for the time period corresponding to the manpower shortage in the maximum time period; The seats are scheduled based on all available shifts in the time period corresponding to the manpower gap in the maximum time period.
2. The seat scheduling method according to claim 1, characterized in that: The step of calculating the manpower shortage in each time period based on the manpower demand in each time period includes: Obtain the number of people scheduled for each time period and the skill proficiency of the scheduled personnel; The time period manpower shortage of each time period is calculated based on the time period manpower demand of each time period, the number of people scheduled for each time period, and the skill proficiency of the scheduled personnel.
3. The seat scheduling method according to claim 2, characterized in that: The determining of the time period corresponding to the maximum time period manpower gap based on the time period manpower gap of each time period includes: Based on the manpower gaps in each time period, calculate the manpower gap in the maximum time period; Based on the manpower gap in the largest time period, determine the time period corresponding to the manpower gap in the largest time period.
4. The seat scheduling method according to claim 3, characterized in that: The determining of the time period corresponding to the manpower gap in the maximum time period based on the manpower gap in the maximum time period includes: When there is only one time period for the manpower gap in the maximum time period, the time period is used as the time period corresponding to the manpower gap in the maximum time period; when there are multiple time periods for the manpower gap in the maximum time period, the time point with the largest number of manpower gaps in the maximum time period within the preset period is used as the time period corresponding to the manpower gap in the maximum time period.
5. The seat scheduling method according to claim 1, characterized in that: The step of obtaining all schedulable manpower and corresponding constraints for the time period corresponding to the manpower gap in the maximum time period, and calculating all available shifts for the time period corresponding to the manpower gap in the maximum time period, includes: Obtain all schedulable manpower and corresponding constraints for the time period corresponding to the manpower shortage in the maximum time period; Based on the constraint conditions, all available shifts of each of the schedulable manpower are calculated.
6. The seat scheduling method according to claim 5, characterized in that: The constraints include shift event processing constraints and shift schedule shortest time interval processing constraints, wherein the shift time processing constraints are used to constrain the time point when shift events occur, and the shift schedule shortest time interval processing constraints are used to constrain the shortest time between shifts.
7. The seat scheduling method according to claim 1, characterized in that: The scheduling of seats based on all available shifts in the time period corresponding to the manpower shortage in the maximum time period includes: Based on all available shifts in the time period corresponding to the manpower gap in the maximum time period, calculating the manpower contribution of each available shift; The shift with the largest human contribution is calculated, and seats are scheduled based on the shift with the largest human contribution.
8. A seat scheduling device, characterized in that: include: The manpower demand acquisition module is used to obtain the manpower demand in each time period; A gap calculation module is used to calculate the time period manpower gap of each time period based on the manpower demand of each time period; A time period determination module is used to determine the time period corresponding to the maximum time period manpower gap based on the time period manpower gaps of each time period; An available shift calculation module is used to obtain all available shift manpower and corresponding constraints for the time period corresponding to the manpower gap in the maximum time period, and calculate all available shifts for the time period corresponding to the manpower gap in the maximum time period; The shift scheduling module is used to schedule seats based on all available shifts in the time period corresponding to the manpower gap in the maximum time period.
9. An electronic device, characterized in that: include: Processor and memory; The memory stores a computer program executable by the processor; When the processor executes the computer program, the steps in the agent scheduling method according to any one of claims 1 to 7 are implemented.
10. A computer-readable storage medium, characterized in that: include: Processor and memory; The memory stores a computer program executable by the processor; When the processor executes the computer program, the steps in the agent scheduling method according to any one of claims 1 to 7 are implemented.
