Summary of the invention
The invention provides a kind of service provider and provide when service for its client, according to the requirement of client to service day estimated time of arrival (ETA) section, take all factors into consideration this time period available service personnel, for the reservation customer service the time accounting and preengage situation, rationally arrange the reservation client to distribute, to avoid preengaging congested method, and by subscription services priority query is set, with non-reservation client common service window, avoid or shorten reservation custom queueing waiting time, make full use of Service Source and provide the purpose of good service experience to reach, thereby improve customer satisfaction with services and loyalty to the client.
The client need arrive service provider's service location transacting business, when accepting service, can propose the reservation application to the service provider by following means:
● dial service provider's customer service call (as China Mobile 1860 etc.)
● by the reservation page on the Internet access service provider website
● preengage the page or send note with the palm service of WAP mode access services provider by mobile phone, trigger the service provider and preengage the page to client's mobile phone Push Service in the WAPPush mode to the customer service note number
In order rationally to arrange the reservation client to distribute according to the time period of client's reservation, we have designed following method, divide several steps to finish:
One, time division sheet
The service provider is divided into sheet 30 minutes equally spaced continuous times one day business hours; See accompanying drawing 1.
S
1But be first subscription time sheet after the business beginning, S
eBut be last the subscription time sheet before business finishes, S
nBut be n subscription time sheet after the business beginning.
Two, to the requirement of client's subscription time section
Stipulate that client's subscription time section must be on the border of the least bit or integral point, and span is no more than 60 minutes, i.e. the time period of client's reservation can cross over one or two timeslice.
Represent the time period that the client preengages with S, then S is S
nSet, can be expressed as:
S={S
nOr S={S
n, S
N+1}
Three, calculate the maximum available service resource of every timeslice C
T(unit: minute or min)
Parameter and variable-definition:
N: available service personnel's number;
α: each attendant can be the time accounting of reservation customer service, and for example: α=30%, it can be the reservation customer service that the expression attendant has time of 30% in each timeslice.The service provider can use the situation of subscription services along with the client, dynamically adjusts the α value;
t
s: reservation client's expectation service time;
Then:
C
T=n*30*α
Four, C
T(n) expression S
nTimeslice available service resource, and consideration subscription services margin factor β (for example: β=80%), C
T(n) initial value is:
C
T(n)=C
T*β=n*30*α*β;
Along with reservation S
nThe reservation client of timeslice success increases gradually or constantly has and preengage the client and be adjusted and be arranged in S
nIn the timeslice, C
T(n) reduce gradually.S
nClient of every increase in the timeslice, C
T(n)=C
T(n)-t
s, wherein, t
sFor this client estimates service time.
Five, preengage the decision algorithm whether application is accepted
1.S={S
nThe reservation decision algorithm
(1) if S
nThe current available service resource of timeslice C
T(n) 〉=t
s, expression can be admitted this client's reservation application, revises S
nTimeslice available service resource is as follows:
C
T(n)=C
T(n)-t
s
New client preengages success;
(2) otherwise, need check one by one according to the order of " subscription time by evening to early " to be arranged in S
nCan the client of reservation of timeslice meet the following conditions simultaneously:
A. the time period of this client's reservation crosses over S
n, S
N+1Two timeslices, that is:
S={S
n,S
n+1},
B. this client's expectation t service time
s' satisfy:
C
T(n)+t
s′≥t
s,
C
T(n+1)≥t
s′;
If can find such one to preengage the client, represent that this client can postpone till S
N+1Timeslice is arranged, and admits new client's reserve requests so, and new client is arranged in S
nTimeslice is arranged in S with the client of reservation who finds
N+1Timeslice is revised S
n, S
N+1The available service resource of timeslice is as follows:
C
T(n)=C
T(n)+t
s′-t
s
C
T(n+1)=C
T(n+1)-t
s′
New client preengages success;
(3) preengage the client if can not find such one, the reservation failure.
2.S={S
n, S
N+1The reservation decision algorithm
(1) judges that can client's reserve requests be arranged in S
nIn the timeslice, i.e. condition
C
T(n)≥t
s
Whether satisfy, if satisfy, the reserve requests of admitting new client is revised S
nThe available service resource of timeslice is as follows:
C
T(n)=C
T(n)-t
s
New client preengages success;
(2) if new client's reserve requests can not be arranged in S
nIn the timeslice, judge that can new client's reserve requests be arranged in S
N+1In the timeslice, decision algorithm is preengage period S={S as the client
nDecision algorithm (n with n+1 substitute), specific as follows:
If I is S
N+1The current available service resource of timeslice C
T(n+1) 〉=t
s, expression can be admitted this client's reservation application, revises S
N+1Timeslice available service resource is as follows:
C
T(n+1)=C
T(n+1)-t
s
New client preengages success;
II otherwise, need check one by one according to the order of " subscription time by evening to early " to be arranged in S
N+1Can the client of reservation of timeslice meet the following conditions simultaneously:
A. this client's subscription time section is crossed over S
N+1, S
N+2Two timeslices, that is:
S={S
n+1,S
n+2},
B. this client's expectation t service time
s' satisfy:
C
T(n+1)+t
s′≥t
s,
C
T(n+2)≥t
s′;
If can find such one to preengage the client, represent that this client can postpone till S
N+2Timeslice, the reserve requests of admitting new client so is arranged in S with new client
N+1Timeslice is arranged in S with the client of reservation who finds
N+2Timeslice is revised S
N+1, S
N+2The available service resource of timeslice is as follows:
C
T(n+1)=C
T(n+1)+t
s′-t
s
C
T(n+2)=C
T(n+2)-t
s′
New client preengages success;
III otherwise, reservation failure.
After the client preengages success, in system, mainly contain four kinds of states:
● wait for submit state---the reserve requests that shows this client is accepted by the queuing subsystem, but owing to do not arrive service day, also is not activated;
● active state---show and arrive customer service day, the client is activated, and waits for that the client arrives;
● the arrival state---show that this client through confirming the actual reservation arrival formation that arrives, is submitted to, may be in the queuing process, also may be in head of the queue, soon called out and accept service;
● the cancellation state---show that the client does not also arrive when the reservation term of validity finishes, reservation is cancelled.
State and the conversion of client in the queuing subsystem, as shown in Figure 2.
In case the client preengages success, reservation that the reservation subsystem distributes for this client to generate at random number, reservation number is used to confirm client's reservation behavior, and the client arrive the back on queue machine the checking user subscription identity, preengage subsystem simultaneously and this client's reservation application information can be passed to the queuing subsystem, in buffer memory, this moment, this client was in the wait submit state in system by queuing subsystem " reservation "; The queuing subsystem activates this client in service day, and customer status switches to active state, waits for that the client arrives; In the queuing subsystem special reservation is set and arrives formation, the client is after confirming arrival, the queuing subsystem is submitted to reservation arrival formation with this client by " elder generation arrives service earlier " principle and ranks, this queue priority is higher than the normal client formation, promptly the wait client is arranged as long as reservation arrives in the formation, will be by Priority Call, this moment, the normal client formation was in suspended state, guarantee that this client after of short duration waiting in line, can accept service; If subscription services is then cancelled in client's no show in the reservation term of validity.
In actual applications, but at the different demands of timeslice size and client's subscription time section boundary condition, can expand on the basis of above-mentioned algorithm, the service provider can provide subscription services relatively flexibly.