Business processing method and device, computer program product and electronic equipment
By receiving customer information and queueing order in the bank, allocating business processes to queues with different priorities, determining service time slices for each queue, and dynamically adjusting the queues of business processes, solving the problems of low bank service efficiency and long wait times for customers, and achieving the effect of improving service efficiency and customer satisfaction.
Patent Information
- Application Number
- CN202411812482.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-10
- Publication Date
- 2025-03-28
AI Technical Summary
Bank services are inefficient, customers wait for a long time, and existing technology is difficult to dynamically adapt to business needs, ignoring the distribution characteristics of task execution time, resulting in low resource utilization and insufficient comprehensive consideration of customer satisfaction and service efficiency.
By receiving customer information and queueing order, the business process is allocated to queues with different priorities, and the service time slice is determined for each queue. The priority and time slice length of the queue are inversely correlated. The business process is executed using a polling mechanism, and the queue of the business process is dynamically adjusted based on the waiting time and satisfaction of the customer.
It improves bank service efficiency and resource utilization, reduces customer waiting time, improves customer satisfaction, and solves the problems of low bank service efficiency and long customer waiting time.
Smart Images

Figure CN119721612A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of cloud computing, and more specifically, to a business processing method, device, computer program product, and electronic device. Background Art
[0002] With the continuous advancement of technology and the improvement of people's living standards, banks, as a core component of the financial system, are increasingly concerned about the quality and efficiency of their services. Especially in the mobile internet era, customer demands for banking services are becoming more diversified, personalized, and convenient. Against this backdrop, the demand for banking services without waiting in line has emerged, becoming an inevitable trend in the development of the banking industry.
[0003] However, related technologies for controlling customer flow at bank branches suffer from the following shortcomings: Traditional scheduling algorithms (such as first-come, first-served and shortest-seek-first) cannot dynamically adapt to actual business needs, ignore the distribution characteristics of task execution time, and struggle to effectively handle peak customer flow, resulting in low resource utilization. Furthermore, existing methods fail to comprehensively consider customer satisfaction and service efficiency, making it difficult to meet bank branches' demand for efficient and convenient services, limiting further improvements in system performance and customer experience.
[0004] Currently, no effective solution has been proposed to address the problems of low banking service efficiency and long waiting time for customers in related technologies. Summary of the Invention
[0005] The main purpose of this application is to provide a business processing method, device, computer program product and electronic device to solve the problems of low banking service efficiency and long customer waiting time in related technologies.
[0006] To achieve the above-mentioned objectives, according to one aspect of the present application, a business processing method is provided. The method comprises: receiving customer information and queue order of a target customer entering a branch to queue for a target business, and determining at least one target business process required to process the target business; assigning each target business process to a target queue among N queues based on the customer information and / or queue order, wherein the N queues have different priorities and N is a positive integer; determining service time slices for each of the N queues, wherein the queue priority and the length of the service time slice are inversely correlated, and the service time slice of each queue refers to the time allowed for a business process in the queue to process a business; polling the business processes in the N queues in order from highest to lowest priority, and when a target business process in the target queue is polled, calling the target business process to execute the business content of the target business according to the service time slice of the target queue, until all target business processes are executed.
[0007] Optionally, the business processing method further includes: obtaining business association information of the target customer, wherein the business association information includes at least one of the following: the waiting time of the target customer, the satisfaction of the target customer; before polling the target business process of the target queue, dynamically adjusting the target business process to a different queue according to the business association information.
[0008] Optionally, dynamically adjusting the target business process to different queues based on the business association information includes: when multiple business association information are included, calculating the value of each business association information; performing weighted summation on the values of all business association information to obtain a target value; when the target value is greater than a numerical threshold, adjusting the unfinished target business process to a queue with a higher priority than the target queue; when the target value is less than the numerical threshold, adjusting the unfinished target business process to a queue with a lower priority than the target queue.
[0009] Optionally, dynamically adjusting the target business process to different queues based on the business association information includes: when the business association information is the waiting time of the target customer, if the waiting time of the target customer is greater than the waiting time threshold, adjusting the unfinished target business to a queue with a higher priority than the target queue; when the business association information is the satisfaction of the target customer, if the satisfaction of the target customer is less than the satisfaction threshold, adjusting the unfinished target business to a queue with a higher priority than the target queue.
[0010] Optionally, determining the service time slice for N queues separately includes: for each of the N queues, calculating the statistical value of the time for all business processes in the queue to handle business, and determining the statistical value as the service time slice of the queue, wherein the statistical value is at least one of the following: median, mean, and mode.
[0011] Optionally, after determining the service time slices for the N queues respectively, the method further includes: when the number of types of business processes in the same queue is less than a preset number, reducing the length of the queue's service time slice to obtain an updated service time slice.
[0012] Optionally, calling the target business process to execute the business content of the target business according to the service time slice of the target queue includes: for each target business process, when the service time slice of the current target queue is exhausted and the business content has not been executed, scheduling the target business process to the end of the current target queue.
[0013] To achieve the above-mentioned purpose, according to another aspect of the present application, a business processing device is provided. The device includes: a business receiving module, configured to receive customer information and queue order of target customers entering a branch to queue for target business, and determine at least one target business process required to handle the target business; a process allocation module, configured to allocate each target business process to a target queue among N queues based on the customer information and / or queue order, wherein the N queues have different priorities and N is a positive integer; a time slice determination module, configured to determine service time slices for each of the N queues, wherein the priority of the queue is inversely correlated with the length of the service time slice, and the service time slice of each queue refers to the time allowed for the business process in the queue to handle the business; and a process polling module, configured to poll the business processes in the N queues in order from highest to lowest priority, and when a target business process in the target queue is polled, call the target business process to execute the business content in the target business according to the service time slice of the target queue until all target business processes are executed.
[0014] To achieve the above objectives, according to another aspect of the present application, a computer program product is provided, which includes a non-volatile computer-readable storage medium storing a computer program, which implements a service processing method when executed by a processor.
[0015] To achieve the above-mentioned object, according to another aspect of the present application, an electronic device is provided. The device includes: a memory storing a computer program, and a processor configured to execute a service processing method through the computer program.
[0016] In an embodiment of the present application, the customer information and queue order of a target customer entering a branch to queue for a target business are received, and at least one target business process required to handle the target business is determined; each target business process is assigned to a target queue in N queues according to the customer information and / or queue order, wherein the N queues have different priorities and N is a positive integer; a service time slice is determined for each of the N queues, wherein the priority of the queue is inversely related to the length of the service time slice, and the service time slice of each queue refers to the time allowed for the business process in the queue to handle the business; the business processes in the N queues are polled in order from high to low according to the priority of the queue, and when the target business process in the target queue is polled, the target business process is called to execute the business content in the target business according to the service time slice of the target queue until all target business processes are executed. By assigning priority and time slice to the target business process of the target business, polling the target business process according to priority, and calling the target business process to process the business content according to the time slice, the purpose of improving service efficiency and resource utilization is achieved, thereby achieving the technical effect of reducing customer waiting time and improving customer satisfaction, thereby solving the problem of low bank service efficiency and long customer waiting time in the related technology. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] The accompanying drawings, which constitute part of this application, are intended to provide a further understanding of this application. The exemplary embodiments and descriptions of this application are intended to explain this application and do not constitute an improper limitation on this application. In the accompanying drawings:
[0018] Figure 1 A hardware structure block diagram of a computer terminal for implementing a business processing method is shown;
[0019] Figure 2 is a flowchart of a business processing method provided according to an embodiment of the present application;
[0020] Figure 3 is a schematic diagram of optional queue allocation provided according to an embodiment of the present application;
[0021] Figure 4 is a flowchart of an optional business processing method provided according to an embodiment of the present application;
[0022] Figure 5 This is a comparison of the optional business processing methods provided in the embodiments of this application. Figure 1 ;
[0023] Figure 6 This is a comparison of the optional business processing methods provided in the embodiments of this application. Figure 2 ;
[0024] Figure 7This is a comparison of the optional business processing methods provided in the embodiments of this application. Figure 3 ;
[0025] Figure 8 is a schematic diagram of a service processing device provided according to an embodiment of the present application;
[0026] Figure 9 This is a structural block diagram of an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION
[0027] In order to enable those skilled in the art to better understand the present invention, the following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts should fall within the scope of protection of this application.
[0028] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequential order. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.
[0029] It should be noted that the collected information (including but not limited to user personal information) and data (including but not limited to data for display, analysis, etc.) involved in this application are information and data authorized by the user or fully authorized by all parties, and the collection, storage, use, processing, transmission, provision, disclosure and application of the relevant data comply with relevant laws, regulations and standards, take necessary confidentiality measures, do not violate public order and good morals, and provide corresponding operation portals for users to choose to authorize or refuse. For example, an interface is set up between this system and relevant users or institutions to provide users with corresponding operation portals for users to choose to agree or refuse the automated decision-making results; if the user chooses to refuse, the expert decision-making process will be entered.
[0030] Example 1
[0031] According to an embodiment of the present application, an embodiment of a business processing method is also provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.
[0032] The method embodiment provided in the first embodiment of the present application can be executed in a mobile terminal, a computer terminal or a similar computing device. Figure 1 FIG1 shows a hardware structure block diagram of a computer terminal for implementing a business processing method. Figure 1 As shown, the computer terminal 10 (or mobile device) may include one or more ( Figure 1 The computer system includes a processor 102 (shown as 102a, 102b, ..., 102n) (the processor 102 may include but is not limited to a processing device such as a microprocessor (MCU) or a programmable logic device (FPGA), a memory 104 for storing data, and a transmission device 106 for communication functions. In addition, the computer system may also include: a display, an input / output interface (I / O interface, Input / Output interface), a universal serial bus (USB) port (which may be included as one of the ports of the BUS bus), a network interface, a power supply and / or a camera. It will be understood by those skilled in the art that Figure 1 The structure shown is only for illustration and does not limit the structure of the above electronic device. Figure 1 More or fewer components than shown, or with Figure 1 Different configurations shown.
[0033] It should be noted that the one or more processors 102 and / or other data processing circuits described above may generally be referred to herein as "data processing circuitry". The data processing circuitry may be embodied in whole or in part as software, hardware, firmware, or any other combination thereof. In addition, the data processing circuitry may be a single independent processing module, or may be incorporated in whole or in part into any of the other components of the computer terminal 10 (or mobile device). As described in the embodiments of the present application, the data processing circuitry serves as a processor control (e.g., selection of a variable resistor terminal path connected to an interface).
[0034] The memory 104 can be used to store software programs and modules of application software, such as the program instructions / data storage device corresponding to the business processing method in the embodiment of the present application. The processor 102 executes various functional applications and data processing by running the software programs and modules stored in the memory 104, that is, implementing the above-mentioned business processing method. The memory 104 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 104 may further include a memory remotely located relative to the processor 102, and these remote memories may be connected to the computer terminal 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.
[0035] The transmission device 106 is configured to receive or transmit data via a network. A specific example of the aforementioned network may include a wireless network provided by the communications provider of the computer terminal 10. In one embodiment, the transmission device 106 includes a network interface controller (NIC), which can be connected to other network devices via a base station to enable communication with the Internet. In another embodiment, the transmission device 106 may be a radio frequency (RF) module, which is configured to communicate with the Internet wirelessly.
[0036] The display may be, for example, a touch screen liquid crystal display (LCD), which enables a user to interact with a user interface of the computer terminal 10 (or mobile device).
[0037] Under the above operating environment, this application provides Figure 2 The business processing method shown. Figure 2 This is a flowchart of a business processing method provided according to an embodiment of the present application.
[0038] Step S201: receiving customer information and queue order of target customers entering a branch to queue for target services, and determining at least one target service process required for handling the target services.
[0039] Specifically, based on the customer's business needs, the branch analyzes and identifies at least one target business process required to process the target service. For example, a target business process might include specific steps such as identity verification, account transaction processing, or generating relevant invoices. Its purpose is to accurately record customer information and clearly define the specific steps required to process the target service, thus providing a basis for subsequent business processing and allocation. By breaking down specific business processes based on customer queue order and target service needs, orderly business processing can be ensured.
[0040] It should be noted that customer information may include the customer type and the urgency of the business. The customer type is determined by the branch based on the customer's historical business processing information and historical satisfaction. The queue order is sorted according to the time when the customer submits the business application. The earlier the customer submits the business application, the higher the queue order. Conversely, the later the customer submits the business application, the later the queue order.
[0041] Step S202 : Allocate each target service process to a target queue among N queues according to the customer information and / or the queuing order, wherein the N queues have different priorities and N is a positive integer.
[0042] Specifically, queues are assigned different priorities to distinguish between different types of customers or the urgency of different services. The service processing system assigns high-priority target services to higher-priority queues for priority processing in subsequent rounds. Important customers are assigned to higher-priority queues; more urgent services are assigned to higher-priority queues.
[0043] Step S203 , determining service time slices for each of the N queues, wherein the priority of the queue is inversely correlated with the length of the service time slice. The service time slice of each queue refers to the time allowed for a service process in the queue to handle services.
[0044] Specifically, queues with higher priorities are assigned shorter time slices to ensure that urgent or important services can be polled and processed quickly; while queues with lower priorities are assigned longer time slices to process ordinary services or low-priority services that take longer. The length of the service time slice is determined based on statistical analysis.
[0045] For example, when statistical analysis shows that the average processing time of a business is longer, a longer time slice will be allocated to this type of business; when statistical analysis shows that the average processing time of a business is shorter, a shorter time slice will be allocated to this type of business.
[0046] Step S204, poll the business processes in N queues in order from high to low according to the priority of the queues. When the target business process of the target queue is polled, call the target business process to execute the business content in the target business according to the service time slice of the target queue until all target business processes are executed.
[0047] Specifically, polling refers to accessing and processing business processes in multiple queues in a specific order, avoiding excessive concentration of resources on a single priority queue. For example, the business processing system selects queues for inspection and processing, from high to low priority, based on their respective priorities. When a queue is polled, the top business process in that queue is prioritized according to the preset service time slice, followed by subsequent business processes until all business processes in that queue are completed. The business processing device will continuously traverse and process all queues one by one until all business processes are completed.
[0048] In an embodiment of the present application, the customer information and queue order of a target customer entering a branch to queue for a target business are received, and at least one target business process required to handle the target business is determined; each target business process is assigned to a target queue in N queues according to the customer information and / or queue order, wherein the N queues have different priorities and N is a positive integer; a service time slice is determined for each of the N queues, wherein the priority of the queue is inversely related to the length of the service time slice, and the service time slice of each queue refers to the time allowed for the business process in the queue to handle the business; the business processes in the N queues are polled in order from high to low according to the priority of the queue, and when the target business process in the target queue is polled, the target business process is called to execute the business content in the target business according to the service time slice of the target queue until all target business processes are executed. By assigning priority and time slice to the target business process of the target business, polling the target business process according to priority, and calling the target business process to process the business content according to the time slice, the purpose of improving service efficiency and resource utilization is achieved, thereby achieving the technical effect of reducing customer waiting time and improving customer satisfaction, thereby solving the problem of low bank service efficiency and long customer waiting time in the related technology.
[0049] In order to optimize resource allocation and improve service efficiency, optionally, in the business processing method provided in the embodiment of the present application, the method also includes: obtaining business association information of the target customer, wherein the business association information includes at least one of the following: the waiting time of the target customer, the satisfaction of the target customer; before polling the target business process of the target queue, dynamically adjusting the target business process to a different queue according to the business association information.
[0050] Figure 3 is a schematic diagram of optional queue allocation provided according to an embodiment of the present application, such as Figure 3As shown, the figure demonstrates the process of queue scheduling and allocation, where T1, T2, and T3 are time slices. Specifically, the size of the time slices: T1 < T2 < T3, and the priority levels: the ready queue 1 is higher than the ready queue 2, the ready queue 2 is higher than the ready queue 3, and so on. The arrows in the figure represent the processing of processes. For example, the arrow pointing to the right from the ready queue 1 represents the process being processed in the queue, and the arrow pointing to the ready queue 2 represents that after processing the processes in the ready queue 1, the processing of the processes in the ready queue 2 begins.
[0051] Specifically, by collecting the business-related information of the target customers, such as the waiting time, satisfaction, and business urgency of the customers, the business processing system can evaluate the priority requirements of the business processes in real time. Before polling the target queue, the queue where the target business process is located is dynamically adjusted according to the evaluation results. For example, if it is detected that the customer waiting time is close to or exceeds the preset tolerance threshold, the priority of the target business process can be increased and allocated to a queue with a higher priority, so as to speed up its processing speed. Another example is that for businesses with a higher satisfaction or lower urgency, the queue priority can be appropriately reduced to optimize the allocation of system resources.
[0052] The embodiment of the present application reduces the probability of delayed processing of high-priority tasks and avoids the occupation of system resources by low-priority tasks staying for a long time through collecting business-related information for queue allocation.
[0053] To more precisely schedule the priorities of business processes, optionally, in the business processing method provided in the embodiment of the present application, dynamically adjusting the target business process to different queues according to the business-related information includes: in the case of including multiple business-related information, calculating the value of each business-related information; performing a weighted sum of the values of all business-related information to obtain a target value; in the case where the target value is greater than the value threshold, adjusting the uncompleted target business process to a queue with a priority higher than the target queue where it is located; in the case where the target value is less than the value threshold, adjusting the uncompleted target business process to a queue with a priority lower than the target queue where it is located.
[0054] Specifically, the value of the business-related information includes at least one of the following: the customer's historical business urgency, the average historical business time, the customer's importance, and the customer's historical satisfaction. When at least one of the following is met: the customer's historical business urgency is high, the average historical business time is long, the customer's importance is high, and the customer's historical satisfaction is low, the weight of that item is increased. When the target value is high, it means that the customer's demand is more urgent, or the business is relatively urgent. The business processing system will increase the priority of the business process accordingly and adjust it to a higher priority queue to ensure that it can be processed faster. Conversely, when the target value is low, it indicates that the urgency of the business is low. The business processing system will lower its priority and adjust it to a lower priority queue to better allocate processing resources.
[0055] The embodiment of the present application evaluates the importance of business needs in real time and reasonably schedules each business process to achieve effective control of business processing speed and quality.
[0056] In order to more accurately schedule the priority of the business process, optionally, in the business processing method provided in the embodiment of the present application, dynamically adjusting the target business process to different queues according to the business association information includes: when the business association information is the waiting time of the target customer, if the waiting time of the target customer is greater than the waiting time threshold, adjusting the unfinished target business to a queue with a higher priority than the target queue in which it is located; when the business association information is the satisfaction of the target customer, if the satisfaction of the target customer is less than the satisfaction threshold, adjusting the unfinished target business to a queue with a higher priority than the target queue in which it is located.
[0057] Specifically, if the customer's waiting time exceeds the set threshold, it means that the customer has waited too long. In order to improve their service experience, the business processing system will move the business process from the current queue to a higher priority queue to speed up its processing; if the customer's satisfaction is lower than the preset threshold, it means that action needs to be taken to improve the customer experience. At this time, the unfinished target business process will also be adjusted to a higher priority queue for faster processing.
[0058] Dynamic scheduling is performed based on customer status information, increasing the service process priority of customers who have been waiting for too long or are dissatisfied with the service. The embodiment of the present application prioritizes important situations that may affect the customer experience, thereby optimizing the overall service process, reducing customer dissatisfaction, and improving customer satisfaction.
[0059] In order to reasonably allocate system resources and ensure that queues of different priorities can operate effectively, optionally, in the business processing method provided in the embodiment of the present application, determining the service time slices for N queues respectively includes: for each of the N queues, calculating the statistical value of the time for all business processes in the queue to process business, and determining the statistical value as the service time slice of the queue, wherein the statistical value is at least one of the following: median, mean, and mode.
[0060] Specifically, the business processing system can dynamically set the service time slice based on the actual business processing time in the queue. For example, for queues with shorter average processing time, allocating shorter service time slices can effectively improve processing efficiency; and for business queues that require a longer time to complete, allocating relatively longer time slices can reduce frequent switching and reduce system overhead.
[0061] For example, the median calculation method can be used to calculate the time slice. This method can ensure that about half of the business is processed after each execution, thereby reducing the number of business process switches in the system and improving overall resource utilization. The formula for calculating the time slice is:
[0062]
[0063] Y is the middle value after the processes are arranged in ascending order; N is the number of processes in the current queue; Q0 is the system default time slice size.
[0064] It should be noted that if the median execution time of the processes in the ready queue is less than Q0, then in order to reduce the number of context switches, the time slice size is set to Q0 (where Q0 is the time slice obtained by the operating system based on user behavior. It can be expressed as:
[0065]
[0066] The embodiment of the present application optimizes the rationality of time slice allocation of network points, so that the calculated time slices can improve the customer's service experience.
[0067] In order to complete the processing of the business process as quickly as possible when the business type is relatively single, optionally, in the business processing method provided in the embodiment of the present application, after determining the service time slices for N queues respectively, the method also includes: when the number of types of business processes in the same queue is less than a preset number, reducing the length of the queue's service time slice to obtain an updated service time slice.
[0068] For example, when the preset number is 3, if the number of types of business processes in the same queue is less than 3, it means that the business types in the queue are relatively single. Because the efficiency of the outlet is higher when processing businesses with high similarity, the length of the queue's service time slice is reduced to be close to the actual service time.
[0069] Specifically, if the number of service processes in the same queue is less than a preset number, the length of the queue's service time slice is reduced. This is to avoid wasting resources due to setting the service time slice too long. This ensures that tasks in the queue are processed promptly and efficiently, especially when the processing load is light. While meeting customer needs, the embodiments of the present application can also continuously optimize time slice allocation based on the actual situation of the queue.
[0070] In order to deal with the situation where the time slice is exhausted during the execution process, optionally, in the business processing method provided in the embodiment of the present application, calling the target business process to execute the business content of the target business according to the service time slice of the target queue includes: for each target business process, when the service time slice of the current target queue is exhausted and the business content has not been executed, the target business process is scheduled to the end of the current target queue.
[0071] Specifically, when a target service process is called and executes tasks according to the target queue's service time slice, if the service time slice expires and the task content is still unfinished, the service processing device will schedule the target service process to the end of the current target queue. This scheduling strategy ensures that tasks that fail to complete within the time slice do not occupy resources for a long time, but instead requeue and wait for the next execution opportunity.
[0072] In the embodiment of the present application, by scheduling unfinished business to the end of the queue when the time slice is exhausted, the system can give priority to other tasks and avoid the impact of a single business on the overall service efficiency.
[0073] Figure 4 is a flowchart of an optional business processing method provided according to an embodiment of the present application, such as Figure 4As shown, the method includes: when a customer enters a branch, he is assigned to a queue with different priorities; the service window starts serving from the high-priority queue; when the service starts, the queue is polled and a time slice is allocated based on the number of customers and the service time of the business, where the service time is obtained based on historical records; after the service is completed, the service time and customer satisfaction are recorded to determine whether the customer is satisfied with the service; if the customer is not satisfied, the customer priority is increased and the service quality of the customer next time is optimized, such as the customer priority; if the customer is satisfied, the next queue is served during the window idle time; the system evaluates the customer priority in all queues, adjusts the priority based on time and satisfaction, and gives priority to the highest priority, where time is the waiting time of the customer and satisfaction is the customer's satisfaction with the service; the system monitors the length of each queue, adjusts the number of queues and the number of service windows according to actual conditions, and optimizes service efficiency; according to the actual service capacity of the bank branch, controls the number of customers in each queue to avoid waiting, for example, controls the number of customers in the queue to no more than a threshold; monitors the status of each queue, including the number of customers, waiting time, and customer satisfaction, and feeds back information to optimize parameters and strategies to improve service quality; and ends the process.
[0074] Figure 5 This is a comparison of the optional business processing methods provided in the embodiments of this application. Figure 1 ; Figure 6 This is a comparison of the optional business processing methods provided in the embodiments of this application. Figure 2 ; Figure 7 This is a comparison of the optional business processing methods provided in the embodiments of this application. Figure 3 .like Figure 5 、 Figure 6 and Figure 7 As shown, the service processing method of the embodiment of the present application has significant advantages over the fixed-time multi-level feedback queue (EMLFQ) scheduling algorithm and the multi-level feedback queue (PMLFQ) scheduling algorithm with exponentially increasing time slice sizes, especially in reducing the number of inter-process switches, turnaround time, and waiting time. The improved method can dynamically adjust the time slice size according to the process situation, thereby improving system throughput.
[0075] The average turnaround time is calculated using the following formula:
[0076]
[0077] In the formula, n is the number of processes in a business, T is the turnaround time of a process, and the turnaround time is the total time it takes for a process to be executed from the beginning to the end.
[0078] The average waiting time is calculated using the following formula:
[0079]
[0080] In the formula, t is the waiting time of a process.
[0081] It should be noted that the steps shown in the flowcharts of the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions, and that, although a logical order is shown in the flowcharts, in some cases, the steps shown or described can be executed in an order different from that shown here.
[0082] Example 2
[0083] The embodiment of the present application further provides a service processing device. It should be noted that the service processing device of the embodiment of the present application can be used to execute the service processing method provided in the embodiment of the present application. The service processing device provided in the embodiment of the present application is introduced below. Figure 8 is a schematic diagram of a service processing device according to an embodiment of the present application, such as Figure 8 As shown, the device includes:
[0084] The service receiving module 801 is used to receive the customer information and queue order of the target customer entering the branch to queue for the target service, and determine at least one target service process required to handle the target service;
[0085] The process allocation module 802 is configured to allocate each target service process to a target queue among N queues according to customer information and / or queue order, wherein the N queues have different priorities and N is a positive integer;
[0086] The time slice determination module 803 is configured to determine service time slices for each of the N queues. The queue priority and the length of the service time slice are inversely correlated. The service time slice of each queue refers to the time allowed for a service process in the queue to handle services.
[0087] The process polling module 804 is used to poll the business processes in N queues in order from high to low according to the priority of the queues. When the target business process of the target queue is polled, the target business process is called to execute the business content in the target business according to the service time slice of the target queue until all target business processes are executed.
[0088] The business processing device provided by the embodiment of the present application includes a business receiving module 801, which receives customer information and queue order of target customers who enter the branch to queue for target business, and determines at least one target business process required to handle the target business; a process allocation module 802, which allocates each target business process to a target queue in N queues according to the customer information and / or queue order, wherein the N queues have different priorities and N is a positive integer; a time slice determination module 803, which determines service time slices for the N queues respectively, wherein the priority of the queue is inversely correlated with the length of the service time slice, and the service time slice of each queue refers to the time allowed for the business process in the queue to handle the business; a process polling module 804, which polls the business processes in the N queues in order from high to low according to the priority of the queues, and when the target business process of the target queue is polled, calls the target business process to execute the business content in the target business according to the service time slice of the target queue until all target business processes are executed. By assigning priority and time slices to the target business processes of the target business, polling the target business processes according to priority, and calling the target business processes to process the business content according to the time slice, the purpose of improving service efficiency and resource utilization is achieved, thereby achieving the technical effect of reducing customer waiting time and improving customer satisfaction, and thus solving the problems of low banking service efficiency and long customer waiting time in related technologies.
[0089] It should be noted that the above modules correspond to steps S201 to S204 in Example 1, and the examples and application scenarios implemented by each module and the corresponding steps are the same, but are not limited to the contents disclosed in the above Example 1. It should be noted that the above modules or units can be hardware components or software components stored in a memory (e.g., memory 104) and processed by one or more processors (e.g., processors 102a, 102b, ..., 102n). The above modules can also be run as part of the device in the computer terminal 10 provided in Example 1.
[0090] Optionally, the business processing device provided in the embodiment of the present application further includes an information acquisition module for obtaining business-related information of the target customer, wherein the business-related information includes at least one of the following: the waiting time of the target customer, the satisfaction of the target customer; and an adjustment module for dynamically adjusting the target business process to a different queue according to the business-related information before polling the target business process of the target queue.
[0091] Optionally, in the business processing device provided in the embodiment of the present application, the adjustment module includes: a first calculation submodule, used to calculate the value of each business association information when multiple business association information are included; perform weighted summation on the values of all business association information to obtain a target value; a first adjustment submodule, used to adjust the unfinished target business process to a queue with a higher priority than the target queue when the target value is greater than a numerical threshold; a second adjustment submodule, used to adjust the unfinished target business process to a queue with a lower priority than the target queue when the target value is less than the numerical threshold.
[0092] Optionally, in the business processing device provided in the embodiment of the present application, the adjustment module includes: a third adjustment sub-module, which is used to adjust the unfinished target business to a queue with a higher priority than the target queue in which it is located if the business-related information is the waiting time of the target customer and the waiting time of the target customer is greater than the waiting time threshold; and a fourth adjustment sub-module, which is used to adjust the unfinished target business to a queue with a higher priority than the target queue in which it is located if the business-related information is the satisfaction of the target customer and the satisfaction of the target customer is less than the satisfaction threshold.
[0093] Optionally, in the business processing device provided in the embodiment of the present application, the time slice determination module 803 includes: a second calculation sub-module, which is used to calculate the statistical value of the time for all business processes in the queue to process business for each queue in the N queues, and determine the statistical value as the service time slice of the queue, wherein the statistical value is at least one of the following: median, mean, and mode.
[0094] Optionally, the business processing device provided in the embodiment of the present application also includes a time slice update module, which is used to reduce the length of the queue's service time slice after determining the service time slice for N queues respectively, when the number of types of business processes in the same queue is less than a preset number, to obtain an updated service time slice.
[0095] Optionally, in the business processing device provided in the embodiment of the present application, the process polling module 804 includes: a scheduling sub-module, which is used to schedule each target business process to the end of the current target queue when the service time slice of the current target queue is exhausted and the business content has not been executed.
[0096] Example 3
[0097] An embodiment of the present application may provide an electronic device, Figure 9 This is a structural block diagram of an electronic device according to an embodiment of the present application. Figure 9 As shown, the electronic device may include: one or more ( Figure 9Only one is shown) processor 902, memory 904, storage controller, and peripheral interface, wherein the peripheral interface is connected to the radio frequency module, audio module and display.
[0098] Among them, the memory can be used to store software programs and modules, such as program instructions / modules corresponding to the methods and devices in the embodiments of the present application. The processor executes various functional applications and data processing by running the software programs and modules stored in the memory, that is, implementing the above-mentioned method. The memory may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory may further include a memory remotely arranged relative to the processor, and these remote memories may be connected to the terminal 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 a combination thereof.
[0099] The processor can call the information and application stored in the memory through the transmission device to perform the following steps: receiving customer information and queue order of target customers who enter the branch to queue for target business, and determining at least one target business process required to handle the target business; assigning each target business process to a target queue in N queues according to the customer information and / or queue order, wherein the N queues have different priorities and N is a positive integer; determining service time slices for the N queues respectively, wherein the priority of the queue is inversely correlated with the length of the service time slice, and the service time slice of each queue refers to the time allowed for the business process in the queue to handle the business; polling the business processes in the N queues in order from high to low according to the priority of the queue, and when the target business process of the target queue is polled, calling the target business process to execute the business content in the target business according to the service time slice of the target queue until all target business processes are executed.
[0100] The processor can also call the information and application stored in the memory through the transmission device to perform the following steps: Optionally, the business processing method also includes: obtaining business-related information of the target customer, wherein the business-related information includes at least one of the following: the waiting time of the target customer, the satisfaction of the target customer; before polling the target business process of the target queue, dynamically adjusting the target business process to a different queue according to the business-related information.
[0101] The processor can also call the information and application stored in the memory through the transmission device to perform the following steps: Optionally, dynamically adjusting the target business process to different queues based on the business association information includes: when multiple business association information are included, calculating the value of each business association information; performing weighted summation on the values of all business association information to obtain a target value; when the target value is greater than a numerical threshold, adjusting the unfinished target business process to a queue with a higher priority than the target queue; when the target value is less than the numerical threshold, adjusting the unfinished target business process to a queue with a lower priority than the target queue.
[0102] The processor can also call the information and application stored in the memory through the transmission device to perform the following steps: Optionally, dynamically adjusting the target business process to different queues based on the business association information includes: when the business association information is the waiting time of the target customer, if the waiting time of the target customer is greater than the waiting time threshold, then adjusting the unfinished target business to a queue with a higher priority than the target queue; when the business association information is the satisfaction of the target customer, if the satisfaction of the target customer is less than the satisfaction threshold, then adjusting the unfinished target business to a queue with a higher priority than the target queue.
[0103] The processor can also call the information and application stored in the memory through the transmission device to perform the following steps: Optionally, determining the service time slices for N queues separately includes: for each of the N queues, calculating the statistical value of the time for all business processes in the queue to handle business, and determining the statistical value as the service time slice of the queue, wherein the statistical value is at least one of the following: median, mean, mode.
[0104] The processor can also call the information and application stored in the memory through the transmission device to perform the following steps: Optionally, after determining the service time slices for N queues respectively, the method also includes: when the number of types of business processes in the same queue is less than a preset number, reducing the length of the queue's service time slice to obtain an updated service time slice.
[0105] The processor can also call the information and applications stored in the memory through the transmission device to perform the following steps: Optionally, calling the target business process to execute the business content of the target business according to the service time slice of the target queue includes: for each target business process, when the service time slice of the current target queue is exhausted and the business content has not been executed, the target business process is scheduled to the end of the current target queue.
[0106] In an embodiment of the present application, the customer information and queue order of a target customer entering a branch to queue for a target business are received, and at least one target business process required to handle the target business is determined; each target business process is assigned to a target queue in N queues according to the customer information and / or queue order, wherein the N queues have different priorities and N is a positive integer; a service time slice is determined for each of the N queues, wherein the priority of the queue is inversely related to the length of the service time slice, and the service time slice of each queue refers to the time allowed for the business process in the queue to handle the business; the business processes in the N queues are polled in order from high to low according to the priority of the queue, and when the target business process in the target queue is polled, the target business process is called to execute the business content in the target business according to the service time slice of the target queue until all target business processes are executed. By assigning priority and time slice to the target business process of the target business, polling the target business process according to priority, and calling the target business process to process the business content according to the time slice, the purpose of improving service efficiency and resource utilization is achieved, thereby achieving the technical effect of reducing customer waiting time and improving customer satisfaction, thereby solving the problem of low bank service efficiency and long customer waiting time in the related technology.
[0107] It can be understood by those skilled in the art that Figure 9 The structure shown is for illustration only, and the electronic device may also be a smart phone, a tablet computer, a PDA, a mobile Internet device (MID), a PAD or other terminal device. Figure 9 It does not limit the structure of the above electronic device. For example, the electronic device may also include Figure 9 More or fewer components (such as network interfaces, display devices, etc.) shown in, or with Figure 9 Different configurations shown.
[0108] A person skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be completed by instructing the hardware related to the terminal device through a program, and the program can be stored in a computer-readable storage medium, which may include: a flash drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.
[0109] Example 4
[0110] The embodiment of the present application further provides a storage medium. Optionally, in this embodiment, the storage medium can be used to store the program code executed by the service processing method provided in the first embodiment.
[0111] Optionally, in this embodiment, the storage medium may be located in any computer terminal in a computer terminal group in a computer network, or in any mobile terminal in a mobile terminal group.
[0112] The present application also provides a computer program product, which, when executed on a data processing device, is suitable for executing the steps of the business processing method.
[0113] The serial numbers of the above embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.
[0114] In the above embodiments of the present application, the description of each embodiment has its own focus. For parts that are not described in detail in a certain embodiment, please refer to the relevant description of other embodiments.
[0115] In the several embodiments provided in this application, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods, such as multiple units 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 units or modules, which can be electrical or other forms.
[0116] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.
[0117] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.
[0118] 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 computer-readable storage medium. Based on this understanding, the technical solution of the present application 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, and the computer software product is stored in a storage medium, including a number of instructions for enabling a computer device (which can be a personal computer, a server or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk.
[0119] The above is only a preferred embodiment of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.
Claims
1. A business processing method, characterized in that: include: Receiving customer information and queue order of target customers entering the outlet to queue up for target services, and determining at least one target service process required for handling the target services; Allocating each target service process to a target queue among N queues according to the customer information and / or the queuing order, wherein the N queues have different priorities and N is a positive integer; Determine service time slices for the N queues respectively, wherein the priority of the queue is inversely related to the length of the service time slice, and the service time slice of each queue refers to the time allowed for the service process in the queue to handle the service; The business processes in the N queues are polled in order from high to low according to the priority of the queues. When the target business process of the target queue is polled, the target business process is called to execute the business content in the target business according to the service time slice of the target queue until all the target business processes are executed.
2. The service processing method according to claim 1, characterized in that: The method further comprises: Acquire the business-related information of the target customer, wherein the business-related information includes at least one of the following: the waiting time of the target customer, the satisfaction of the target customer; Before polling the target service process of the target queue, dynamically adjust the target service process to a different queue according to the service association information.
3. The service processing method according to claim 2, characterized in that: Dynamically adjusting the target service process to different queues according to the service association information includes: In the case where a plurality of the business association information are included, calculating a value of each of the business association information; Performing a weighted summation on the values of all the business-related information to obtain a target value; When the target value is greater than the value threshold, the unfinished target service process is adjusted to a queue having a higher priority than the target queue; When the target value is less than the value threshold, the unfinished target service process is adjusted to a queue with a lower priority than the target queue.
4. The service processing method according to claim 2, characterized in that: Dynamically adjusting the target service process to different queues according to the service association information includes: In the case where the service association information is the waiting time of the target customer, if the waiting time of the target customer is greater than the waiting time threshold, adjusting the unfinished target service to a queue with a higher priority than the target queue; In the case where the service association information is the target customer's satisfaction, if the target customer's satisfaction is less than a satisfaction threshold, the unfinished target service is adjusted to a queue with a higher priority than the target queue.
5. The service processing method according to claim 1, characterized in that: Determining service time slices for the N queues respectively includes: For each of the N queues, a statistical value of the time taken by all business processes in the queue to handle business is calculated, and the statistical value is determined as a service time slice of the queue, wherein the statistical value is at least one of the following: median, mean, mode.
6. The service processing method according to claim 1, characterized in that: After determining service time slices for the N queues respectively, the method further includes: When the number of types of service processes in the same queue is less than a preset number, the length of the service time slice of the queue is reduced to obtain an updated service time slice.
7. The service processing method according to claim 1, characterized in that: Calling the target service process to execute the service content in the target service according to the service time slice of the target queue includes: For each target service process, when the service time slice of the current target queue is exhausted and the service content is not completely executed, the target service process is scheduled to the end of the current target queue.
8. A service processing device, characterized in that: include: A service receiving module, used to receive customer information and queue order of target customers entering the outlets to queue up for target services, and determine at least one target service process required for handling the target services; A process allocation module, used to allocate each target service process to a target queue among N queues according to the customer information and / or the queuing order, wherein the N queues have different priorities and N is a positive integer; A time slice determination module is used to determine service time slices for the N queues respectively, wherein the priority of the queue is inversely related to the length of the service time slice, and the service time slice of each queue refers to the time allowed for the service process in the queue to handle the service; The process polling module is used to poll the business processes in the N queues in order from high to low according to the priority of the queues. When the target business process of the target queue is polled, the target business process is called to execute the business content in the target business according to the service time slice of the target queue until all the target business processes are executed.
9. A computer program product, characterized in that It comprises a non-volatile computer-readable storage medium, wherein the non-volatile computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the business processing method according to any one of claims 1 to 7 is implemented.
10. An electronic device comprising a memory and a processor, characterized in that: The memory stores a computer program, and the processor is configured to execute the business processing method according to any one of claims 1 to 7 through the computer program.
Citation Information
Cited By
Task adjustment method and device, storage medium, electronic equipment and computer program product
CN120448078A