[go: up one dir, main page]

CN1924911A - Method for realizing reservation services in time section for clients - Google Patents

Method for realizing reservation services in time section for clients Download PDF

Info

Publication number
CN1924911A
CN1924911A CNA2005100979836A CN200510097983A CN1924911A CN 1924911 A CN1924911 A CN 1924911A CN A2005100979836 A CNA2005100979836 A CN A2005100979836A CN 200510097983 A CN200510097983 A CN 200510097983A CN 1924911 A CN1924911 A CN 1924911A
Authority
CN
China
Prior art keywords
reservation
service
customer
client
time
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
CNA2005100979836A
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 CNA2005100979836A priority Critical patent/CN1924911A/en
Publication of CN1924911A publication Critical patent/CN1924911A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本发明涉及计算机应用和服务管理领域,是一种服务行业从业企业,服务提供商在受理客户按时间段申请预约服务时,合理安排预约时间段内的预约客户分布,以尽量满足预约客户要求的方法。目前的预约服务,没有有效考虑预约时间段内的可用服务资源和已预约情况,容易造成预约拥塞;并且大多设立专用服务窗口为预约客户提供服务,既不能充分利用服务资源,也不能很好处理预约客户集中到达时的情况。本发明的核心是提供了一种服务提供商在受理客户按时间段申请预约服务时,综合考虑该时间段可用服务人员、为预约客户服务的时间占比和已预约情况,合理安排预约客户分布,以避免预约拥塞的方法,并通过设置预约服务优先级队列,和非预约客户共用服务窗口,避免或缩短预约客户排队等候时间,提高服务资源利用率。

Figure 200510097983

The present invention relates to the field of computer application and service management, and is an enterprise engaged in the service industry. When a service provider accepts a customer to apply for a reservation service according to a time period, the service provider reasonably arranges the distribution of reservation customers within the reservation time period, so as to meet the requirements of the reservation customer as much as possible. method. The current reservation service does not effectively consider the available service resources and the reservation status within the reservation time period, which is likely to cause reservation congestion; and most of them set up special service windows to provide services for reservation customers, which can neither make full use of service resources nor handle them well The situation when reservation customers arrive intensively. The core of the present invention is to provide a service provider that, when accepting a customer's application for a reservation service according to a time period, comprehensively considers the available service personnel in the time period, the proportion of time for serving the reservation customer and the reservation situation, and reasonably arranges the distribution of reservation customers To avoid reservation congestion, and by setting the reservation service priority queue and sharing the service window with non-reservation customers, avoid or shorten the waiting time of reservation customers in line and improve the utilization of service resources.

Figure 200510097983

Description

A kind of client's method of subscription services on a time period that realizes
Technical field
The present invention relates to computer utility and service management domain, specifically, be that a kind of service provider utilizes software, hardware facility, when the client applies for subscription services on a time period, take all factors into consideration this time period available service personnel, be to preengage the time accounting of customer service and preengage situation, rationally arrange the reservation client to distribute, to avoid preengaging congested method.
Background technology
Along with the development of society, people's work and rhythm of life are constantly accelerated, to the also constantly increase of demand of service.How effectively adapting to client's rhythm, saving client's quality time, improve efficiency of service, strengthen client's service experience, is the significant challenge that service industry faces.The service provider has begun to provide gradually subscription services at present, but still has a lot of problems, mainly shows:
One, do not have effectively to consider the available service resource in the subscription time section and preengage situation, cause reservation congested easily;
Two, mostly by setting up the service-specific window to provide service, may cause the wasting of resources on the one hand, on the other hand,, still need queuing, cause that easily the client is discontented if the reservation client arrives when concentrating relatively for the reservation client.
The present invention is conceived to solve the client to adapt to the rhythm arrangement of self working and living, the requirement of avoiding or reduce the time of waiting in line as far as possible, the provider of helping service simultaneously makes full use of Service Source, rationally arranges the reservation client to distribute, improve efficiency of service, and this present just subscription services mode institute is unapproachable.
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.
Description of drawings
Accompanying drawing 1: service provider's business hours timeslice is divided figure
Accompanying drawing 2: reservation arrives constitutional diagram

Claims (2)

1.一种尽量满足客户要求按时间段预约服务的方法,所述方法使客户在需要接受服务时,提前一天或几天向服务提供商预约其于服务日预计到达的时间段,以便到达后尽量避免或缩短排队等候时间。其特征在于:综合考虑预约客户预约时间段内可用服务人员、为预约客户服务的时间占比和已预约情况,合理安排预约客户分布,以避免预约拥塞。1. A method of booking services according to time slots to meet customer requirements as far as possible. The method enables customers to make reservations with service providers for the time slots they expect to arrive on the service day one or several days in advance when they need to receive services, so that when they arrive Try to avoid or shorten the waiting time in line. It is characterized in that: considering the available service personnel within the reservation time period of the reservation customers, the proportion of time serving the reservation customers and the reservation situation, the distribution of reservation customers is reasonably arranged to avoid reservation congestion. 2.根据权利要求1所述的一种尽量满足客户要求按时间段预约服务的方法,其特征在于:2. A kind of method according to claim 1 as far as possible satisfying client's requirement to reserve service according to time period, it is characterized in that: 将服务提供商一天的营业时间划分成30分钟等间隔的连续时间片,在每个时间片内,设定可用服务资源值。当客户进行时间段预约申请时,系统首先判断该时间段所跨跃的时间片内,是否存在足够的可用服务资源,如果存在,则接受新客户的预约申请;否则,检查是否能够将该时间段的最后一个时间片内某个已预约客户推迟到下一个时间片,以空出足够的服务资源来满足新客户的预约申请,如果能够,则将该客户推迟到下一个时间片,接纳新客户的预约申请,如果不能,拒绝新客户的预约申请。Divide the business hours of a service provider into continuous time slices with equal intervals of 30 minutes, and set the available service resource value in each time slice. When a customer makes an appointment application for a time slot, the system first judges whether there are enough available service resources in the time slice spanned by the time slot, and if so, accepts the new customer’s appointment application; In the last time slot of the segment, a customer who has made an appointment is postponed to the next time slot to free up enough service resources to meet the appointment application of the new customer. If it is possible, the customer is postponed to the next time slot to accept the new Customer's appointment application, if not, reject the new customer's appointment application. 一旦客户的预约申请被系统接受,该客户在系统中处于等待提交状态;并于服务日被激活,切换到活动状态,等待客户到达;客户经确认到达后,系统将该客户排入预约到达队列,该队列优先级高于普通客户队列,确保该客户经短暂排队等待后,即可接受服务;如果客户在预约有效期内未到达,则取消预约服务。Once the customer's appointment application is accepted by the system, the customer is in the waiting submission state in the system; it is activated on the service day, switches to the active state, and waits for the customer to arrive; after the customer's arrival is confirmed, the system puts the customer in the appointment arrival queue , the priority of this queue is higher than that of the ordinary customer queue, ensuring that the customer can receive the service after waiting in a short queue; if the customer does not arrive within the validity period of the reservation, the reservation service will be cancelled.
CNA2005100979836A 2005-09-02 2005-09-02 Method for realizing reservation services in time section for clients Pending CN1924911A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNA2005100979836A CN1924911A (en) 2005-09-02 2005-09-02 Method for realizing reservation services in time section for clients

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNA2005100979836A CN1924911A (en) 2005-09-02 2005-09-02 Method for realizing reservation services in time section for clients

Publications (1)

Publication Number Publication Date
CN1924911A true CN1924911A (en) 2007-03-07

Family

ID=37817538

Family Applications (1)

Application Number Title Priority Date Filing Date
CNA2005100979836A Pending CN1924911A (en) 2005-09-02 2005-09-02 Method for realizing reservation services in time section for clients

Country Status (1)

Country Link
CN (1) CN1924911A (en)

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103217152A (en) * 2012-01-18 2013-07-24 歌乐株式会社 Reservation system, navigation device, battery charger and server
CN105989416A (en) * 2015-02-09 2016-10-05 天津五八到家生活服务有限公司 Reservation method, system and device
CN106991484A (en) * 2016-11-14 2017-07-28 蔚来汽车有限公司 Secondary resource reservation method based on intelligent repeated reservation
CN108364089A (en) * 2017-01-27 2018-08-03 西门子保健有限责任公司 Method and computer program for planning client's reservation
CN109658220A (en) * 2018-09-27 2019-04-19 深圳壹账通智能科技有限公司 Online face kernel method, equipment, storage medium and device based on data analysis
CN110516888A (en) * 2019-09-02 2019-11-29 重庆紫光华山智安科技有限公司 Trajectory predictions method, apparatus, electronic equipment and computer readable storage medium
CN110572522A (en) * 2018-06-05 2019-12-13 北京京东尚科信息技术有限公司 Method and device for making an appointment to call back
CN110709867A (en) * 2017-05-30 2020-01-17 瑞可利有限公司 Reservation Receiving Device and Reservation Receiving Program
CN111385422A (en) * 2018-12-11 2020-07-07 北京京东尚科信息技术有限公司 Reserved telephone traffic management method and device
CN112633536A (en) * 2019-10-09 2021-04-09 北京京东尚科信息技术有限公司 Method and device for scheduling delivery time
CN112906922A (en) * 2021-01-21 2021-06-04 绿瘦健康产业集团有限公司 Room service people number configuration method and device and storage medium
CN113011730A (en) * 2021-03-15 2021-06-22 绿瘦健康产业集团有限公司 Method and device for matching client with service staff and storage medium
CN113837416A (en) * 2021-11-23 2021-12-24 环球数科集团有限公司 Time-sharing reservation method and system for maintaining maximum garden entry rate by time-span period fusion
CN117196079A (en) * 2023-11-07 2023-12-08 北京赢科天地电子有限公司 Teacher-student online reservation method and system based on data relationship

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103217152A (en) * 2012-01-18 2013-07-24 歌乐株式会社 Reservation system, navigation device, battery charger and server
CN103217152B (en) * 2012-01-18 2016-03-23 歌乐株式会社 Reservation system, charger and server
CN105989416A (en) * 2015-02-09 2016-10-05 天津五八到家生活服务有限公司 Reservation method, system and device
CN106991484A (en) * 2016-11-14 2017-07-28 蔚来汽车有限公司 Secondary resource reservation method based on intelligent repeated reservation
CN106991484B (en) * 2016-11-14 2021-07-23 蔚来(安徽)控股有限公司 Secondary resource reservation method based on intelligent repeated reservation
CN108364089A (en) * 2017-01-27 2018-08-03 西门子保健有限责任公司 Method and computer program for planning client's reservation
CN110709867A (en) * 2017-05-30 2020-01-17 瑞可利有限公司 Reservation Receiving Device and Reservation Receiving Program
CN110572522A (en) * 2018-06-05 2019-12-13 北京京东尚科信息技术有限公司 Method and device for making an appointment to call back
CN109658220A (en) * 2018-09-27 2019-04-19 深圳壹账通智能科技有限公司 Online face kernel method, equipment, storage medium and device based on data analysis
CN111385422A (en) * 2018-12-11 2020-07-07 北京京东尚科信息技术有限公司 Reserved telephone traffic management method and device
CN110516888A (en) * 2019-09-02 2019-11-29 重庆紫光华山智安科技有限公司 Trajectory predictions method, apparatus, electronic equipment and computer readable storage medium
CN110516888B (en) * 2019-09-02 2020-12-22 重庆紫光华山智安科技有限公司 Trajectory prediction method, apparatus, electronic device and computer-readable storage medium
CN112633536A (en) * 2019-10-09 2021-04-09 北京京东尚科信息技术有限公司 Method and device for scheduling delivery time
CN112906922A (en) * 2021-01-21 2021-06-04 绿瘦健康产业集团有限公司 Room service people number configuration method and device and storage medium
CN113011730A (en) * 2021-03-15 2021-06-22 绿瘦健康产业集团有限公司 Method and device for matching client with service staff and storage medium
CN113837416A (en) * 2021-11-23 2021-12-24 环球数科集团有限公司 Time-sharing reservation method and system for maintaining maximum garden entry rate by time-span period fusion
CN117196079A (en) * 2023-11-07 2023-12-08 北京赢科天地电子有限公司 Teacher-student online reservation method and system based on data relationship

Similar Documents

Publication Publication Date Title
CN1924911A (en) Method for realizing reservation services in time section for clients
CN1138207C (en) Method and device for using remote JAVA object allocation program
US8365173B2 (en) Method and apparatus for on-demand resource allocation and job management
CN102779367B (en) Scheduling method of queuing processing system and queuing machine for prediction of service processing time
Karthick et al. An efficient multi queue job scheduling for cloud computing
Page et al. Framework for task scheduling in heterogeneous distributed computing using genetic algorithms
CN103023980B (en) A kind of method and system of cloud platform processes user service request
EP2256632B1 (en) Multi-processor scheduling
CN103150213B (en) Balancing method of loads and device
Cao et al. Queue scheduling and advance reservations with COSY
CN1794180A (en) Method and system for monitoring and controlling access to a computer system resource
CN1882019A (en) Method for call center realizing active callback and its active callback system
CN107506241A (en) A kind of flexible method of cloud platform automatic elastic
Ashouraei et al. A new SLA-aware load balancing method in the cloud using an improved parallel task scheduling algorithm
CN1825807A (en) Instant communication message display managing system, method and display interface thereof
CN112581073B (en) Method and system for managing collection operation maintenance labor intensity of robbery dispatch order
CN109597674A (en) A kind of shared virtualization pool share dispatching method and system
CN111343288B (en) Job scheduling method and system and computing device
CN1975771A (en) System and method for realizing order dispatch based on priority level
CN1561043A (en) A multi-user concurrent access device and method thereof
CN110515720B (en) Job Scheduling Method Driven by Cloud Computing System Service Cost and Reliability
Röblitz et al. Resource reservations with fuzzy requests
CN117215748A (en) Energy-efficient security-aware task scheduling method and device for heterogeneous multi-core systems
CN102736955A (en) Computational grid task scheduling method based on reliability and non-cooperation game
CN1315047C (en) A management method for cluster operations

Legal Events

Date Code Title Description
C57 Notification of unclear or unknown address
DD01 Delivery of document by public notice

Addressee: Gao Weidong

Document name: Correction notice

C06 Publication
PB01 Publication
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication