CN110232459B - Service reservation system based on cloud computing - Google Patents
Service reservation system based on cloud computing Download PDFInfo
- Publication number
- CN110232459B CN110232459B CN201910556456.9A CN201910556456A CN110232459B CN 110232459 B CN110232459 B CN 110232459B CN 201910556456 A CN201910556456 A CN 201910556456A CN 110232459 B CN110232459 B CN 110232459B
- Authority
- CN
- China
- Prior art keywords
- time
- service
- reservation
- unit
- queuing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000002360 preparation method Methods 0.000 claims description 36
- 230000003993 interaction Effects 0.000 claims description 24
- 238000000034 method Methods 0.000 claims description 13
- 238000004458 analytical method Methods 0.000 claims description 12
- 230000001360 synchronised effect Effects 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 3
- 238000012544 monitoring process Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000007792 addition Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/02—Reservations, e.g. for tickets, services or events
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
- G07C2011/04—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere related to queuing systems
Landscapes
- Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Theoretical Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a service reservation system based on cloud computing, which comprises a plurality of user sides and a reservation subsystem; the user side comprises a reservation entry unit, a map unit, a time estimation unit, a signal unit, an inertia following unit, a cloud processor and a display unit; the invention can analyze the arrival time and the reservation information of the user by means of the reservation subsystem, the reservation subsystem is mutually communicated with the queuing system of the corresponding service center to obtain a series of related data which can influence queuing, and finally, the number which needs to wait for the shortest time can be obtained for the user according to the related data and the arrival time and by combining with corresponding rules, and the number passing condition can not be generated; the invention is simple, effective and easy to use.
Description
Technical Field
The invention belongs to the field of service reservation, relates to a cloud computing technology, and particularly relates to a service reservation system based on cloud computing.
Background
For some current government affair related service systems, a common mode is to queue in a field number taking mode, or a small part of the service systems can realize online appointment registration, but the current appointment registration is to determine the position of a user to be arranged according to appointment time or registration time to perform service basically;
the system is not an effective system which can prejudge the arrival time of the user and can flexibly queue according to the arrival time, the user does not queue according to the reserved time and the registration time singly, the queuing time is convenient for the user to reduce, the situation of number passing does not occur, and the situation that the number arrives because people do not arrive does not occur, so that the period of time for confirming that the user is absent is prolonged, although the time of each number is not long, the accumulated time is not small, and the technical problem is solved more comprehensively.
Disclosure of Invention
The invention aims to provide a method for automatically obtaining the time for reaching a user destination service center according to the time, which is obtained by analyzing how long the user will go out after sending reservation information by means of the inertial data of the user; finally, flexible queuing is carried out according to the arrival time, and the problem that the current user waits for a long time or passes the number when calling the number for reservation service is solved; the invention provides a service reservation system based on cloud computing.
The technical problem to be solved by the invention is as follows:
(1) How to prejudge the actual time of the user after initiating the reservation signal and obtain the time of the user reaching the required service destination according to the actual time of the user going out;
(2) According to the arrival time, the service required by the online reasonable reservation of the service calling number of the user is automatically carried out.
The purpose of the invention can be realized by the following technical scheme:
the service reservation system based on the cloud computing comprises a plurality of user terminals and a reservation subsystem;
the user side comprises a reservation entry unit, a map unit, a time estimation unit, a signal unit, an inertia following unit, a cloud processor and a display unit;
the reservation subsystem comprises a data interaction unit, a processor, a reservation library and a service synchronization unit;
the reservation input unit is used for inputting reservation information by a user, the reservation information comprises a reservation signal and reservation content, and the reservation content is a service to be transacted; the reservation recording unit is used for transmitting the reservation signal and the position information to the time estimation unit; the reservation recording unit is used for transmitting a reservation signal to the inertia following unit;
the signal unit is used for inputting a starting signal by a user when the user starts, the signal unit is used for transmitting the starting signal to the inertia following unit, and the inertia following unit is used for carrying out inertia analysis on the starting signal and the reservation signal to obtain a starting signal and inertia time Tg;
the inertia following unit is used for transmitting a starting signal and inertia time Tg to the time pre-estimating unit;
the time estimation unit is used for estimating the travel of the reservation information, the position information and the inertia time Tg by combining a map library to obtain the arrival time Dt when the starting signal is received;
the time pre-estimating unit is used for transmitting reservation information and arrival time to the cloud processor; the cloud processor is used for transmitting the reservation information and the arrival time to the data interaction unit of the reservation subsystem, and the data interaction unit is used for transmitting the reservation information and the arrival time to the processor;
the service synchronization unit is synchronized with a queuing system of a corresponding service center, the service synchronization unit also stores the service efficiency of the service center, and the service efficiency comprises single data Dg and service window data Fc;
the reservation library is synchronous with a queuing system of the service center, and automatically acquires the current queuing number of the service center in real time, wherein the queuing number is the number of people waiting for service currently; and updating in real time;
when the processor receives a reservation signal in reservation information transmitted by the data interaction unit, the processor automatically combines the service synchronization unit and the reservation library to call the arrival time, and the specific processing steps are as follows:
s100: acquiring arrival time; marking the arrival time as Dd;
s200: acquiring the current number of real-time service windows, and marking the number as Fs; simultaneously, automatically acquiring the current queuing number, and marking the current queuing number as Pd;
s300: acquiring single data Dg and the number Fc of service windows;
s400: calculating the service time Q to the number according to Fs, pd, dg and Fc,
the specific calculation formula is as follows:
in the formula, X4<1, and is a preset value;
s500: automatically obtaining the current time, and adding Q to the current time to obtain a service point time Qf;
s600: obtaining a difference value Ct between the service point arrival time Qf and the arrival time Dd, wherein the unit of the difference value is minutes; when Ct is larger than zero, the service point time Qf is shown to be earlier than the arrival time Dd by Ct minutes, and when Ct is smaller than zero, the service point time Qf is shown to be later than the arrival time Dd by Ct minutes;
s601: when Ct is less than or equal to X5, X5 is a preset value; automatically reserving the next queuing number of the latest queuing number and marking the queuing number as a service number; acquiring the service point time Qf at the moment; the latest queuing number is the number called at the last time;
s602: when Ct is greater than X5, performing the following number-taking following steps of S603-S605;
s603: acquiring real-time Ts, and automatically acquiring residual time St between the real-time Ts and arrival time Dd;
s604: when St is more than X6, the real-time Ts at the moment is still St time from the user to the service center; x6 is a preset value; the number of the corresponding number is obtained by the formula,
monitoring the latest queuing number in real time, reserving the number to be taken when the next number of the latest queuing number is the number to be taken, and otherwise, not performing any action;
s605: and when St is less than or equal to X6, the user is shown to reach the service center, and the next number of the latest queuing number is acquired and marked as the service number.
Further, the specific analysis steps of the inertial analysis are as follows:
the method comprises the following steps: acquiring the time of receiving a reservation signal and the time of receiving a starting signal;
step two: automatically acquiring a time interval for receiving a starting signal after a reservation signal is sent, marking the time interval as preparation time, and marking the obtained preparation time as one-time preparation time;
step three: storing the preparation time obtained each time in an inertia following unit to form a preparation time group Zi, i =1.. N;
step four: when the number of the preparation time in the preparation time group is more than or equal to a preset value X1, generating a starting signal and automatically acquiring standard time; the acquisition steps are as follows:
s1: acquiring a preparation time group Zi;
s2: acquiring X2 preparation times according to a time sequence from near to far, and marking the corresponding preparation times as standard times; wherein X2 is not more than X1;
s3: calculating to obtain an average value of the standard time, and marking the average value as inertia time Tg;
step five: when the number of the preparation time in the preparation time group is smaller than a preset value X1, a start signal is generated when the start signal is received, and the inertia time Tg is zero at the moment.
Further, the specific steps of the travel estimation are as follows:
the method comprises the following steps: acquiring reservation information, position information, a starting signal and inertia time Tg;
step two: acquiring reservation content in the reservation information, locking a service center according to the reservation content, and automatically acquiring the position of the service center;
step three: according to the position information and the position of the service center, the map library is utilized to obtain the shortest time and the longest time required for reaching the position of the service center from the position information, and the time can be obtained by means of current navigation software;
step four: automatically calculating to obtain the average value of the shortest time and the longest time, and marking the average value as the journey time;
step five: adding the path time and the inertia time Tg to obtain time consumption;
step six: the generation time of the starting signal is automatically acquired, and the time is added with the consumed time to obtain the arrival time Dt.
Further, the service efficiency obtaining method comprises the following steps:
and (4) SS1: acquiring recent queuing data, wherein the queuing data is the time spent from the beginning of the last number to the next number; the recent specific concept is that from the latest queuing data, X3 queuing data are pushed forward, and X3 is a preset value;
and (4) SS2: acquiring a mean value of queuing data, and marking the mean value as single data Dg;
and (4) SS3: the number of service windows owned by the service center is obtained and marked as Fc.
Further, the processor obtains the service number of the user through number calling processing and returns the service number to the data interaction unit, and the data interaction unit receives the service number transmitted by the processor;
the data interaction unit is used for returning the service number to the cloud processor, the cloud processor receives the service number transmitted by the data interaction unit and transmits the service number to the display unit, and the display unit receives the service number transmitted by the cloud processor and automatically displays the service number.
The invention has the beneficial effects that:
(1) According to the method, a signal unit is used for inputting a starting signal when a user starts, then an inertia following unit is used for carrying out inertia analysis on the starting signal and a reservation signal, inertia time Tg and a corresponding starting signal are obtained by means of an inertia analysis step, the inertia time is used for measuring the starting time period of the user after the user sends the reservation signal, the inertia time is obtained according to usual habit data of the user, and other values are automatically generated when a usual habit data sample of the user is insufficient; then, calculating by utilizing a time pre-estimating unit and inertia time and a related algorithm to obtain the arrival time Dt of the user to the target service center;
(2) Meanwhile, the invention can analyze the arrival time and the reservation information of the user by means of the reservation subsystem, the reservation subsystem is mutually communicated with the queuing system of the corresponding service center to obtain a series of related data which can influence the queuing, and finally, the number which needs to wait for the shortest time can be obtained for the user according to the related data and the arrival time and by combining with the corresponding rule, and the number passing condition can not be generated; the invention is simple, effective and easy to use.
Drawings
To facilitate understanding for those skilled in the art, the present invention will be further described with reference to the accompanying drawings.
FIG. 1 is a block diagram of the system of the present invention;
fig. 2 is a system block diagram of the user side and the reservation subsystem according to the present invention.
Detailed Description
As shown in fig. 1-2, the service reservation system based on cloud computing includes a plurality of clients and a reservation subsystem;
the user side comprises a reservation entry unit, a map unit, a time estimation unit, a signal unit, an inertia following unit, a cloud processor and a display unit;
the reservation subsystem comprises a data interaction unit, a processor, a reservation library and a service synchronization unit;
the reservation input unit is used for inputting reservation information by a user, the reservation information comprises a reservation signal and reservation content, and the reservation content is a service to be transacted; the reservation recording unit is used for transmitting the reservation signal and the position information to the time estimation unit; the reservation recording unit is used for transmitting a reservation signal to the inertia following unit;
the signal unit is used for inputting a starting signal by a user when the user starts, the signal unit is used for transmitting the starting signal to the inertia following unit, the inertia following unit is used for carrying out inertia analysis on the starting signal and a reservation signal, and the specific analysis steps are as follows:
the method comprises the following steps: acquiring the time of receiving a reservation signal and the time of receiving a starting signal;
step two: automatically acquiring a time interval for receiving a starting signal after a reservation signal is sent, marking the time interval as preparation time, and marking the obtained preparation time as one-time preparation time;
step three: storing the preparation time obtained each time in an inertia following unit to form a preparation time group Zi, i =1.. N;
step four: when the number of the preparation time in the preparation time group is larger than or equal to a preset value X1, generating a starting signal and automatically acquiring standard time; the acquisition steps are as follows:
s1: acquiring a preparation time group Zi;
s2: acquiring X2 preparation times according to a time sequence from near to far, and marking the corresponding preparation times as standard times; wherein X2 is not more than X1;
s3: calculating to obtain an average value of the standard time, and marking the average value as inertia time Tg;
step five: when the number of the preparation time in the preparation time group is smaller than a preset value X1, a starting signal is generated when a starting signal is received, and the inertia time Tg is zero at the moment;
the inertia following unit is used for transmitting a starting signal and inertia time Tg to the time pre-estimating unit;
the time estimation unit is used for estimating the travel of the reservation information, the position information and the inertia time Tg by combining a map library when a start signal is received, and the travel estimation comprises the following specific steps:
the method comprises the following steps: acquiring reservation information, position information, a start signal and inertia time Tg;
step two: acquiring reservation content in the reservation information, locking a service center according to the reservation content, and automatically acquiring the position of the service center;
step three: according to the position information and the position of the service center, the map library is utilized to obtain the shortest time and the longest time required for reaching the position of the service center from the position information, and the time can be obtained by means of current navigation software;
step four: automatically calculating to obtain the average value of the shortest time and the longest time, and marking the average value as the journey time;
step five: adding the path time to the inertia time Tg to obtain the consumed time;
step six: automatically acquiring the generation time of a starting signal, and adding time consumption to the generation time to obtain arrival time Dt;
the time pre-estimating unit is used for transmitting the reservation information and the arrival time to the cloud processor; the cloud processor is used for transmitting the reservation information and the arrival time to a data interaction unit of the reservation subsystem, and the data interaction unit is used for transmitting the reservation information and the arrival time to the processor;
the service synchronization unit is synchronized with a queuing system corresponding to the service center, the service synchronization unit also stores the service efficiency of the service center, and the service efficiency obtaining method comprises the following steps:
SS1: acquiring recent queuing data, wherein the queuing data is the time spent from the beginning of the last number to the next number; the recent specific concept is that from the latest queuing data, X3 queuing data are pushed forward, and X3 is a preset value;
and SS2: acquiring a mean value of queuing data, and marking the mean value as single data Dg;
and (4) SS3: acquiring the number of service windows owned by the service center, and marking the number as Fc;
the reservation library is synchronous with a queuing system of the service center, and automatically acquires the current queuing number of the service center in real time, wherein the queuing number is the number of people waiting for service currently; and updating in real time;
when the processor receives a reservation signal in reservation information transmitted by the data interaction unit, the processor automatically combines the service synchronization unit and the reservation library to call the number of the arrival time, and the specific processing steps are as follows:
s100: acquiring arrival time; marking the arrival time as Dd;
s200: acquiring the current number of real-time service windows, and marking the number as Fs; simultaneously, automatically acquiring the current queuing number, and marking the current queuing number as Pd;
s300: acquiring single data Dg and the number Fc of service windows;
s400: calculating the service arrival time Q according to Fs, pd, dg and Fc,
the specific calculation formula is as follows:
in the formula, X4<1, and is a preset value;
s500: automatically obtaining the current time, and adding Q to the current time to obtain a service point time Qf;
s600: calculating the difference Ct between the service point time Qf and the arrival time Dd, wherein the unit of the difference is minutes; when Ct is larger than zero, the service point time Qf is shown to be earlier than the arrival time Dd by Ct minutes, and when Ct is smaller than zero, the service point time Qf is shown to be later than the arrival time Dd by Ct minutes;
s601: when Ct is less than or equal to X5, X5 is a preset value; automatically reserving the next queuing number of the latest queuing number and marking the queuing number as a service number; acquiring the service point time Qf at the moment; the latest queuing number is the number of the last called number; at this time, the user needs to reserve the latest queuing number to avoid long-time waiting;
s602: when Ct is more than X5, the user can generate a number passing situation to a great extent if reserving the latest queuing number; the following number-taking following steps of S603-S605 are performed;
s603: acquiring real-time Ts, and automatically acquiring residual time St between the real-time Ts and arrival time Dd;
s604: when St is more than X6, the real-time Ts is still St time from the user to the service center, and when St is less than zero, the user arrives at the service center and a certain time elapses; x6 is a preset value; the number of the corresponding number is obtained by the formula,
monitoring the latest queuing number in real time, reserving the number to be taken when the next number of the latest queuing number is the number to be taken, and otherwise, not performing any action;
s605: when St is less than or equal to X6, the user is indicated to reach the service center, and the next number of the latest queuing number is acquired and marked as the service number;
the processor processes the number according to the calling number to obtain the service number of the user and returns the service number to the data interaction unit, and the data interaction unit receives the service number transmitted by the processor;
the data interaction unit is used for returning the service number to the cloud processor, the cloud processor receives the service number transmitted by the data interaction unit and transmits the service number to the display unit, and the display unit receives the service number transmitted by the cloud processor and automatically displays the service number.
According to the method, a signal unit is used for inputting a starting signal when a user starts, then an inertia following unit is used for carrying out inertia analysis on the starting signal and a reservation signal, inertia time Tg and a corresponding starting signal are obtained by means of an inertia analysis step, the inertia time is used for measuring the starting time period of the user after the user sends the reservation signal, the inertia time is obtained according to usual habit data of the user, and other values are automatically generated when a usual habit data sample of the user is insufficient; then, calculating by utilizing a time pre-estimating unit and inertia time and a related algorithm to obtain the arrival time Dt of the user to the target service center;
meanwhile, the invention can analyze the arrival time and the reservation information of the user by means of the reservation subsystem, the reservation subsystem is mutually communicated with the queuing system of the corresponding service center to obtain a series of related data which can influence queuing, and finally, the number which needs to wait for the shortest time can be obtained for the user according to the related data and the arrival time and by combining with corresponding rules, and the number passing condition can not be generated.
The foregoing is merely illustrative and explanatory of the present invention and various modifications, additions or substitutions may be made to the specific embodiments described by those skilled in the art without departing from the scope of the invention as defined in the accompanying claims.
Claims (5)
1. The service reservation system based on the cloud computing is characterized by comprising a plurality of user sides and reservation subsystems;
the user side comprises a reservation entry unit, a map unit, a time estimation unit, a signal unit, an inertia following unit, a cloud processor and a display unit;
the reservation subsystem comprises a data interaction unit, a processor, a reservation library and a service synchronization unit;
the reservation input unit is used for inputting reservation information by a user, the reservation information comprises a reservation signal and reservation content, and the reservation content is a service to be transacted; the reservation recording unit is used for transmitting the reservation signal and the position information to the time estimation unit; the reservation recording unit is used for transmitting a reservation signal to the inertia following unit;
the signal unit is used for inputting a starting signal by a user when the user starts, the signal unit is used for transmitting the starting signal to the inertia following unit, and the inertia following unit is used for carrying out inertia analysis on the starting signal and the reservation signal to obtain a starting signal and inertia time Tg;
the inertia following unit is used for transmitting a starting signal and inertia time Tg to the time estimation unit;
the time estimation unit is used for estimating the travel of the reservation information, the position information and the inertia time Tg by combining a map library to obtain the arrival time Dt when the starting signal is received;
the time pre-estimating unit is used for transmitting the reservation information and the arrival time to the cloud processor; the cloud processor is used for transmitting the reservation information and the arrival time to the data interaction unit of the reservation subsystem, and the data interaction unit is used for transmitting the reservation information and the arrival time to the processor;
the service synchronization unit is synchronized with a queuing system of a corresponding service center, the service synchronization unit also stores the service efficiency of the service center, and the service efficiency comprises single data Dg and service window data Fc;
the reservation library is synchronous with a queuing system of the service center, and automatically acquires the current queuing number of the service center in real time, wherein the queuing number is the number of people waiting for service currently; and updating in real time;
when the processor receives a reservation signal in reservation information transmitted by the data interaction unit, the processor automatically combines the service synchronization unit and the reservation library to call the number of the arrival time, and the specific processing steps are as follows:
s100: acquiring arrival time; marking the arrival time as Dd;
s200: acquiring the current number of real-time service windows, and marking the number as Fs; simultaneously, automatically acquiring the current queuing number, and marking the current queuing number as Pd;
s300: acquiring single data Dg and the number Fc of service windows;
s400: calculating the service arrival time Q according to Fs, pd, dg and Fc,
the specific calculation formula is as follows:
in the formula, X4<1, and is a preset value;
s500: automatically obtaining the current time, and adding Q to the current time to obtain a service point time Qf;
s600: obtaining a difference value Ct between the service point arrival time Qf and the arrival time Dd, wherein the unit of the difference value is minutes; when Ct is larger than zero, the service point time Qf is shown to be earlier than the arrival time Dd by Ct minutes, and when Ct is smaller than zero, the service point time Qf is shown to be later than the arrival time Dd by Ct minutes;
s601: when Ct is less than or equal to X5, X5 is a preset value; automatically reserving the next queuing number of the latest queuing number and marking the queuing number as a service number; acquiring the service point time Qf at the moment; the latest queuing number is the number called at the last time;
s602: when Ct > X5, performing the following number taking following steps of S603-S605;
s603: acquiring real-time Ts, and automatically acquiring residual time St between the real-time Ts and arrival time Dd;
s604: when St is more than X6, the real-time Ts at the moment is still St time from the user to the service center; x6 is a preset value; the number of the corresponding number is obtained by the formula,
monitoring the latest queuing number in real time, reserving the number to be taken when the next number of the latest queuing number is the number to be taken, and otherwise, not performing any action;
s605: and when St is less than or equal to X6, the user is shown to reach the service center, and the next number of the latest queuing number is acquired and marked as the service number.
2. The cloud-computing-based service reservation system according to claim 1, wherein the specific analysis steps of the inertial analysis are:
the method comprises the following steps: acquiring the time of receiving a reservation signal and the time of receiving a starting signal;
step two: automatically acquiring a time interval for receiving a starting signal after a reservation signal is sent, marking the time interval as preparation time, and marking the obtained preparation time as one-time preparation time;
step three: storing the preparation time obtained each time in an inertia following unit to form a preparation time group Zi, i =1.. N;
step four: when the number of the preparation time in the preparation time group is larger than or equal to a preset value X1, generating a starting signal and automatically acquiring standard time; the acquisition steps are as follows:
s1: acquiring a preparation time group Zi;
s2: acquiring X2 preparation times according to a time sequence from near to far, and marking the corresponding preparation times as standard times; wherein X2 is not more than X1;
s3: calculating to obtain an average value of the standard time, and marking the average value as inertia time Tg;
step five: when the number of the preparation time in the preparation time group is smaller than the preset value X1, a starting signal is generated when the starting signal is received, and the inertia time Tg is zero at the moment.
3. The cloud-computing-based service reservation system according to claim 1, wherein the schedule estimation comprises the following specific steps:
the method comprises the following steps: acquiring reservation information, position information, a start signal and inertia time Tg;
step two: acquiring reservation content in reservation information, locking a service center according to the reservation content, and automatically acquiring the position of the service center;
step three: according to the position information and the position of the service center, the map library is utilized to obtain the shortest time and the longest time required for reaching the position of the service center from the position information, and the time can be obtained by means of current navigation software;
step four: automatically calculating to obtain the average value of the shortest time and the longest time, and marking the average value as the journey time;
step five: adding the path time to the inertia time Tg to obtain the consumed time;
step six: the generation time of the starting signal is automatically acquired, and the time is added with the consumed time to obtain the arrival time Dt.
4. The cloud-computing-based service reservation system according to claim 1, wherein the service efficiency obtaining method is:
and (4) SS1: acquiring recent queuing data, wherein the queuing data is the time spent from the beginning of the last number to the next number; the recent concrete concept is that from the latest queuing data, X3 queuing data are pushed forward, and X3 is a preset value;
and SS2: acquiring a mean value of queuing data, and marking the mean value as single data Dg;
and (4) SS3: the number of service windows owned by the service center is obtained and marked as Fc.
5. The cloud-computing-based service reservation system according to claim 1, wherein the processor obtains the service number of the user through number calling processing and returns the service number to the data interaction unit, and the data interaction unit receives the service number transmitted by the processor;
the data interaction unit is used for returning the service number to the cloud processor, the cloud processor receives the service number transmitted by the data interaction unit and transmits the service number to the display unit, and the display unit receives the service number transmitted by the cloud processor and automatically displays the service number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910556456.9A CN110232459B (en) | 2019-06-25 | 2019-06-25 | Service reservation system based on cloud computing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910556456.9A CN110232459B (en) | 2019-06-25 | 2019-06-25 | Service reservation system based on cloud computing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110232459A CN110232459A (en) | 2019-09-13 |
| CN110232459B true CN110232459B (en) | 2022-11-25 |
Family
ID=67857283
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910556456.9A Active CN110232459B (en) | 2019-06-25 | 2019-06-25 | Service reservation system based on cloud computing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110232459B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110992573A (en) * | 2019-11-29 | 2020-04-10 | 中国银行股份有限公司 | Method and system for distributing numbers |
| CN110992572B (en) * | 2019-11-29 | 2022-06-03 | 中国银行股份有限公司 | Method and system for distributing numbers |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1096431A1 (en) * | 1999-10-27 | 2001-05-02 | Sony International (Europe) GmbH | Reservation system and mobile terminal for the reservation of queuing numbers |
| CN104598975A (en) * | 2015-02-04 | 2015-05-06 | 西安位面网络科技有限公司 | Field service reservation intelligent queuing system and method thereof based on Internet and geographic position |
| WO2018194513A1 (en) * | 2017-04-17 | 2018-10-25 | Lovearth Ecolife Pte. Ltd. | Queue management system and method |
-
2019
- 2019-06-25 CN CN201910556456.9A patent/CN110232459B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1096431A1 (en) * | 1999-10-27 | 2001-05-02 | Sony International (Europe) GmbH | Reservation system and mobile terminal for the reservation of queuing numbers |
| CN104598975A (en) * | 2015-02-04 | 2015-05-06 | 西安位面网络科技有限公司 | Field service reservation intelligent queuing system and method thereof based on Internet and geographic position |
| WO2018194513A1 (en) * | 2017-04-17 | 2018-10-25 | Lovearth Ecolife Pte. Ltd. | Queue management system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110232459A (en) | 2019-09-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110232459B (en) | Service reservation system based on cloud computing | |
| US8797900B2 (en) | Automatic web conference presentation synchronizer | |
| CN104657826B (en) | Resource allocation methods and device | |
| US20150200978A1 (en) | Meeting Conflict Indicator | |
| US9509950B2 (en) | Information processing system, information processing method, information processing apparatus, and control method and control program of information processing apparatus | |
| CN102129737A (en) | Acquiring method and system of queuing wait time | |
| WO2016155146A1 (en) | Positioning method and apparatus based on electronic device or application | |
| JP2012164125A (en) | Reservation management system | |
| WO2017143896A1 (en) | Route information-related interactive method, electronic apparatus, and computer storage medium | |
| EP2950265A1 (en) | Detecting important transit stops for transit trip grouping | |
| CN109978371A (en) | A kind of order allocation method and device | |
| JP2015138491A (en) | Reservation management device, reservation management method and program | |
| JP2009141513A (en) | Message transfer apparatus, message transfer system, message transmission assistance method, and program | |
| KR20230088332A (en) | Data annotation methods, devices, systems, devices and storage media | |
| CN108551656A (en) | More people navigation sharing method based on mobile terminal and mobile terminal | |
| US7386613B2 (en) | System and method for measuring middleware response time | |
| CN114021035A (en) | Sampling queue control method, regional server, system, device and medium | |
| CN112163686B (en) | Waiting response time confidence interval prediction method and device for G/G/1 queuing system | |
| KR20120095325A (en) | Method and system for providing social-computing-based location information using mobile augmented reality | |
| JP2000276361A (en) | Program response time predicting device | |
| JP6186165B2 (en) | Information system, second terminal device, information processing method, and program | |
| CN109903759A (en) | Interactive maintenance device and non-transitory computer readable recording medium | |
| JP2009524984A (en) | Real-time wireless information service | |
| CN111654673B (en) | Video cover updating method and device and storage medium | |
| CN111599077B (en) | Data management method and communication terminal |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |