Queue management method and system for automatic recommendation of ticket dispensing service

By obtaining user ID information, querying historical queuing data, and using a business association table to recommend related services, the problem of long queuing times for customers at related service locations in existing technologies has been solved, achieving faster queuing and improved user experience.

CN118609255BActive Publication Date: 2026-11-10NANJING AOTO ELECTRONICS CO LTD
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
CN202411035087.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-07-31
Publication Date
2026-11-10
Estimated Expiration
2044-07-31

AI Technical Summary

Technical Problem

The existing queuing machine management system is not user-friendly in locations where there is business overlap, causing customers to spend a long time searching and getting a number.

Method used

By obtaining the user's ID information, querying the historical queuing data table and filtering the data, and using the business association table to recommend related services, the relevant services are displayed on the queuing machine interface.

Benefits of technology

This reduces the time customers spend getting a number, alleviates the difficulty of getting a number, and improves the efficiency of business processing and user experience.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118609255B_ABST
    Figure CN118609255B_ABST
Patent Text Reader

Abstract

This invention discloses a queuing machine management method and system for automatically recommending queuing numbers, relating to the field of queuing number technology. The method includes: acquiring first user information, including the user's ID card information; inputting the first user information into a preset historical queuing data table for querying, obtaining query results; filtering data based on the query results, and extracting relevant business information from the filtered results; the business information including a business ID and a business name; and querying a preset database business association table based on the business information to obtain target-related business information and displaying it. This invention solves the problem that existing technologies are not user-friendly in locations where businesses are related, thus requiring customers to spend considerable time searching for the required business when they return to the branch for related / continuous services.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of queuing and number-taking technology, and in particular to a queuing machine management method and system for automatically recommending number-taking services. Background Technology

[0002] As society continues to develop and progress, the services and types of businesses in many places are becoming increasingly refined. For example, government service halls, real estate centers, and public security offices offer a wide variety of services.

[0003] In the prior art, patent number CN109300218A discloses a queuing machine management system and method for automatically arranging the order of ticket collection services, including a client and a configuration module; the client stores service types; the configuration module is set in the queuing machine backend to realize time period configuration; the configuration module includes a database, which is used by the queuing machine client to read the number of tickets collected for each service type within the configured time period from the database to realize the sorting of services.

[0004] Although the queuing machine management system can reorder the services on the queuing machine's ticket-taking interface based on the number of tickets taken for each service within a certain period, placing services with a higher number of tickets at the top, the existing technology cannot be used effectively in locations where services are related due to the repetitive nature of customer transactions. Therefore, when customers return to the branch to handle related or continuous services, they still need to spend a considerable amount of time searching for the services they need to handle, and no effective solution has yet been proposed. Summary of the Invention

[0005] Purpose of the invention: To provide a queuing machine management method and system for automatically recommending number-taking services, so as to at least solve one of the problems existing in the prior art.

[0006] Technical Solution: A queuing machine management method for automatically recommending queuing services includes: obtaining first user information; wherein the first user information includes: the ID card information of the first user; inputting the first user information into a preset historical queuing data table for querying to obtain query results; performing data filtering based on the query results, and extracting corresponding business information from the filtered results; wherein the business information includes: business ID and business name information; querying a preset database business association table according to the business information to obtain target related business information and displaying the information.

[0007] Preferably, after querying the target relationship business information in the preset database business association table based on the business information and displaying it, the method further includes: inputting each business ID and the same user's ID number in the target relationship business information as query conditions into the historical number retrieval data table to retrieve the number retrieval data corresponding to the business ID.

[0008] Preferably, the first user information is entered into a preset historical query data table for querying to obtain query results, including: entering the first user information as a query condition into the preset historical query data table for querying, and confirming whether the first user information exists in the query results.

[0009] Preferably, the query method involves inputting the first user information as a query condition into a preset historical queuing data table, and after confirming the existence of the first user information, the method further includes: if no data corresponding to the first user information is found, then querying a preset database service volume table; wherein, the database service volume table counts the number of times each service in the target location queues within a preset time period, and each service includes: service ID, service name, and number of queuings for the service; each time a queuing occurs, the number of queuings for the service corresponding to the queuing service ID is updated and superimposed, and each service is sorted in descending order of the number of queuings for the service; the sorted service information is then displayed on the queuing interface.

[0010] Preferably, the historical queuing data table stores historical queuing data other than the current day; wherein, the historical queuing data includes: user name, user ID number, user service ID, user service name, user queuing number, user queuing time, user calling time, calling window, and user service completion time.

[0011] Preferably, after querying the historical queuing data table by inputting each business ID and the same user's ID number from the target contact business information as query conditions, and obtaining the queuing data corresponding to the business ID, the method further includes: after each successful queuing by a user on natural day N, inserting the user's name, user's ID number, user's queuing business ID, user's queuing business name, user's queuing number, and user's queuing time into the database business transaction table, at this time the user's calling time, calling window, and user's business completion time fields are empty.

[0012] Preferably, after querying the historical queuing data table by inputting each business ID and the same user's ID number from the target-related business information as query conditions, and obtaining the queuing data corresponding to the business ID, the method further includes: when a service window calls a number, querying the same user's queuing number in the database business transaction log table based on the called number as the first condition, and updating the user's calling time and calling window for this data in the database business transaction log table; or, when a customer completes their business, querying the same user's queuing number in the database business transaction log table based on the called number as the first condition, and updating the user's business completion time for this data in the database business transaction log table; and when the queuing machine is turned on at N+1 on a natural day, inserting all the data in the updated database business transaction log table into the historical queuing data table.

[0013] As a preferred option, data filtering is performed based on the query results, including: filtering out the data in the query results that has a non-empty processing time and the longest processing time.

[0014] Preferably, the business information is queried in a preset database business association table to obtain target related business information and display the information, including: after a preset time has elapsed, the business processing data of the target related business information is statistically analyzed according to preset statistical rules, and the success rate of business processing is statistically analyzed based on the sorted business processing data.

[0015] Preferably, after a preset time period, the business processing data of the target related business information is statistically analyzed according to preset statistical rules, and the success rate of business processing is calculated based on the processed business processing data. This includes: the database business association table stores at least first business information and second business information; wherein, the first business information includes: a first business ID and a first business name, and the second business information includes: a second business ID and a second business name; the first business information and the second business information are related businesses; by querying the first business ID in the database business association table that is not a second business, and then polling the first business IDs found, the first business ID is used as the sole query condition to query all related businesses in the database business association table; when a related business is found, the business IDs of the related businesses and the same user ID number are used as query conditions to query the number retrieval data corresponding to the business ID in the historical number retrieval data table.

[0016] Preferably, the preset statistical rules include: when there are three related business information entries (first business information, second business information, and third business information), if only data for the first business information and second business information with the same ID number are found, it means the customer has not yet processed the third business information, and the processing record is considered incomplete and treated as a failed business processing record; or, when there are three related business information entries (first business information, second business information, and third business information), if two entries for the first business information, one entry for the second business information, and one entry for the third business information are found, it means the user has failed to successfully process at least one related business; when performing statistics, the time for obtaining a number for the related business should be less than the time for obtaining a number for the second business.

[0017] To achieve the above objectives, according to another aspect of this application, a queuing machine management system for automatically recommending number-taking services is provided.

[0018] The queuing management system for automatic recommendation of queuing numbers according to this application includes: an acquisition module for acquiring first user information, wherein the first user information includes: the ID card information of the first user; a first query module for inputting the first user information into a preset historical queuing data table for querying and obtaining query results; a filtering module for filtering data based on the query results and extracting corresponding business information from the filtering results; wherein the business information includes: business ID and business name information; and a second query module for querying a preset database business association table based on the business information to obtain target related business information and display the information.

[0019] Beneficial Effects: In this embodiment, an automatic recommendation method for queuing services is adopted. This involves obtaining first user information, including the user's ID card information; inputting the first user information into a preset historical queuing data table for querying, obtaining query results; filtering the data based on the query results, and extracting relevant business information from the filtered results; the business information including business ID and business name information; querying a preset database business association table based on the business information to obtain target related business information and displaying it. This achieves the goal of automatically recommending related businesses, thereby reducing the time customers spend queuing and improving the technical effect of queuing difficulties. Furthermore, it solves the technical problem that existing technologies cannot be used effectively in locations where businesses are related, and therefore, when customers return to the branch to handle related / continuous business scenarios, they still need to spend a considerable amount of time searching for the required business. Attached Figure Description

[0020] Figure 1 This is a flowchart illustrating the queuing machine management method for the automatic recommendation and number-taking service according to an embodiment of this application. Figure 2 This is a flowchart illustrating a queuing machine management method for an automatic number recommendation service according to a preferred embodiment of this application. Figure 3 This is a schematic diagram of the queuing machine management system for the automatic recommendation and number-taking service according to an embodiment of this application; Figure 4 This is a schematic diagram of the structure of a queuing machine management system for a preferred automatic recommendation and number-taking service according to an embodiment of this application; and Figure 5 This is a schematic diagram of the structure of an electronic device for a queuing machine management method for an automatic recommendation number-taking service according to an embodiment of this application. Detailed Implementation

[0021] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort should fall within the scope of protection of the present application.

[0022] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate for the embodiments of this application described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0023] Furthermore, the terms "installation," "setup," "equipped with," "connection," "linking," and "socketing" should be interpreted broadly. For example, they can refer to a fixed connection, a detachable connection, or an integral structure; they can refer to a mechanical connection or an electrical connection; they can refer to a direct connection or an indirect connection through an intermediate medium, or an internal connection between two devices, components, or parts. Those skilled in the art can understand the specific meaning of these terms in this invention based on the specific circumstances.

[0024] It should be noted that, unless otherwise specified, the embodiments and features described in this application can be combined with each other. This application will now be described in detail with reference to the accompanying drawings and embodiments.

[0025] like Figure 1-2 As shown in the embodiment of the present invention, a queuing machine management method for automatically recommending number-taking services is provided, the method comprising the following steps S101 to S104: Step S101: Obtain first user information; wherein, the first user information includes: the ID card information of the first user; By collecting and acquiring primary user information, accurate information gathering can be ensured, thus providing a guarantee and foundation for subsequent business recommendations. Furthermore, using the primary user's ID information as the most important user information ensures accurate data collection, avoiding duplicate user information and preventing any impact on the accuracy of subsequent information matching.

[0026] Of course, there are no restrictions on the number of users or the demographics of those using the service; it can be anyone who needs to conduct related business.

[0027] It is important to know that before collecting and obtaining the first user information, the queuing machine needs to be kept on every day. The queuing interface displays a screensaver page, which can be a queuing prompt page or an image promotion page. The queuing interface does not directly display the business information page. When customers take a number at the queuing machine, they first need to swipe their ID card to enter the business information display page, where they can select a business to take a number. Customers access the business information display page by swiping their ID cards on the queuing machine's hardware module.

[0028] Step S102: Input the first user information into a preset historical number retrieval data table for querying and obtain the query results; By querying and matching the first user information with the data in the preset historical queuing data table, the historical queuing records of the first user information can be obtained, thereby providing a query condition for subsequent rapid recommendation services.

[0029] According to an embodiment of the present invention, preferably, the first user information is entered into a preset historical query data table for querying, and the query results are obtained, including: The first user information is entered as a query condition into a preset historical number retrieval data table for querying, and the query results are used to confirm whether the first user information exists.

[0030] By querying and confirming the first user's information, the corresponding query results can be obtained. Based on these results, different steps can be recommended and performed, thereby improving efficiency.

[0031] According to an embodiment of the present invention, preferably, after inputting the first user information as a query condition into a preset historical number retrieval data table for querying, and confirming whether the first user information exists in the query results, the method further includes: If no data corresponding to the first user information is found, a preset database service volume table is queried; wherein, the database service volume table counts the number of times each service in the target location takes a number within a preset time period, and the service includes: service ID, service name, and number of service numbers taken; Each time a number is obtained, the number of numbers obtained for the corresponding number-obtaining service ID will be updated, and the services will be sorted in descending order of the number of numbers obtained. The arranged business information is displayed on the number retrieval interface.

[0032] According to an embodiment of the present invention, preferably, the historical queuing data table stores historical queuing data other than the current day; wherein, the historical queuing data includes: user name, user ID number, user service ID, user service name, user queuing number, user queuing time, user calling time, calling window, and user service completion time.

[0033] It can effectively cover relevant user information and business processes, thus providing a data foundation for accurate business recommendations. At the same time, it also ensures reliable information retrieval in the future.

[0034] Step S103: Based on the query results, perform data filtering and extract corresponding business information from the filtering results; wherein, the business information includes: business ID and business name information; It can achieve good data filtering results, thereby obtaining accurate filtering results, and can extract relevant business information from the filtering results, thus providing a foundation for subsequent data processing.

[0035] According to an embodiment of the present invention, preferably, data filtering based on the query results includes: Filter the query results to find the record with the longest processing time and no empty processing time.

[0036] It can accurately filter out the business information processed by users, and use the filtering results as input conditions for subsequent queries, thereby providing accurate data information for business matching.

[0037] By extracting relevant business information from the filtering results, including business ID and business name, the last business transaction information of the first user can be obtained. Furthermore, this business transaction information can provide precise query conditions for subsequent business relevance recommendations.

[0038] Step S104: Query the preset database business association table according to the business information to obtain the target relationship business information and display the information; By querying and matching business information with a pre-defined database of business association tables, accurate target-related business information can be obtained. This enables precise automatic business association recommendations, reducing user operation time and ultimately improving user experience and effectiveness. Furthermore, displaying the obtained target-related business information on the queuing machine's screen achieves a good human-computer interaction effect.

[0039] Specifically, the queuing machine management system retrieves the second service ID and the second service name; For example, if a user's last transaction was business A, and the next available transaction for business A is configured in the business association table as business B, then the queuing management system will obtain the information for business B; or it can be understood as a real estate center customer signing a contract for the first time and then notarizing it for the second time.

[0040] After selecting a service, users click the service button to obtain a paper ticket and then queue up to wait for their number to be called.

[0041] Of course, the pre-configured database business relationship table can be inserted through the configuration page before the queuing machine is put into service. The configuration page allows users to input and save information such as the first service ID, the first service name, the second service ID, and the second service name. The configuration page allows you to enter multiple pieces of information and save them simultaneously.

[0042] According to an embodiment of the present invention, preferably, querying a preset database business association table based on the business information to obtain target relationship business information and displaying the information includes: After a preset time has elapsed, the business processing data of the target-related business information is statistically analyzed according to preset statistical rules, and the success rate of business processing is calculated based on the processed business processing data.

[0043] By statistically analyzing business processing data according to preset statistical rules after a pre-specified period of time, good data statistics results can be achieved, thereby obtaining accurate business processing data and providing a data foundation for subsequent business planning or adjustments. At the same time, by statistically analyzing the success rate of business processing data after processing, accurate data related to the success rate of business processing can be obtained.

[0044] According to an embodiment of the present invention, preferably, after a preset time has elapsed, the business processing data of the target-related business information is statistically analyzed according to preset statistical rules, and the success rate of business processing is statistically analyzed based on the processed business processing data, including: The database business association table stores at least first business information and second business information; wherein, the first business information includes: a first business ID and a first business name, and the second business information includes: a second business ID and a second business name; Of course, the amount of business information stored in the database business association table can be adjusted according to actual usage needs and is not limited.

[0045] The first business information and the second business information are related businesses; If the second business information is also treated as the first business in the database business association table; For example, if the related business of the first business information A is the second business information B, and the related business of the second business information B is the third business information C, then A, B, and C are called related businesses. By performing related queries on the front-end and back-end of business information, a good automatic recommendation effect can be achieved.

[0046] By querying the first business ID that is not a second business in the database business association table, and then polling the first business IDs found, the first business ID is used as the sole query condition to query all related businesses in the database business association table. For example, if business A exists only as the first business in the business relationship table, then we query for the second business corresponding to business A. If the second business corresponding to A is B, then we query whether B is listed as the first business, and so on. This ensures complete and accurate relationship query results, thus avoiding omissions in the query.

[0047] Once the related services are identified, the service IDs of each related service and the same user's ID number are used as query conditions to retrieve the retrieval data corresponding to that service ID from the historical retrieval data table.

[0048] According to an embodiment of the present invention, preferably, the preset statistical rules include: If there are three related business records (first, second, and third), and only data for the first and second business records for the same ID number is found, it means the customer has not yet processed the third business transaction. Therefore, this transaction record is considered incomplete and treated as a failed transaction. Or... If there are three related business information entries: first business information, second business information, and third business information, and a query returns two entries for the first business information, one entry for the second business information, and one entry for the third business information, it means that the user has at least one related business transaction that was not successfully processed; or, When conducting statistics, the time for obtaining a number for a related transaction should be shorter than the time for obtaining a number for the second transaction.

[0049] For example, if the query data A1, A2, B, C is above, and the time when B and C obtained their numbers was before A2, then A1, B, and C are considered to be complete business processing records.

[0050] This invention can solve the problem of automatically displaying and recommending services that the customer may need to select next when a repeat customer goes to a service location to get a number, based on the information of the customer's previous business recorded in the queuing machine management system and the business processing association logic pre-set in the actual location.

[0051] Specifically, in locations with high foot traffic and a wide variety of services, repeat customers (those not visiting the branch for the first time) still need to spend a considerable amount of time checking their services and obtaining a number. To address this issue, the queuing system management system queries the customer's historical service information and, based on pre-defined relationships between different services, lists and recommends the services the customer needs to handle, thereby reducing the time spent obtaining a number and alleviating the difficulty of obtaining a number in such locations. Furthermore, after a period of data accumulation, the queuing system management system can statistically analyze the completeness of each customer's service transactions, allowing the service provider to make timely adjustments to its services.

[0052] As can be seen from the above description, this application achieves the following technical effects: In this embodiment, an automatic recommendation method for obtaining queuing numbers is adopted. This involves obtaining first user information, including the user's ID card information; inputting the first user information into a preset historical queuing data table for querying, obtaining query results; filtering the data based on the query results, and extracting relevant business information from the filtered results; the business information including business ID and business name information; querying a preset database business association table based on the business information to obtain target related business information and displaying it. This achieves the goal of automatically recommending related businesses, thereby reducing the time customers spend obtaining queuing numbers and improving the technical effect of alleviating the difficulty of obtaining queuing numbers. Furthermore, it solves the technical problem that existing technologies cannot be used in places where businesses are related, and therefore, when customers return to the branch to handle related / continuous business scenarios, they still need to spend a long time searching for the business they need to handle.

[0053] According to an embodiment of the present invention, preferably, after querying a preset database business association table based on the business information to obtain and display the target relationship business information, the method further includes: The target relationship contact information includes various business IDs and the same user's ID number. These are used as query conditions to enter the historical number retrieval data table to obtain the number retrieval data corresponding to the business ID.

[0054] It can achieve a good display of queuing data, thus making it easier for users to quickly obtain queuing numbers.

[0055] According to an embodiment of the present invention, preferably, after querying the historical digit retrieval data table by inputting each business ID and the same user's ID number from the target relationship business information as query conditions, and obtaining the digit retrieval data corresponding to the business ID, the method further includes: After each successful queuing by a user on natural day N, the user's name, ID number, service ID, service name, queuing number, and queuing time are inserted into the database business transaction table. At this time, the user's call time, call window, and service completion time fields are empty.

[0056] It can insert and save real-time data into the database business flow table, and set the user call time, call window, and user business completion time fields to empty, thus achieving good data collection results.

[0057] According to an embodiment of the present invention, preferably, after querying the historical digit retrieval data table by inputting each business ID and the same user's ID number from the target relationship business information as query conditions, and obtaining the digit retrieval data corresponding to the business ID, the method further includes: When a number is called at the service window, the system queries the database's business transaction log table for the same user's number based on the called number as the first condition, and then updates the user's calling time and calling window for this entry in the database's business transaction log table; or, When a customer completes their transaction, the system queries the database transaction log table for the same user's queried number based on the queried number as the first condition, and updates the transaction completion time of this user's transaction log table. When the queuing machine is activated at time N+1 on a natural day, all data in the updated database business transaction table will be inserted into the historical queuing data table.

[0058] By updating and saving real-time business information data to a database business flow table, it is ensured that the data in the database business flow table is accurate and reflects the most recent operation status. Simultaneously, inserting all data from the updated database business flow table into the historical queuing data table ensures that the data in the historical queuing data table is updated in real-time, thereby ensuring data accuracy. Furthermore, by using the database business flow table for real-time data collection and updating instead of directly processing and updating the historical queuing data table, good data differentiation can be achieved. This also avoids the possibility of the historical queuing data table crashing due to excessive data volume, which could disrupt the normal operation of the queuing management system.

[0059] The present invention also has the following beneficial effects: 1. Based on the display method of recommended related services, shorten the time spent by repeat customers when taking a number, improve the problem of customers having difficulty taking a number, reduce the cost of manual guidance at service locations, and optimize the waiting environment at service locations; 2. After a period of time, the queuing machine management system can statistically analyze the processing status of related services and the success rate of related services. Service venues can then use the statistical data to improve the service process and increase the efficiency of service venues.

[0060] To achieve the above objectives, according to another aspect of this application, a queuing machine management system for automatically recommending ticket collection services is provided. For example... Figure 3-4 As shown, the queuing management system for the automatic number recommendation service includes: The acquisition module 401 is used to acquire first user information; wherein, the first user information includes: the ID card information of the first user; By collecting and acquiring primary user information, accurate information gathering can be ensured, thus providing a guarantee and foundation for subsequent business recommendations. Furthermore, using the primary user's ID information as the most important user information ensures accurate data collection, avoiding duplicate user information and preventing any impact on the accuracy of subsequent information matching.

[0061] The first query module 402 is used to input the first user information into a preset historical number retrieval data table for querying and to obtain the query result. By querying and matching the first user information with the data in the preset historical queuing data table, the historical queuing records of the first user information can be obtained, thereby providing a query condition for subsequent rapid recommendation services.

[0062] The filtering module 403 is used to filter data based on the query results and extract corresponding business information from the filtering results; wherein, the business information includes: business ID and business name information; It can achieve good data filtering results, thereby obtaining accurate filtering results, and can extract relevant business information from the filtering results, thus providing a foundation for subsequent data processing.

[0063] The second query module 404 is used to query the preset database business association table based on the business information, obtain the target relationship business information, and display the information.

[0064] By querying and matching business information with a pre-defined database of business association tables, accurate target-related business information can be obtained. This enables precise automatic business association recommendations, reducing user operation time and ultimately improving user experience and effectiveness. Furthermore, displaying the obtained target-related business information on the queuing machine's screen achieves a good human-computer interaction effect.

[0065] According to an embodiment of the present invention, preferably, the queuing machine management system for automatically recommending number retrieval services further includes: a queuing machine display module, an ID card reading module, a database module, a service configuration association module, and a queuing machine management module. The queuing machine management module is electrically connected to the queuing machine display module, the ID card reading module, the database module, and the service configuration association module, respectively, which can achieve good control effect.

[0066] The queuing machine display module can display relevant data and provide touch interaction, including but not limited to: number display and service type indicator lights, thereby achieving a good human-computer interaction effect.

[0067] The ID card reading module can read the user's information, thus achieving real-time data collection.

[0068] The database module enables excellent data storage, data retrieval, and data update capabilities.

[0069] The business configuration association module can achieve good business association results, thus providing a guarantee for automatic recommendation.

[0070] The queuing machine management module can achieve good control, thereby ensuring that multiple modules work together to achieve the required functional effects.

[0071] As can be seen from the above description, this application achieves the following technical effects: In this embodiment, an automatic recommendation method for obtaining queuing numbers is adopted. This involves obtaining first user information, including the user's ID card information; inputting the first user information into a preset historical queuing data table for querying, obtaining query results; filtering the data based on the query results, and extracting relevant business information from the filtered results; the business information including business ID and business name information; querying a preset database business association table based on the business information to obtain target related business information and displaying it. This achieves the goal of automatically recommending related businesses, thereby reducing the time customers spend obtaining queuing numbers and improving the technical effect of alleviating the difficulty of obtaining queuing numbers. Furthermore, it solves the technical problem that existing technologies cannot be used in places where businesses are related, and therefore, when customers return to the branch to handle related / continuous business scenarios, they still need to spend a long time searching for the business they need to handle.

[0072] like Figure 5As shown, the electronic device 10 includes at least one processor 11 and a memory, such as a read-only memory (ROM) 12 or a random access memory (RAM) 13, communicatively connected to the at least one processor 11. The memory stores computer programs executable by the at least one processor. The processor 11 can perform various appropriate actions and processes based on the computer program stored in the ROM 12 or loaded into the RAM 13 from storage unit 18. The RAM 13 can also store various programs and data required for the operation of the electronic device 10. The processor 11, ROM 12, and RAM 13 are interconnected via a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0073] Multiple components in electronic device 10 are connected to I / O interface 15, including: input unit 16, such as keyboard, mouse, etc.; output unit 17, such as various types of displays, speakers, etc.; storage unit 18, such as disk, optical disk, etc.; and communication unit 19, such as network card, modem, wireless transceiver, etc. Communication unit 19 allows electronic device 10 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0074] Processor 11 can be a variety of general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. Processor 11 performs the various methods and processes described above, such as a queuing machine management method for automatically recommending ticket numbers.

[0075] In some embodiments, the queuing machine management method for automatically recommending queuing numbers can be implemented as a computer program tangibly contained in a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program can be loaded and / or installed on electronic device 10 via ROM 12 and / or communication unit 19. When the computer program is loaded into RAM 13 and executed by processor 11, one or more steps of the queuing machine management method for automatically recommending queuing numbers described above can be performed. Alternatively, in other embodiments, processor 11 can be configured to perform the queuing machine management method for automatically recommending queuing numbers by any other suitable means (e.g., by means of firmware).

[0076] Various embodiments of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), systems-on-a-chip (SoCs), payload-programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.

[0077] Computer programs used to implement the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, such that when executed by the processor, the computer programs cause the functions / operations specified in the flowcharts and / or block diagrams to be performed. The computer programs may be executed entirely on a machine, partially on a machine, or as a standalone software package, partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0078] In the context of this invention, a computer-readable storage medium can be a tangible medium that may contain or store a computer program for use by or in conjunction with an instruction execution system, apparatus, or device. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination thereof. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0079] To provide interaction with a user, the systems and techniques described herein can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the electronic device. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).

[0080] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as data servers), or middleware components (e.g., application servers), or frontend components (e.g., user computers with graphical user interfaces or web browsers through which users can interact with implementations of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., communication networks). Examples of communication networks include local area networks (LA), wide area networks (WA), blockchain networks, and the Internet.

[0081] A computing system can include clients and servers. Clients and servers are generally located far apart and typically interact through communication networks. The client-server relationship is created by computer programs running on the respective computers and having a client-server relationship with each other. The server can be a cloud server, also known as a cloud computing server or cloud host, which is a hosting product within the cloud computing service system to address the shortcomings of traditional physical hosts and VPS services, such as high management difficulty and weak business scalability.

[0082] It should be understood that the various forms of processes shown above can be used, with steps reordered, added, or deleted. For example, the steps described in this invention can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution of this invention can be achieved, and this is not limited herein.

[0083] The specific embodiments described above do not constitute a limitation on the scope of protection of this invention. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this invention should be included within the scope of protection of this invention.

Claims

1. A queuing machine management method for automatically recommending number-taking services, characterized in that, include: Obtain first user information; wherein, the first user information includes the first user's ID card information; input the first user information into a preset historical queuing data table for querying, and obtain query results; wherein, the historical queuing data table stores historical queuing data other than the current day, and the historical queuing data includes user name, user ID card number, user service ID, user service name, user queuing number, user queuing time, user calling time, calling window, and user service completion time; perform data filtering based on the query results, and extract corresponding service information from the filtered results; wherein, the service information includes service ID and service name information; the base Data filtering of the query results includes: filtering out the record with the longest processing time and non-empty processing time from the query results; querying the business association table in the preset database based on the business information to obtain the target related business information and displaying the information; after each successful queuing by a user on natural day N, inserting the user's name, user's ID number, user's obtained business ID, user's obtained business name, user's queuing number, and user's queuing time into the database business transaction table, at which time the user's call time, call window, and user's business completion time fields are empty; when the service window calls a number, querying the database business transaction table based on the called number as the first condition. The system records the same user's queuing number and updates the corresponding user call time and call window. When a user completes their transaction, it queries the same user's queuing number in the database's transaction log table based on the called number as the first condition and updates the corresponding user transaction completion time. When the queuing machine is activated on natural day N+1, all data in the updated database's transaction log table is inserted into the historical queuing data table. After a preset time, the system statistically analyzes the transaction data of the target related business information according to preset statistical rules and calculates the success rate of the processed transaction data. The database's business association table stores at least the first business information... The system retrieves information and second business information. The first business information includes a first business ID and a first business name, and the second business information includes a second business ID and a second business name. The first business information and the second business information are related businesses. The system queries the business association table in the database for first business IDs that are not listed as second businesses, and then polls the retrieved first business IDs in turn. The first business ID is used as the sole query condition to query all related businesses in the business association table in the database. After retrieving related businesses, the system uses the business IDs of each related business and the same user's ID number as query conditions to retrieve the retrieval data corresponding to that business ID in the historical retrieval data table.The preset statistical rules include: when there are three related business transactions (first business information, second business information, and third business information), if only data for the first business information and second business information with the same ID number are found, the transaction record is determined to be incomplete and considered a failed transaction; or, if two records of the first business information, one record of the second business information, and one record of the third business information are found, it is determined that the user has at least one unsuccessful related business transaction; furthermore, during the statistical analysis, the time taken to obtain a number for the related business transaction is shorter than the time taken to obtain a number for the second business transaction.

2. The queuing machine management method for automatic recommendation of queuing numbers according to claim 1, characterized in that, After querying the target relationship business information in the preset database business association table based on the business information and displaying it, the process further includes: inputting each business ID and the same user's ID number in the target relationship business information into the historical number retrieval data table as query conditions to obtain the number retrieval data corresponding to the business ID.

3. The queuing machine management method for automatic recommendation of queuing numbers according to claim 1, characterized in that, The process of inputting the first user information into a preset historical query data table and obtaining the query result includes: inputting the first user information as a query condition into the preset historical query data table and confirming whether the first user information exists in the query result.

4. The queuing machine management method for automatic recommendation and number dispensing services according to claim 3, characterized in that, After confirming whether the query result contains the first user information, the method further includes: when no data corresponding to the first user information is found, querying a preset database business volume table; wherein, the database business volume table counts the number of times each business takes a number at the target location within a preset time period, and the business includes a business ID, a business name, and a number of numbers taken for the business; each time a number is taken, the number of numbers taken for the business with the corresponding business ID is updated and superimposed, the businesses are sorted in descending order according to the number of numbers taken for the business, and the sorted business information is displayed on the number taking interface.

5. A queuing machine management system for automatically recommending number-taking services, characterized in that: include: The system includes an acquisition module for acquiring first user information, including the user's ID card information; a first query module for inputting the first user information into a preset historical queuing data table for querying and obtaining query results; a filtering module for filtering data based on the query results and extracting relevant business information from the filtered results, including business ID and business name information; a second query module for querying a preset database business association table based on the business information to obtain target related business information and displaying the information; the system also includes a queuing machine display module, an ID card reading module, a database module, and a business configuration association module. The system includes a queuing machine management module, which is electrically connected to the queuing machine display module, ID card reading module, database module, and business configuration association module. The database module stores the historical queuing data table, the database business transaction table, and the database business association table. The historical queuing data table stores historical queuing data excluding the current day. The filtering module filters the query results to select the record with the longest processing time and a non-empty processing time. The queuing machine management module inserts queuing data into the database business transaction table after each successful queuing on natural day N, and sets the fields for user call time, call window, and user business completion time to empty. The system updates the corresponding data—user call time, call window, and user service completion time—when the queuing machine is activated at the window and when the user completes their service. Additionally, when the queuing machine is activated on day N+1, all data from the updated database service flow table is inserted into the historical queuing data table. The service configuration association module stores the association between first and second service information. The queuing machine management module also queries the first service ID in the database service association table that is not a second service, polls the found first service IDs, and uses the first service ID as the sole query condition to query all associated services, using the service ID of each associated service and the same user ID number as the query criteria. The system queries the historical queuing data table based on certain conditions and calculates the success rate of business processing according to preset statistical rules. These preset statistical rules include: if there are three related business transactions (first, second, and third), and only the data for the first and second business transactions with the same ID number is found, the transaction record is considered incomplete and treated as a failed transaction; or, if two records of the first business transaction, one record of the second business transaction, and one record of the third business transaction are found, it is determined that the user has at least one unsuccessful related business transaction. Furthermore, during the statistical analysis, the queuing time for the related business transaction is shorter than the queuing time for the second business transaction.

Citation Information

Patent Citations

  • Queuing machine management system and method for automatically arranging number-taking service order

    CN109300218A

  • Service recommendation method, device, server and storage medium

    CN109064268A

  • Information recommendation method, device and equipment and storage medium

    CN112328873A