CN104464069A - Autonomous time selecting, queuing and number calling algorithm - Google Patents

Autonomous time selecting, queuing and number calling algorithm Download PDF

Info

Publication number
CN104464069A
CN104464069A CN201410603254.2A CN201410603254A CN104464069A CN 104464069 A CN104464069 A CN 104464069A CN 201410603254 A CN201410603254 A CN 201410603254A CN 104464069 A CN104464069 A CN 104464069A
Authority
CN
China
Prior art keywords
client
time
numbers
reservation
time period
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.)
Pending
Application number
CN201410603254.2A
Other languages
Chinese (zh)
Inventor
李光磊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN201410603254.2A priority Critical patent/CN104464069A/en
Publication of CN104464069A publication Critical patent/CN104464069A/en
Pending legal-status Critical Current

Links

Abstract

The invention relates to an autonomous time selecting, queuing and number calling algorithm. According to the capability of reception with the special time at places of business as well as the proportion of customers with appointment and customers without appointment, a brand new number calling algorithm is provided for managing the number calling sequence for business by customers within the selected time interval.

Description

One Zero queuing algorithm when main separation
Technical field
The present invention relates to one Zero queuing algorithm when main separation.
Background technology
For needing long-time place of queuing up, existing patent of invention report as " a kind of from main separation time queue machine and queuing strategy " (CN201210177187.3), to reduce the time that client scene is waited in line, reduce the number queued up in scene, place of business.Namely " by the arrangement to the time period, virtually crowd is being divided into groups, to reach the reasonable distribution to room and time.
But because its queueing logic and traditional queue machine have larger difference, can not serial number that completely traditionally queue machine provides call out the numbers successively in order, so need to provide a set of algorithm of calling out the numbers completely newly, solve the order problem of calling out the numbers that client carrys out transacting business within the selected time period.The principle of design of this algorithm needs to improve the efficiency of calling out the numbers, and embodies again the justice of queuing.
Summary of the invention
The invention provides one Zero queuing algorithm when main separation, client goes to specific place of business the time period selected by oneself, can handle required business, and this algorithm can process reservation client and non-preengages client simultaneously, be reached for all clients and to save time the effect of cost.
Of the present invention when main separation Zero queuing algorithm comprise the steps,
(1) be divided into some time section by specific place of business business hours section, and receive maximum X by the client that statistical study calculates corresponding unit interval section;
(2) client preengaging special time period can by the on-the-spot select time section of queue machine, or by the long-range means select time such as internet, mobile phone section, preengage the ratio of client according to reservation client and non-, the rule of calling out the numbers that coupling is preset, the business handling order of client is sorted.
(3) client to think to scene that before the closing time of regulation subscription information effectively, otherwise is considered as invalid, needs again to preengage.
If the business handling time has delay or business to finish in advance in section sometime, then the next time period arrangement of time of adjustment of postponing.
If the on-the-spot queue machine in place of business has calling system, the mode such as Quick Response Code, input handset reservation code can preengaging receipt by scanning client judges that client arrives the time of on-the-spot transacting business, and calling system is called out the numbers according to the order of the actual arrival of client.
If the on-the-spot queue machine in place of business does not have calling system, the reservation receipt of client can be collected by field personnel, call out the numbers according to the actual arrival order of client.
Preengage the ratio of client according to described reservation client and non-, coupling is preset rule of calling out the numbers and is divided into following four kinds,
Rule one, all clients are reservation clients, and call out the numbers separately (namely each is a queuing sequence number), the time point that system prompt client subscription time section terminates is the closing time arriving place of business, then call out the numbers according to the order of the actual arrival of this X position client.
Such as, X=10, subscription time order is: X1/X2/X3/X4/X5/X6/X7/X8/X9/X10
Reality to on-the-spot transacting business time sequencing is: X2/X5/X1/X4/X7/X8/X3/X9/X10/X6,
Order of then calling out the numbers is: X2/X5/X1/X4/X7/X8/X3/X9/X10/X6.
If that preengages within this time period is number in advance called complete, then the client in subsequent time period is cried within this time period in advance according to actual arrival order;
Such as subscription time order is for shown in Fig. 1:
Within this time period of 9:00-9:30, the actual order of the client to scene is: X2X4X3X5X1Y3Y2Y1
And the X group client preengage within this time period of 9:00-9:30 has cried in advance.
Then continue to cry: Y3Y2Y1.
There is neutral if the time of the actual arrival of the people preengage within certain time period is discontinuous, then the client of next period actual arrival is inserted in free time section and calls out the numbers in advance.
Such as situation shown in Fig. 2:
Preengage the rear not on-site time waste caused to reduce client, can in place of business sometime in section maximum capacity basis on increase a few individual again.
In order to reduce the situation occurring neutral, system can shift to an earlier date the prompt time of client's transacting business.
The call out the numbers benefit of rule of this kind improves the efficiency of calling out the numbers, if do not arrive on-the-spot transacting business after client's reservation, then can not called number, and decrease the time waste being spacing; Embody the fairness of queuing in addition, namely who arrives first and just first whom cries.
Mate this kind of regular algorithm of calling out the numbers and be applicable to the place that bank agency, hospital's waiting room, government services mechanism, food and drink StoreFront etc. need to call out the numbers separately.
Rule two, all clients all employ the pattern of preengaging on a time period, and batch calls out the numbers (being namely a lot number) at every turn,
Suppose X=5, certain place of business was divided into a time period by 30 minutes, and its algorithm of calling out the numbers is illustrated in fig. 3 shown below:
5 clients (X1X2X3X4X5) of queuing system prompting group 1 are to on-the-spot transacting business before 9:00, and after client reaches the spot on time, system batch is this lineup (group 1) transacting business simultaneously.
Owing to being that batch is called out the numbers, the time point that system prompt reservation this time period of client starts is the closing time arriving place of business.
If have vacant position in the grouping within this time period, the people that the period below can be arranged to have come to queue up joins.
Mate the place that this kind of regular algorithm of calling out the numbers is applicable to need batch to call out the numbers within certain time period.The places of business such as such as large-scale recreation ground popular project, examination in hospital section office, tourist attractions, Large Exhibitions.
Rule three, part client is only had to all employ the pattern of preengaging on a time period, and call out the numbers separately (namely each be a queuing sequence number)
Y (Y<X) position client can only be preengage in place of business in section sometime, and reservation client preengage according to the time period, the non-reservation client scene number of getting successively, not time division section.
The time point that system prompt client subscription time section terminates is the closing time arriving place of business,
Such as, X>5 and Y=5 time, as shown in Figure 4
Call out the numbers according to the order of the actual arrival of client, in first time period, the client of reservation is preferential.Non-reservation client calls out the numbers subsequently successively according to row number order.The reservation client that second time period was then first named for the second time period, calls out the numbers regular the same.
Client as preengage in special time period does not have continuous print to arrive, then non-reservation client insertion also called out the numbers in order at free time.
This kind of rule its advantage compared with rule one is: place of business does not need the number of accurately estimating can receive at most in some time periods, has certain adjustment space and dirigibility; Requirement every client is not needed all to use this queuing algorithm when main separation; Be applicable to the place of business using queuing algorithm when main separation for the first time.
Mate this kind of regular algorithm of calling out the numbers and be applicable to the place that bank agency, hospital's waiting room, government services mechanism, food and drink StoreFront etc. need to call out the numbers separately.
Rule four, only have part client to employ the pattern of preengaging on a time period, and batch call out the numbers (being namely a lot number) at every turn
Y (Y<X) position client can only be preengage in section sometime in place of business, and all the other Z (Z=X-Y) position client chooses successively according to on-the-spot queuing order.
Such as: X=10 and Y=5 time, as shown in Figure 5
These 5 clients of system prompt X1X2X3X4X5 arrive on-the-spot transacting business before 9:00, after client reaches the spot on time, the client coming first 5 in the client and non-reservation client that preengage these 5 is divided into one group (i.e. X1X2X3X4X5Z1Z2Z3Z4Z5), and system batch is this group 10 people transacting business simultaneously.
Owing to being that batch is called out the numbers, the time point that system prompt reservation this time period of client starts is the closing time arriving place of business.
If have vacant position in the grouping within this time period, the non-reservation client that the period below can be arranged to have come to queue up joins.
This kind of rule its advantage compared with rule two is: place of business does not need the number of accurately estimating can receive at most in some time periods, has certain adjustment space and dirigibility; Do not need requirement every client all to use this queuing algorithm when main separation, be applicable to the place of business using queuing algorithm when main separation for the first time.
Mate the place that this kind of regular algorithm of calling out the numbers is applicable to need batch to call out the numbers within certain time period.The places of business such as such as large-scale recreation ground popular project, examination in hospital section office, tourist attractions, Large Exhibitions.
Accompanying drawing explanation
Fig. 1. a regular subscription time schematic diagram of calling out the numbers.
Fig. 2. call out the numbers in rule one, the time of the actual arrival of people as reservation is discontinuous when there is neutral, and the client of next one period actual arrival is inserted into the process example schematic of calling out the numbers in advance in free time section.
Fig. 3. regular two subscription time schematic diagram of calling out the numbers.
Fig. 4. rule of calling out the numbers three arrangement schematic diagram.
Fig. 5. rule of calling out the numbers four arrangement schematic diagram.

Claims (7)

1. a Zero queuing algorithm when main separation, comprises the steps,
(1) be divided into some time section by specific place of business business hours section, and receive maximum X by the client that statistical study calculates corresponding unit interval section;
(2) client preengaging special time period can by the on-the-spot select time section of queue machine, or by the long-range means select time such as internet, mobile phone section, preengage the ratio of client according to reservation client and non-, the rule of calling out the numbers that coupling is preset, the business handling order of client is sorted;
(3) client is to on-the-spot before the closing time of regulation, then subscription information is effective, otherwise needs client again to preengage.
2. according to claim 1 when main separation Zero queuing algorithm, it is characterized in that,
Default rule of calling out the numbers described in step (2) is divided into following four kinds,
Rule one,
1. all clients are reservation clients, and call out the numbers separately,
2. the time point that system prompt client subscription time section terminates is the closing time arriving place of business,
3. system is called out the numbers according to the order of the actual arrival of X position client;
Rule two,
1. all clients are reservation clients, and batch is called out the numbers,
2. the time point of system prompt client subscription time section beginning is the closing time arriving place of business,
3. the X position client of reservation is divided into one group by system, calls out the numbers by group name at special time period, the transacting business while that client being in special time in group; Rule three,
1. part client all employ the pattern of preengaging on a time period, and calls out the numbers separately,
2. can only preengage Y (Y<X) position client in section sometime, reservation client preengage according to the time period, the non-reservation client scene number of getting successively, not time division section,
3. the time point that system prompt client subscription time section terminates is the closing time arriving place of business,
4. call out the numbers according to the order of the actual arrival of client, in special time period, the client of reservation is preferential, and non-reservation client calls out the numbers subsequently successively according to row number order;
Rule four,
1. only have part client to employ the pattern of preengaging on a time period, and batch is called out the numbers,
2. can only preengage Y (Y<X) position client in section sometime, all the other Z (Z=X-Y) position client chooses successively according to on-the-spot queuing order,
3. the time point of system prompt client subscription time section beginning is the closing time arriving place of business,
4. Y position reservation client and the non-reservation in Z position client (X=Y+Z) are divided into one group by system, call out the numbers by group name at special time period, the transacting business while that client being in special time in group.
3. according to claim 2 when main separation Zero queuing algorithm, it is characterized in that, described regular one also comprises,
4. as reservation number in this time period has been named in advance, then the client in subsequent time period is called out the numbers within this time period in advance according to actual order of arrival,
Or time 5. as the actual arrival of reservation client in this time period discontinuously occurs free time section, then the client of next one period actual arrival is inserted in described free time section by actual order of arrival and call out the numbers in advance.
4. according to claim 2 when main separation Zero queuing algorithm, it is characterized in that, described regular two also comprise,
4. as having vacant position in the grouping in this time period, then the client arranging the period below to arrive adds this group.
5. according to claim 2 when main separation Zero queuing algorithm, it is characterized in that, described regular three also comprise,
5. the client as reservation in special time period does not have continuous print to arrive, then non-reservation client insertion also called out the numbers in order at free time.
6. according to claim 2 when main separation Zero queuing algorithm, it is characterized in that, described regular four also comprise,
If have vacant position in the grouping 5. within this time period, the non-reservation client that the period below can be arranged to have arrived adds this group.
7. according to claim 1-6 arbitrary described from main separation time Zero queuing algorithm, it is characterized in that, if the business handling time has and postpones or handled in advance, then the next time period arrangement of time of adjustment of postponing in section sometime.
CN201410603254.2A 2014-11-02 2014-11-02 Autonomous time selecting, queuing and number calling algorithm Pending CN104464069A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410603254.2A CN104464069A (en) 2014-11-02 2014-11-02 Autonomous time selecting, queuing and number calling algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410603254.2A CN104464069A (en) 2014-11-02 2014-11-02 Autonomous time selecting, queuing and number calling algorithm

Publications (1)

Publication Number Publication Date
CN104464069A true CN104464069A (en) 2015-03-25

Family

ID=52910049

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410603254.2A Pending CN104464069A (en) 2014-11-02 2014-11-02 Autonomous time selecting, queuing and number calling algorithm

Country Status (1)

Country Link
CN (1) CN104464069A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109035541A (en) * 2018-07-04 2018-12-18 万翼科技有限公司 The delivery method and its device and computer readable storage medium in house
CN113450493A (en) * 2021-06-07 2021-09-28 湖南中惠旅智能科技有限责任公司 High-flow scenic spot queuing method and system
CN115273316A (en) * 2022-06-24 2022-11-01 国网山东省电力公司微山县供电公司 Queuing and calling method and system for business place reservation

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101582180A (en) * 2008-05-16 2009-11-18 深圳市华骏电气有限公司 Remote query-reservation type queuing machine and remote query-reservation queuing method
US20110077969A1 (en) * 2009-09-29 2011-03-31 Shanghai Pudong New Area People's Hospital Self-service medical service method and its system
CN102855366A (en) * 2011-06-29 2013-01-02 苏州盈迪信康网络信息技术有限公司 Computation method of appointment registration
CN103606217A (en) * 2013-12-06 2014-02-26 李光磊 Time selection reservation queuing machine

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101582180A (en) * 2008-05-16 2009-11-18 深圳市华骏电气有限公司 Remote query-reservation type queuing machine and remote query-reservation queuing method
US20110077969A1 (en) * 2009-09-29 2011-03-31 Shanghai Pudong New Area People's Hospital Self-service medical service method and its system
CN102855366A (en) * 2011-06-29 2013-01-02 苏州盈迪信康网络信息技术有限公司 Computation method of appointment registration
CN103606217A (en) * 2013-12-06 2014-02-26 李光磊 Time selection reservation queuing machine

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
黄黎明: "分时段预约号源分配规则方案设计", 《中国数字医学》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109035541A (en) * 2018-07-04 2018-12-18 万翼科技有限公司 The delivery method and its device and computer readable storage medium in house
CN113450493A (en) * 2021-06-07 2021-09-28 湖南中惠旅智能科技有限责任公司 High-flow scenic spot queuing method and system
CN113450493B (en) * 2021-06-07 2022-10-21 湖南中惠旅智能科技有限责任公司 High-flow scenic spot queuing method and system
CN115273316A (en) * 2022-06-24 2022-11-01 国网山东省电力公司微山县供电公司 Queuing and calling method and system for business place reservation
CN115273316B (en) * 2022-06-24 2024-03-15 国网山东省电力公司微山县供电公司 Queuing and calling method and system for business place reservation

Similar Documents

Publication Publication Date Title
CN202042006U (en) Wireless intelligent queuing number calling system based on ZigBee
CN104200557A (en) System and method for realizing intelligent number taking by using handheld equipment
CN109934986A (en) Queuing strategy, device, equipment and readable storage medium storing program for executing based on terminal
CN104464069A (en) Autonomous time selecting, queuing and number calling algorithm
CN109672543B (en) Group event management method and device
CN108230527A (en) A kind of novel intelligent cloud is lined up measuring and calculating and the method and system of automatic shunt
WO2011065746A3 (en) Method for recovering a frame that failed to be transmitted in a mu-mimo based wireless communication system
CN107274538A (en) Intelligent interaction cloud queuing management method and system
CN103347066A (en) Queuing method and system
CN102129737A (en) Acquiring method and system of queuing wait time
CN101706978A (en) Catering queuing system and implementation method
CN103366436A (en) Numbering system and numbering notification method
CN105046802B (en) A kind of bank queuing management method and system based on many sales counters
CN106203989A (en) A kind of information processing method and device
CN103729928A (en) Control method and device of express self-taking cabinet
CN104573921A (en) Group-based task allocation method through enterprise mobile office system
WO2005122098A1 (en) System utilising sms messages for dispensing of queuing numbers and informing of persons waiting on the number being served
CN102664820A (en) Method and system for inviting guests to attend video conference
CN102377884B (en) Call queuing method and device
CN105792141B (en) A kind of sending method of clustering paging message
CN110232459B (en) Service reservation system based on cloud computing
CN105701901A (en) Information processing method and electronic device
CN103916970B (en) Multimode list treats user equipment RAT event scheduling method and apparatus
CN100370727C (en) Method and system for transmitting and processing advertisement in internetwork
CN104935663B (en) A kind of multi-client collaboration packet data synchronization processing method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20150325