CN104392532A - Resource-sharing queuing method and resource-sharing queuing system - Google Patents
Resource-sharing queuing method and resource-sharing queuing system Download PDFInfo
- Publication number
- CN104392532A CN104392532A CN201410626442.7A CN201410626442A CN104392532A CN 104392532 A CN104392532 A CN 104392532A CN 201410626442 A CN201410626442 A CN 201410626442A CN 104392532 A CN104392532 A CN 104392532A
- Authority
- CN
- China
- Prior art keywords
- master
- main
- resource
- queuing
- application
- 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
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
Technical field
The present invention relates to queuing field, particularly a kind of can the queuing strategy of resource sharing and system.
Background technology
Queuing is that queuing system solves and substitutes the queueing form of manually standing in line with queue number, greatly facilitates people's daily life in order to solve the disorderly competition of people to resource.Wherein resource comprises tangible material object, human resources, information resources, space, time etc., and by the service produced based on material object, human resources, information resources, space, time etc.But traditional queuing strategy and system, when only adapting to resource or serve distribution, a client's is exclusive, and certain client applies for a queue number, and the resource that this queue number is corresponding or service are exclusively enjoyed by him, and other clients cannot share by active participate.And in the middle of reality, time many, resource or service can be shared, advocating thriftiness now especially, energy-conserving and environment-protective become a fundamental state policy, resource sharing, improve resource utilization, seem particularly important.
Summary of the invention
For solving above-mentioned technological deficiency, the invention provides a kind of can the queuing strategy of resource sharing.
For achieving the above object, what this programme provided can the queuing strategy of resource sharing, comprises the following steps:
A, input application;
B, application to be brought together;
C, by brining result output queue number together, specifically, described queue number be divided into main number and from number, main number be serial number or corresponding serial number, from number being the subordinate number to lead number, master number can corresponding 0 or multiple from number, one from a number only corresponding master number, if bring together successfully, export certain main number from number, if bring together unsuccessful, export a new master number;
D, press master's order-assigned resource;
E, main number and affiliated from a number shared resource.
Apply for described in steps A, B, the combination in any of any one or more key elements in its application condition behaviour, thing, thing, time, place, tissue and event.
The queue number that step C exports may be main number, also may be from number.For from number queue number itself do not participate in sequence, also cannot be assigned with resource.From number enjoying the order dependent of resource in the master number of institute's subordinate.
Further, often export a master number, disclose this master number some relevant attributes.These attributes partly or all generate according to application condition.These attributes can as the condition brought together mutually with the application inputted afterwards.
The described method brought together is as follows: preset threshold value Y, assuming that matching degree is P, if P>=Y is for brining together successfully, otherwise unsuccessful; The condition of application is respectively X1, X2......XN, and each attribute of main number is S1, S2......SN, and P is the function of application condition and master's attribute, P=f (X1, X2......XN, S1, S2......SN).If brining successfully master number together has multiple, get one that matching degree is maximum.If brining successfully master number together has multiple, and matching degree is the same, can appoint and get one of them.
The resource of the described master's of pressing order-assigned comprises various material object, human resources, information resources, space, time, the service also comprising and produced by various material object, human resources, information resources, space, time.
For realizing method of the present invention, the present invention also provide a kind of can the queuing system of resource sharing, comprising:
Client terminal, controller, memory device, equipment of calling out the numbers, client terminal is accepted applications, and controller, according to application condition, is brought together described application; By brining result output queue number together, specifically, described queue number be divided into main number and from number, main number be serial number, from number being the subordinate number to lead number, master number can corresponding 0 or multiple from number, one from a number only corresponding master number, if bring together successfully, export certain main number from number, if bring together unsuccessful, export a new master number; The equipment of calling out the numbers is pressed master's order and is called out the numbers and Resources allocation; Main number and subordinate are from a number shared resource; Institute's art memory device is for storing application condition and queue number information.
Described system also comprises display device, takes turns to situation for showing queue number, and the attribute of each master number.
The combination in any of any one or more key elements in described application condition behaviour, thing, thing, time, place, tissue and event.
Obvious progress of the present invention is, for shareable resource realizes sharing, for society economizes on resources; Because the utilization of resources is more abundant, so the client queued up distributes sooner obtain resource, the client for shared resource has saved the cost of consumption resources.
Accompanying drawing explanation
The present invention is further illustrated in conjunction with the embodiments with reference to the accompanying drawings.
Fig. 1 is the method flow diagram of the embodiment of the present invention.
Fig. 2 is the structural representation of the embodiment of the present invention.
Fig. 3 is main number and from a number schematic diagram.
Embodiment
Below the specific embodiment of the present invention is described more specifically.It should be noted that following description is to more clearly demonstrate the present invention, is not to limit the present invention.
As shown in Figure 1, step 1, by client terminal input application, client terminal can long-range, can be on-the-spot in queuing; Application condition can preset scope, and client is by the condition and range initial conditions preset.
Step 2, brings together the application that step 1 inputs, presets threshold value Y, assuming that matching degree is P, if P>=Y is for brining together successfully, otherwise unsuccessful; Queue number be divided into main number and from number, main number be serial number or corresponding serial number, from the subordinate number number being main number, master number can corresponding 0 or multiple from number, one from a number only correspondence master number, as shown in Figure 3; Each master number has some own attributes, and the master number that often output one is new, openly shows these attributes; Suppose that the condition of applying for is respectively X1, X2......XN, each attribute of main number is S1, S2......SN, then P is the function of application condition and master's attribute, is expressed as: P=f (X1, X2......XN, S1, S2......SN).
Step 3, by brining result output queue number together, if bring together successfully, export certain main number from number, if the master number that matching degree P is greater than threshold value Y has multiple, maximum one of output matching degree; If bring together unsuccessful, export a new master number.
To give an example bright step 3 and 4.Suppose that predetermined threshold value is 1, the time conditions having the application of a men's family is 9 o'clock to 10 o'clock, and place is Beijing's Imperial Palace museum, and the personnel of shareable resource be different in nature, unsuccessful because brining together, and system is for he exports a master M; This association attributes of main number is as follows, men's family, attribute S1, time attribute S2, site attribute S3, personnel's attribute S4 of shared resource; There were a time conditions of lady's family application 9 o'clock to 10 o'clock afterwards, the sex attribute of user own is as application condition, and be designated as X1, time conditions is designated as X2, place is Palace Museum, condition is designated as X3, and the personnel of shareable resource are the opposite sex, and condition is designated as X4, by brining together, calculate matching degree P and equal 1, then this brings together successfully, for this lady's family export master M from number.
Step 4, by the master's order-assigned resource in queue number.Master's order and traditional queue number order similar, the number taking turns to Resources allocation as current is 2, then the next one takes turns to number is 3, then the next one is 4.
Step 5, main number with affiliated from a number shared resource.
As shown in Figure 2, system users terminal 1 of the present invention, controller 2, memory device 3, call out the numbers equipment 4 and display device 5, client terminal 1 accepts input application, and controller 2, according to application condition, is brought together described application; By brining result output queue number together, specifically, described queue number be divided into main number and from number, main number be serial number or corresponding serial number, from number being the subordinate number to lead number, master number can corresponding 0 or multiple from number, one from a number only corresponding master number, if bring together successfully, export certain main number from number, if bring together unsuccessful, export a new master number; Equipment 4 of calling out the numbers is pressed master's order and is called out the numbers and Resources allocation; Main number and subordinate are from a number shared resource; Institute's art memory device 3 is for storing application condition and queue number information.Display device 5, takes turns to situation for showing queue number, and the attribute of each master number, often exports a master number, and the association attributes of this master number can be shown by display device 5.
Fig. 3 is main number and from a number schematic diagram, and in figure, main number is respectively 1,2 ... N, each master's correspondence three from number, main number 1 from number being 1a, 1b, 1c respectively, main number 2 from number being respectively 2a, 2b, 2c.When brining together, if number N called number, and be assigned to resource, then no matter number N from number whether being brought together successfully, all no longer participate in brining together; Such as 2 called number Resources allocation, and bring together from a number 2a and successfully dispense, but 2b, 2c are not assigned with away, then take client's shared resource that queue number is 2 and 2a.
Can appropriate adaptation to embodiment, still belong to claims, such as Fig. 3, can also apply like this: 1a, 2a are main number, 1b, 1c, 2b, 2c be from number, 1a, 2a distribute queue number be respectively 1,2, or the queue number distributed is respectively K+1, K+2, by the order-assigned resource of queue number; Wherein K be greater than 0 positive number.
The application scenarios 1 of embodiment: Capital Airport outlet at present, the queue area of the taxis such as passenger, by guardrail round one-tenth ' S ' shape, passenger holds luggage, queues up, arrange and often have for one or two hour in the interval of S shape, this allows passenger feel tired, comfort level extreme difference, and be difficult to share-car, inadequate energy-conserving and environment-protective.This sight many people turn a blind eye to, and the applicant's suggestion is improved traditional queuing strategy, stands, and be applied to this scene with a number generation.Specifically: build the hall that can be used for passenger to have a rest, adopt above-mentioned queuing strategy, passenger enters the hall number of getting, and then can have a rest, and during called number, takes target taxi.
Above-mentioned queuing strategy, at this application scenarios, can be described as ' queuing strategy for share-car ', specifically comprises the following steps:
A10, input application, application condition comprises destination;
B10, application to be brought together;
C10, by brining result output queue number together, specifically, described queue number be divided into main number and from number, main number be serial number or corresponding serial number, from number being the subordinate number to lead number, master number can corresponding 0 or multiple from number, one from a number only corresponding master number, if bring together successfully, export certain main number from number, if bring together unsuccessful, export a new master number;
D10, press master's order-assigned taxi;
E10, main number and affiliated from number corresponding passenger with taking advantage of a taxi.
Application scenarios 2: one local characteristic snacks of embodiment, boom, but boss is reluctant only to have limited cook and cooker by expanding production in order to retentively road taste, and several roads speciality, many guests come here to have dinner to be needed to queue up.The queuing strategy of embodiment is applied to this application scene, comprises the following steps:
A10, input application, application condition comprises name of the dish, quantity;
B10, application to be brought together;
C10, by brining result output queue number together, specifically, described queue number be divided into main number and from number, main number be serial number or corresponding serial number, from number being the subordinate number to lead number, master number can corresponding 0 or multiple from number, one from a number only corresponding master number, if bring together successfully, export certain main number from number, if bring together unsuccessful, export a new master number;
D10, cook press master's order cooker and cook;
E10, master number share same batch of dish of working it out with affiliated from a number corresponding guest.
Claims (10)
1. can the queuing strategy of resource sharing, it is characterized in that, comprise the following steps:
A, input application;
B, application to be brought together;
C, by brining result output queue number together, specifically, described queue number be divided into main number and from number, main number be serial number, from number being the subordinate number to lead number, master number can corresponding 0 or multiple from number, one from a number only corresponding master number, if bring together successfully, export certain main number from number, if bring together unsuccessful, export a new master number;
D, press master's order-assigned resource;
E, main number and affiliated from a number shared resource.
2. a kind of as claimed in claim 1 can the queuing strategy of resource sharing, it is characterized in that:
Apply for described in steps A, B, the combination in any of any one or more key elements in its application condition behaviour, thing, thing, time, place, tissue and event.
3. a kind of as claimed in claim 1 can the queuing strategy of resource sharing, it is characterized in that:
Often export a master number, disclose this master number some relevant attributes.
4. a kind of as claimed in claim 1 can the queuing strategy of resource sharing, it is characterized in that:
The method brought together described in step C is as follows: preset threshold value Y, assuming that matching degree is P, if P>=Y is for brining together successfully, otherwise unsuccessful; The condition of application is respectively X1, X2......XN, and each attribute of main number is S1, S2......SN, and P is the function of application condition and master's attribute, P=f (X1, X2......XN, S1, S2......SN).
5. a kind of as claimed in claim 1 can the queuing strategy of resource sharing, it is characterized in that:
The resource of pressing master's order-assigned described in step D comprises various material object, human resources, information resources, space, time, the service also comprising and produced by various material object, human resources, information resources, space, time.
6. can the queuing system of resource sharing, it is characterized in that comprising:
Client terminal, controller, memory device, equipment of calling out the numbers, client terminal is accepted applications, and controller, according to application condition, is brought together described application; By brining result output queue number together, specifically, described queue number be divided into main number and from number, main number be serial number, from number being the subordinate number to lead number, master number can corresponding 0 or multiple from number, one from a number only corresponding master number, if bring together successfully, export certain main number from number, if bring together unsuccessful, export a new master number; The equipment of calling out the numbers is pressed master's order and is called out the numbers and Resources allocation; Main number and subordinate are from a number shared resource; Institute's art memory device is for storing application condition and queue number information.
7. a kind of as claimed in claim 6 can the queuing system of resource sharing, it is characterized in that:
Described system also comprises display device, takes turns to situation for showing queue number, and the attribute of each master number.
8. a kind of as claimed in claim 6 can the queuing system of resource sharing, it is characterized in that:
The combination in any of any one or more key elements in described application condition behaviour, thing, thing, time, place, tissue and event.
9. a kind of as claimed in claim 6 can the queuing system of resource sharing, it is characterized in that: the method brought together is as follows: preset threshold value Y, assuming that matching degree is P, if P>=Y is for brining together successfully, otherwise unsuccessful; The condition of application is respectively X1, X2......XN, and each attribute of main number is S1, S2......SN, and P is the function of application condition and master's attribute, P=f (X1, X2......XN, S1, S2......SN).
10., for a queuing strategy for share-car, it is characterized in that comprising the following steps:
A10, input application, application condition comprises destination;
B10, application to be brought together;
C10, by brining result output queue number together, specifically, described queue number be divided into main number and from number, main number be serial number or corresponding serial number, from number being the subordinate number to lead number, master number can corresponding 0 or multiple from number, one from a number only corresponding master number, if bring together successfully, export certain main number from number, if bring together unsuccessful, export a new master number;
D10, press master's order-assigned taxi;
E10, main number and affiliated from number corresponding passenger with taking advantage of a taxi.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410626442.7A CN104392532A (en) | 2013-11-09 | 2014-11-08 | Resource-sharing queuing method and resource-sharing queuing system |
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013105525849 | 2013-11-09 | ||
| CN201310552584 | 2013-11-09 | ||
| CN201410626442.7A 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 CN104392532A (en) | 2015-03-04 |
Family
ID=52610430
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410626442.7A Pending 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)
| 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 |
-
2014
- 2014-11-08 CN CN201410626442.7A patent/CN104392532A/en active Pending
Patent Citations (3)
| 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 |
|---|---|---|
| JP6105127B2 (en) | Server, program, and server control method | |
| JP2016174927A5 (en) | ||
| CN105518620B (en) | A kind of network card configuration method and resource management center | |
| JP2015178013A5 (en) | ||
| CN104584007B (en) | Message processing device, information processing method and program | |
| WO2014068960A1 (en) | Server, game control method, and program | |
| CN102882764A (en) | Method for implementing cloud calendar on intelligent Internet of things platform | |
| CN106790332B (en) | Resource scheduling method, system and main node | |
| CN105847398A (en) | Business scheduling method, scheduling server and business server | |
| US20100299618A1 (en) | Method of managing a set of virtual environment control entities, device, and corresponding computer program product | |
| CN104348751B (en) | Virtual output queue authorization management method and device | |
| CN109639750A (en) | Business data processing method and equipment | |
| CN104200557A (en) | System and method for realizing intelligent number taking by using handheld equipment | |
| CN103929441A (en) | Task allocation method and device | |
| CN105791371A (en) | Cloud storage service system and method | |
| CN103580887B (en) | Client, upgrade method and system | |
| CN105426250A (en) | Resource management method and apparatus | |
| CN104202305A (en) | Transcoding processing method and device, server | |
| CN104392532A (en) | Resource-sharing queuing method and resource-sharing queuing system | |
| CN103930179A (en) | Information processing system | |
| CN201230319Y (en) | Wireless communication network refrigerator | |
| CN109729113A (en) | Manage method, server system and the computer program product of dedicated processes resource | |
| CN105374100A (en) | Car-pooling method and system | |
| CN104408561A (en) | Job-station based order distributing method | |
| CN106952382A (en) | A kind of number takes rear user's supplement queuing strategy and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20150304 |