CN104392532A - Resource-sharing queuing method and resource-sharing queuing system - Google Patents

Resource-sharing queuing method and resource-sharing queuing system Download PDF

Info

Publication number
CN104392532A
CN104392532A CN 201410626442 CN201410626442A CN104392532A CN 104392532 A CN104392532 A CN 104392532A CN 201410626442 CN201410626442 CN 201410626442 CN 201410626442 A CN201410626442 A CN 201410626442A CN 104392532 A CN104392532 A CN 104392532A
Authority
CN
Grant status
Application
Patent type
Prior art keywords
number
main
numbers
match
queuing
Prior art date
Application number
CN 201410626442
Other languages
Chinese (zh)
Inventor
郑志豪
Original Assignee
郑志豪
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

Links

Abstract

The invention provides a resource-sharing queuing method, and relates to the field of queuing. The method comprises the following steps: A. inputting applications; B. bringing the applications together; C. outputting queuing numbers according to the result of bringing-together, more particularly, dividing the queuing numbers into main numbers and slave numbers, wherein the main numbers are sequence numbers, the slave numbers are subordinate numbers, one main number corresponds to 0 or a plurality of slave numbers, and one slave number only corresponds to one main number; if bringing-together is successful, outputting the slave number of a certain main number; if bringing-together is not successful, outputting a new main number; D. allocating resource according to the sequence of the main numbers; E. enabling the main numbers and the slave numbers belonging to the main numbers to share the resource. The invention also provides a resource-sharing queuing system. After the method and the system are adopted, convenience and support are provided for sharing resource.

Description

一种可资源共享的排队方法及系统 A resource sharing and queuing system

技术领域 FIELD

[0001] 本发明涉及排队领域,特别是一种可资源共享的排队方法及系统。 [0001] The present invention relates to the field of queuing, in particular a shareable resource queuing method and system.

背景技术 Background technique

[0002] 排队是为了解决人们对资源的无序竞争,排队系统解决了以排队号替代人工站队的排队方式,极大方便了人们日常生活。 [0002] In order to solve people are queuing disorderly competition for resources, to solve the queuing system to replace manual line number line stand in the way of great convenience for people's daily life. 其中资源包括有形的实物、人力资源、信息资源、空间、时间等,以及由实物、人力资源、信息资源、空间、时间等为基础所产生的服务。 Which kind of resources including tangible, human resources, information resources, space, and time, as well as services from the physical, human resources, information resources, space, and time-based generated. 但传统的排队方法和系统,只适应资源或服务分配时一个客户的独占,某个客户申请到一个排队号,该排队号对应的资源或服务由他独享,其他客户无法主动参与共享。 But the traditional queuing method and system for allocating resources or services only to adapt to a customer's exclusive, a client application to a queue number, line number that corresponds to exclusive resources or services by him, other customers can not actively participate in sharing. 而现实当中,许多时候资源或服务可以共享的,特别在当今提倡节约,节能环保成为一项基本国策,资源共享,提高资源利用率,显得尤为重要。 The reality, in many cases the resource or service that can be shared, especially in today to promote conservation, energy conservation and environmental protection as a basic national policy, resource sharing, improve resource utilization, is particularly important.

发明内容 SUMMARY

[0003] 为解决上述技术缺陷,本发明提供一种可资源共享的排队方法。 [0003] To solve the above defects, the present invention provides a method capable of queuing resource sharing.

[0004] 为实现上述目的,本方案提供的可资源共享的排队方法,包括以下步骤: [0004] To achieve the above object, the present embodiment can provide resource sharing queuing method, comprising the steps of:

[0005] A、输入申请; [0005] A, an input application;

[0006] B、对申请进行撮合; [0006] B, for the application match;

[0007] C、按撮合结果输出排队号,具体是,所述排队号分为主号和从号,主号为顺序号或对应顺序号,从号为主号的从属号码,一个主号可以对应O或多个从号,一个从号只对应一个主号,若撮合成功,输出某个主号的从号,若撮合不成功,输出一个新的主号; [0007] C, according to the match result output line number, in particular, the number and line number from the main sub-number, the main number is the sequence number or sequence number corresponding to the slave number from the number-based numbers, a main number can O from the corresponding one or more numbers from a number corresponding to only a primary number, if the match is successful, the output from a number of the primary number, if the match is unsuccessful, a new master output signal;

[0008] D、按主号顺序分配资源; [0008] D, allocation of resources by the main number sequence;

[0009] E、主号和所属从号共享资源。 [0009] E, the main number and the associated number from the shared resource.

[0010] 步骤A、B所述申请,其申请条件为人、事、物、时间、地点、组织和事件中的任何一个或多个要素的任意组合。 [0010] Steps A, B of the application, the application conditions of a human, and things, time, location, organization, and any combination of any one event or a plurality of elements.

[0011] 步骤C所输出的排队号,可能为主号,也可能为从号。 [0011] Step C output line number, the number may be based, may also be from the number. 为从号的排队号本身不参与排序,也无法被分配资源。 Queuing number from the number itself is not involved in ordering and can not be allocated resources. 从号享用资源的顺序依赖于所从属的主号。 Access to resources from the sequence number is dependent on the primary number is subordinate.

[0012] 进一步地,每输出一个主号,公开该主号相关的一些属性。 [0012] Further, the output of each of a primary number, Publication No. Some of the main properties associated. 这些属性部份或全部根据申请条件生成的。 These attributes part or all of an application generated conditions. 这些属性可以作为与后来输入的申请相撮合的条件。 These properties can be used as the application conditions of the subsequent phases match the input.

[0013] 所述撮合的方法如下:预先设定阈值Y,假定匹配度为P,若P〉= Y为撮合成功,否则不成功;申请的条件分别为X1、X2......XN,各个主号的属性为S1、S2......SN,P为申请条件和主号属性的函数,P = f(Xl, X2......XN, SI, S2......SN)。 [0013] The method of the match is as follows: a predetermined threshold value Y, assumed matching degree is P, if P> = Y is a successful match, or else unsuccessful; application conditions are X1, X2 ...... XN attribute number for each main S1, S2 ...... SN, P is a function of the application conditions and properties of the main number, P = f (Xl, X2 ...... XN, SI, S2 ... ... SN). 若撮合成功的主号有多个,取匹配度最大的一个。 If successful match a plurality of primary number, takes a maximum matching degree. 若撮合成功的主号有多个,且匹配度一样,可任取其中一个。 If successful match a plurality of primary number, and matching the same, can take any one of them.

[0014] 所述按主号顺序分配的资源包括各种实物、人力资源、信息资源、空间、时间,也包括及由各种实物、人力资源、信息资源、空间、时间所产生的服务。 The [0014] resource allocation by the main number sequence includes various objects, human resources, information resources, time, space, and also comprising a various kind of service, human resources, information resources, space and time produced.

[0015] 为实现本发明的方法,本发明还提供一种可资源共享的排队系统,包括: [0015] To achieve the method of the present invention, the present invention also provides a resource sharing queuing system, comprising:

[0016] 客户终端、控制器、存储设备、叫号设备,客户终端接受申请,控制器根据申请条件,对所述申请作撮合;按撮合结果输出排队号,具体是,所述排队号分为主号和从号,主号为顺序号,从号为主号的从属号码,一个主号可以对应O或多个从号,一个从号只对应一个主号,若撮合成功,输出某个主号的从号,若撮合不成功,输出一个新的主号;叫号设备按主号顺序叫号并分配资源;主号和从属从号共享资源;所术存储设备用于存储申请条件和排队号信息。 [0016] The client terminal controller, a storage device, called the device number, the client application receiving terminal, the controller according to the application conditions for the application of the match; match result output by the line number, in particular, the line number into the major and the number, the main number is the sequence number of the slave number from the number-based numbers, the numbers may correspond to a master from O or more numbers, corresponding to a number from only one primary number, if the match is successful, it outputs a master number from the number, if the match is unsuccessful, the output of a new primary number; number calling device to call number by the primary number sequence and allocating resources; primary number and the slave number from the shared resource; the operation conditions of storage devices for storing and queuing application No information.

[0017] 所述系统还包括显示设备,用于显示排队号轮到情况,以及各主号的属性。 The [0017] system further comprises a display device for displaying the situation, and an attribute of each primary turn number queue number.

[0018] 所述申请条件为人、事、物、时间、地点、组织和事件中的任何一个或多个要素的任意组合。 [0018] Applicant is a human, and things, time, location, organization, and any combination of any of a plurality of events or elements.

[0019] 本发明的明显进步是,为可共享资源实现共享,为社会节约资源;因为资源利用更充分,所以排队的客户更快分配得到资源,为共享资源的客户节约了消费资源的成本。 [0019] significant progress in the present invention is implemented as a shared resource sharing, saving resources for society; because resources are more fully utilized, so queuing customers get faster allocation of resources, sharing of resources for our customers save the cost of consumption of resources.

附图说明 BRIEF DESCRIPTION

[0020] 下面参照附图结合实施例对本发明作进一步的说明。 [0020] The following embodiments with reference to the accompanying drawings in conjunction with embodiments of the present invention will be further described.

[0021 ] 图1为本发明实施例的方法流程图。 Method [0021] FIG. 1 is a flowchart of an embodiment of the present invention.

[0022] 图2为本发明实施例的结构示意图。 [0022] Fig 2 a schematic view of the structure of an embodiment of the present invention.

[0023] 图3为主号和从号示意图。 [0023] Figure 3 a schematic view of the main number and the number.

具体实施方式 detailed description

[0024] 下面对本发明的具体实施方式作更具体的描述。 [0024] The following specific embodiments of the present invention will be described more specifically. 应该注意,以下描述是为了更清楚说明本发明,不是为了限制本发明。 It should be noted that the following description is intended to more clearly illustrate the invention, not to limit the invention.

[0025] 如图1所示,步骤1,通过客户终端输入申请,客户终端可以在远程,可以在排队现场;申请条件可以预先设定范围,客户按预先设定的条件范围输入条件。 [0025] 1, step 1, an input terminal application client, the client may be a remote terminal, the field may be queued; application conditions may be preset range, the range of conditions previously set by the customer input condition.

[0026] 步骤2,对步骤I输入的申请作撮合,预先设定阈值Y,假定匹配度为P,若P〉= Y为撮合成功,否则不成功;排队号分为主号和从号,主号为顺序号或对应顺序号,从号为主号的从属号码,一个主号可以对应O或多个从号,一个从号只对应一个主号,如图3所不;每个主号都有本身的一些属性,每输出一个新的主号,公开显示这些属性;假设申请的条件分别为X1、X2......XN,各个主号的属性为S1、S2......SN,则P为申请条件和主号属性的函数,表示为:P = f (XI,X2......XN, SI, S2......SN)。 [0026] Step 2, the application step as I entered match, a predetermined threshold value Y, assumed matching degree is P, if P> = Y is a successful match, or else unsuccessful; line number and the number divided into the main number, sequence number is a primary number or a corresponding sequence number, the main number is the slave number, the main number may correspond to a plurality of slave O or numbers from a number corresponding to only a primary number, are not shown in Figure 3; each primary number itself has some attributes, each output of a new primary number, to display the properties disclosed; assumptions apply conditions are X1, X2 ...... XN, the main number of attributes of each S1, S2 .... ..SN, P as a function of the application conditions and the properties of the main number, expressed as: P = f (XI, X2 ...... XN, SI, S2 ...... SN).

[0027] 步骤3,按撮合结果输出排队号,若撮合成功,输出某个主号的从号,若匹配度P大于阈值Y的主号有多个,输出匹配度最大的一个;若撮合不成功,输出一个新的主号。 [0027] Step 3, by matching result output line numbers, if the match is successful, the output from a number of the primary number, if the matching degree is greater than the threshold value P Y plurality of primary number, the maximum output of a matching degree; if no match success, output a new primary number.

[0028] 举个例说明步骤3和4。 [0028] For Example 3 and 4 illustrate steps. 假设预设阈值为1,有个男用户申请的时间条件为9点至10点,地点为北京故宫博物馆,可共享资源的人员为异性,因撮合不成功,系统为他输出一个主号M ;该主号的相关属性如下,男用户,属性SI,时间属性S2,地点属性S3,共享资源的人员属性S4 ;后来有个女用户申请的时间条件9点至10点,用户本身性别属性作为申请条件,记为XI,时间条件记为X2,地点为故宫博物馆,条件记为X3,可共享资源的人员为异性,条件记为X4,通过撮合,计算出匹配度P等于1,则本次撮合成功,为该女用户输出主号M的从号。 Suppose a preset threshold value, a time condition Male filed 9:00 to 10:00, based in Beijing Palace Museum, personnel resources can be shared as the opposite sex, because of unsuccessful match, the output of a system for his primary number M; related attributes of the main number below, Male, attributes the SI, time attribute S2, place attribute S3, shared resource person attribute S4; later time condition a woman user application 9:00 to 10:00, the user's own gender attribute as the application conditions, referred to as XI, time condition referred to as X2, location for Palace Museum, the condition referred to as X3, resources can be shared by a person of the opposite sex, the condition referred to as X4, by matching calculated matching degree P is equal to 1, then this match success, output from the main number M number for female users.

[0029] 步骤4,按排队号中的主号顺序分配资源。 [0029] Step 4, the allocation of resources by the primary number sequence number in the queue. 主号顺序和传统的排队号顺序类似,如当前轮到分配资源的号码为2,则下一个轮到号码为3,再下一个为4。 The main number sequence and the sequence number similar to the conventional line, allocation of resources such as the current turn number is 2, the number of the next turn 3, then the next four.

[0030] 步骤5,主号和所属从号共享资源。 [0030] Step 5, the main number and the associated number from the shared resource.

[0031] 如图2所示,本发明的系统客户终端1、控制器2、存储设备3、叫号设备4、和显示设备5,客户终端I接受输入申请,控制器2根据申请条件,对所述申请作撮合;按撮合结果输出排队号,具体是,所述排队号分为主号和从号,主号为顺序号或对应顺序号,从号为主号的从属号码,一个主号可以对应O或多个从号,一个从号只对应一个主号,若撮合成功,输出某个主号的从号,若撮合不成功,输出一个新的主号;叫号设备4按主号顺序叫号并分配资源;主号和从属从号共享资源;所术存储设备3用于存储申请条件和排队号信息。 [0031] As shown, the system of the present invention, the client terminal 12, the controller 2, the storage device 3, device 4 call number, and the display device 5, the client application receives an input terminal I, the controller 2 according to the application conditions, the application for the match; match result output by the line number, in particular, the number and line number from the main sub-number, the main number is the sequence number or sequence number corresponding to the slave number from the number-based numbers, a main number O may correspond to one or more numbers from a number corresponding to the number of only one master, if the match is successful, the output from a number of the primary number, if the match is unsuccessful, the output of a new primary number; called No. 4 press device main number call number and order of the allocation of resources; primary number and the slave number from the shared resource; the operation storage device 3 for storing application conditions and queuing number information. 显示设备5,用于显示排队号轮到情况,以及各主号的属性,每输出一个主号,该主号的相关属性可以通过显示设备5显示出来。 A display device 5 for displaying the queuing number turn, the number and an attribute of each primary, each primary output a number associated properties of the primary number may be displayed by the display device 5.

[0032] 图3为主号和从号示意图,图中主号分别为1、2......N,每个主号对应三个从号,主号I的从号分别是la、lb、lc,主号2的从号分别为2a、2b、2c。 [0032] FIG. 3 as a main number and a number from the schematic, FIG main numbers are 1,2 ...... N, each corresponding to the main number from the number three, the main number are numbers from I La, lb, lc, respectively, the main number from 2 to No. 2a, 2b, 2c. 在撮合时,假如号码N已经被叫号,且已经分配到资源,则不管号码N的从号是否已被撮合成功,都不再参与撮合;比如2已经被叫号并分配资源,且从号2a撮合成功分配出去,但2b、2c未被分配出去,则拿到排队号为2和2a的客户共享资源。 When the match, if the number N has been called number, and has been assigned to a resource, regardless of whether the number N of the number has been successfully match, matching are no longer involved; example 2 has called number and allocation of resources, and the number 2a match successfully allocated out, but 2b, 2c has not been assigned to go out, then line up to get the number 2 and 2a of customers to share resources.

[0033] 对实施例可以适当变通,仍属于权利要求保护范围,比如图3,还可以这样应用:la、2a为主号,lb、lc,2b、2c为从号,la、2a分配的排队号分别为1、2,或分配的排队号分别为Κ+1、Κ+2,按排队号的顺序分配资源;其中K为大于O的正数。 [0033] The embodiment can appropriately flexible, is still scope of the claims, such as in FIG. 3, this can also be applied: la, 2a mainly number, lb, lc, 2b, 2c from the number, la, 2a allocated queuing No. 2, respectively, or queuing numbers assigned respectively Κ + 1, Κ + 2, the allocation of resources in the order of line numbers; wherein K is a positive number greater than O is.

[0034] 实施例的应用场景1:目前首都机场出口,旅客等的士的排队区域,由护栏围着成'S'形状,乘客拿着行李,在S形状的区间排队,排上一两个小时是常有的,这让乘客觉得疲劳,舒适度极差,而且难于拼车,不够节能环保。 [0034] Application Example scenario 1: the current area of ​​the airport exit line, like passenger taxis, surrounded by the fence into a 'S' shape, carrying luggage of passengers, in the section S-shaped line, twelve hours rafts It is common, which makes passengers feel fatigue, poor comfort, but also difficult to carpool, inadequate saving and environmental protection. 该情景许多人熟视无睹,本申请人建议把传统的排队方法加以改进,以号代站,并应用于该场景。 Many blind to the scenario, the present applicant proposes to improve the conventional queuing method for generation of station number, and applied to the scene. 具体是:建可以供乘客休息的大厅,采用上述排队方法,乘客进入大厅取号,然后可以休息,被叫号时,坐上目标出租车。 Specifically: building passenger can rest for lobby queue using the above method, take a number of passengers entering the hall, then rest, the called party number, the target get taxi.

[0035] 上述排队方法在该应用场景,可称为'用于拼车的排队方法',具体包括以下步骤: [0035] In the above-described method of queuing application scenario, it may be referred to as 'the ride for queuing', includes the following steps:

[0036] A10、输入申请,申请条件包括目的地; [0036] A10, input applications for conditions including a destination;

[0037] B10、对申请进行撮合; [0037] B10, the application will be match;

[0038] C1、按撮合结果输出排队号,具体是,所述排队号分为主号和从号,主号为顺序号或对应顺序号,从号为主号的从属号码,一个主号可以对应O或多个从号,一个从号只对应一个主号,若撮合成功,输出某个主号的从号,若撮合不成功,输出一个新的主号; [0038] C1, matching result output by the line number, in particular, the number and line number from the main sub-number, the main number is the sequence number or sequence number corresponding to the slave number from the number-based numbers, a main number can O from the corresponding one or more numbers from a number corresponding to only a primary number, if the match is successful, the output from a number of the primary number, if the match is unsuccessful, a new master output signal;

[0039] D10、按主号顺序分配出租车; [0039] D10, the main number sequence assigned by the taxi;

[0040] ElO、主号和所属从号对应的乘客同乘一辆出租车。 [0040] ElO, the main number and your passengers from a number corresponding with a taxi ride.

[0041] 实施例的应用场景2:—个地方特色小吃,生意兴隆,但老板为了保持地道口味不愿扩大生产,只拥有有限的厨师和炊具,以及几道特色菜,许多客人来这里就餐需要排队。 [0041] Example 2 scenarios: - local snacks, business is booming, but the boss in order to maintain the authentic taste reluctant to expand production, has only a limited chefs and cooking utensils, as well as a few specialties, many guests come and eat here needs queue. 实施例的排队方法应用到本应用场景,包括以下步骤: Queuing method of the present embodiment is applied to the application scenario, comprising the steps of:

[0042] A10、输入申请,申请条件包括菜名、数量; [0042] A10, input application, including application requirements dish, number;

[0043] B10、对申请进行撮合; [0043] B10, the application will be match;

[0044] C1、按撮合结果输出排队号,具体是,所述排队号分为主号和从号,主号为顺序号或对应顺序号,从号为主号的从属号码,一个主号可以对应O或多个从号,一个从号只对应一个主号,若撮合成功,输出某个主号的从号,若撮合不成功,输出一个新的主号; [0044] C1, matching result output by the line number, in particular, the number and line number from the main sub-number, the main number is the sequence number or sequence number corresponding to the slave number from the number-based numbers, a main number can O from the corresponding one or more numbers from a number corresponding to only a primary number, if the match is successful, the output from a number of the primary number, if the match is unsuccessful, a new master output signal;

[0045] D10、厨师按主号顺序用炊具做菜; [0045] D10, cooks according to cooking utensils with a main number sequence;

[0046] E10、主号和所属从号对应的客人分享同一批次做出来的菜。 [0046] E10, the main share belongs to the same batch number, and made out of vegetables from the corresponding number of guests.

Claims (10)

  1. 1.一种可资源共享的排队方法,其特征在于,包括以下步骤: A、输入申请; B、对申请进行撮合; C、按撮合结果输出排队号,具体是,所述排队号分为主号和从号,主号为顺序号,从号为主号的从属号码,一个主号可以对应O或多个从号,一个从号只对应一个主号,若撮合成功,输出某个主号的从号,若撮合不成功,输出一个新的主号; D、按主号顺序分配资源; E、主号和所属从号共享资源。 1. A method of resource sharing queuing, characterized by comprising the steps of: A, input application; B, the application will be match; C, according to the match result output line number, in particular, the number line divided into a main number and the number, the main number is the sequence number of the slave number from the number-based numbers, the numbers may correspond to a master from O or more numbers, corresponding to a number from only one primary number, if the match is successful, outputs a main number , if the match is unsuccessful, a new master output numbers from number; D, allocation of resources by the main number sequence; E, the main number and the associated number from the shared resource.
  2. 2.如权利要求1所述的一种可资源共享的排队方法,其特征在于: 步骤A、B所述申请,其申请条件为人、事、物、时间、地点、组织和事件中的任何一个或多个要素的任意组合。 2. The method of claim 1 queuing A resource sharing claim, wherein: steps A, B of the application, the application conditions of a human, any and things, time, places, organizations and events or any combination of a plurality of elements.
  3. 3.如权利要求1所述的一种可资源共享的排队方法,其特征在于: 每输出一个主号,公开该主号相关的一些属性。 A resource queuing method according to claim 1 sharing, wherein: each output a primary number, Publication No. Some of the main properties associated.
  4. 4.如权利要求1所述的一种可资源共享的排队方法,其特征在于: 步骤C所述撮合的方法如下:预先设定阈值Y,假定匹配度为P,若P〉= Y为撮合成功,否则不成功;申请的条件分别为X1、X2......XN,各个主号的属性为S1、S2......SN,P为申请条件和主号属性的函数,P = f(Xl, X2......XN, SI, S2......SN)。 4. The method of claim 1 queuing A resource sharing claim, characterized in that: the method step C match as follows: a predetermined threshold value Y, assumed matching degree is P, if P> = Y is a match successful, or unsuccessful; application conditions are X1, X2 ...... XN, the main number of attributes of each S1, S2 ...... SN, P is the main function of the application conditions and the number of attributes, P = f (Xl, X2 ...... XN, SI, S2 ...... SN).
  5. 5.如权利要求1所述的一种可资源共享的排队方法,其特征在于: 步骤D所述按主号顺序分配的资源包括各种实物、人力资源、信息资源、空间、时间,也包括及由各种实物、人力资源、信息资源、空间、时间所产生的服务。 5. The method of claim 1 queuing A resource sharing claim, wherein: said resource allocation of D by the main number sequence of steps including various objects, human resources, information resources, space and time, comprising and from a variety of physical, human resources, information resources, space and time generated service.
  6. 6.一种可资源共享的排队系统,其特征在于包括: 客户终端、控制器、存储设备、叫号设备,客户终端接受申请,控制器根据申请条件,对所述申请作撮合;按撮合结果输出排队号,具体是,所述排队号分为主号和从号,主号为顺序号,从号为主号的从属号码,一个主号可以对应O或多个从号,一个从号只对应一个主号,若撮合成功,输出某个主号的从号,若撮合不成功,输出一个新的主号;叫号设备按主号顺序叫号并分配资源;主号和从属从号共享资源;所术存储设备用于存储申请条件和排队号信息。 6. A resource sharing queuing system, comprising: a client terminal, a controller, a storage device, called the device number, the client application receiving terminal, the controller according to the application conditions for the application of the match; by match results output line number, in particular, the number and line number from the main sub-number, the main number is the sequence number, the main number from the number of the slave number, the main number may correspond to a plurality of O or numbers from a number only from a main number corresponding to, if the match is successful, the output from a number of the primary number, if the match is unsuccessful, the output of a new primary number; number calling device to call number by the primary number sequence and allocating resources; primary number and the number of slave shared resources; the operation conditions of storage devices for storing and queuing number request information.
  7. 7.如权利要求6所述的一种可资源共享的排队系统,其特征在于: 所述系统还包括显示设备,用于显示排队号轮到情况,以及各主号的属性。 7. The resource sharing 6 A queuing system as claimed in claim, characterized in that: said system further comprises a display device for displaying the situation, and an attribute of each primary turn number queue number.
  8. 8.如权利要求6所述的一种可资源共享的排队系统,其特征在于: 所述申请条件为人、事、物、时间、地点、组织和事件中的任何一个或多个要素的任意组口ο 8. The resource sharing 6 A queuing system as claimed in claim, wherein: said condition human application, any set and things, time, place, event organization and any one or more elements mouth ο
  9. 9.如权利要求6所述的一种可资源共享的排队系统,其特征在于:撮合的方法如下:预先设定阈值Y,假定匹配度为P,若P〉= Y为撮合成功,否则不成功;申请的条件分别为X1、X2......XN,各个主号的属性为S1、S2......SN, P为申请条件和主号属性的函数,P =f (X1,X2......XN, SI, S2......SN)。 9. The resource sharing 6 A queuing system as claimed in claim, wherein: matching method as follows: a predetermined threshold value Y, assumed matching degree is P, if P> = Y is a successful match, or not successful; application conditions are X1, X2 ...... XN, the main number of attributes of each S1, S2 ...... SN, P is a function of the application conditions and properties of the main number, P = f ( X1, X2 ...... XN, SI, S2 ...... SN).
  10. 10.一种用于拼车的排队方法,其特征在于包括以下步骤: A10、输入申请,申请条件包括目的地; B10、对申请进行撮合; C1、按撮合结果输出排队号,具体是,所述排队号分为主号和从号,主号为顺序号或对应顺序号,从号为主号的从属号码,一个主号可以对应O或多个从号,一个从号只对应一个主号,若撮合成功,输出某个主号的从号,若撮合不成功,输出一个新的主号; D10、按主号顺序分配出租车; ElO、主号和所属从号对应的乘客同乘一辆出租车。 10. A queuing method for the ride, comprising the steps of: A10, input applications for conditions including a destination; BlO, the application will be match; a C1, matching result output by the line number, in particular, the sub-line number and the number-based numbers, the main number is the sequence number or a corresponding sequence number, the main number is the slave number, the main number may correspond to a plurality of O or numbers from a number corresponding to the number of only one master, If the match is successful, the output from the number one main number, if the match is not successful, the output of a new main number; D10, distribution taxis main number sequence; ElO, belongs to the main number and the corresponding number of passengers from a passenger taxi.
CN 201410626442 2013-11-09 2014-11-08 Resource-sharing queuing method and resource-sharing queuing system CN104392532A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201310552584 2013-11-09
CN 201410626442 CN104392532A (en) 2013-11-09 2014-11-08 Resource-sharing queuing method and resource-sharing queuing system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201410626442 CN104392532A (en) 2013-11-09 2014-11-08 Resource-sharing queuing method and resource-sharing queuing system

Publications (1)

Publication Number Publication Date
CN104392532A true true CN104392532A (en) 2015-03-04

Family

ID=52610430

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201410626442 CN104392532A (en) 2013-11-09 2014-11-08 Resource-sharing queuing method and resource-sharing queuing system

Country Status (1)

Country Link
CN (1) CN104392532A (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010037174A1 (en) * 2000-04-04 2001-11-01 Dickerson Stephen L. Communications and computing based urban transit system
CN101295389A (en) * 2007-04-25 2008-10-29 磊 周 Order generating and processing method of commercial articles ordering system
CN102903046A (en) * 2011-07-25 2013-01-30 上海博路信息技术有限公司 Real-time car pooling system for mobile terminal

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010037174A1 (en) * 2000-04-04 2001-11-01 Dickerson Stephen L. Communications and computing based urban transit system
CN101295389A (en) * 2007-04-25 2008-10-29 磊 周 Order generating and processing method of commercial articles ordering system
CN102903046A (en) * 2011-07-25 2013-01-30 上海博路信息技术有限公司 Real-time car pooling system for mobile terminal

Similar Documents

Publication Publication Date Title
Eckhardt et al. Cultural paradoxes reflected in brand meaning: McDonald’s in Shanghai, China
Wei How Wearables Intersect with the Cloud and the Internet of Things: Considerations for the developers of wearables.
Andersen et al. Nonverbal communication across cultures
Veijola et al. The body in tourism industry
Kay Hoang Economies of emotion, familiarity, fantasy, and desire: Emotional labor in Ho Chi Minh City’s sex industry
US20130248652A1 (en) Integrated aircraft galley and appliance operating system
Fahim et al. Daily life activity tracking application for smart homes using android smartphone
US20160335686A1 (en) Real-time customer experience management systems and methods
US20090196123A1 (en) Collaborative Appointment and Reminder System
CN101963979A (en) Cloud computing-based search suggestion providing method and equipment
US20140074536A1 (en) Meetings and Events Coordinating System and Method
Baecker et al. Technology to reduce social isolation and loneliness
Alves Lino et al. Responsive environments: User experiences for ambient intelligence
CN101854739A (en) Personal Internet of things system
Sani et al. Controlling the number of HIV infectives in a mobile population
Stacciarini et al. Group therapy as treatment for depressed Latino women: A review of the literature
Sharman et al. “We only own the hours”: Discontinuity of care in the British Columbia home support system
Hjorthol Gendered aspects of time related to everyday journeys
Whittaker et al. Perceptions of an ‘international hospital’in Thailand by medical travel patients: Cross-cultural tensions in a transnational space
Harrison Accommodating the new economy: The SANE space environment model
Fiss Design in a global context: Envisioning postcolonial and transnational possibilities
Friesen The evolution of ‘Indian’identity and transnationalism in New Zealand
Haas et al. Fatherhood and social policy in Scandinavia
Giráldez et al. 14 The role of Ambient Intelligence in the Social Integration of the Elderly
US20160183687A1 (en) System architecture for office productivity structure communications

Legal Events

Date Code Title Description
C06 Publication
C10 Entry into substantive examination