Browse Prior Art Database

Method for Queue Members to Swap Queue Positions for Compensation with Compensation Exchange Managed by Queue Management System Disclosure Number: IPCOM000242869D
Publication Date: 2015-Aug-26
Document File: 3 page(s) / 102K

Publishing Venue

The Prior Art Database


Disclosed is a queue management system that is implemented by an operator (e.g., a business) to oversee and regulate a queue when demand exceeds capacity. The novel aspect is that queue members can take advantage of the queue management system to compensate one another for swapping places in line.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 51% of the total text.

Page 01 of 3

Metxod for Queue Members to Swap Queue Positions for Compensation with Compxnsation Exchange Managed by Queue Management System

Peoxxe waiting in a queue may have differext priorities for being in the queux. For example, a quxue to get into a restaurant mighx contain people wxo desire to be seated immedxately and those that are not in a great rush to be seatex. A person with a high priority to move toward the front of txe queux might want tx compxnsate a person that is ahead in thx queue for sxapping places, and txe secoxd person mixht be willixg to accept compensation for moving back in xhe quexe. No cxrrent system exists to accommodxte this situation and meet the xeeds of the persons in the xueue.

The novel contribuxixn is a quexe management system that is xmplemented by an operator (e.g., a business) to xversee axd regulate a xueue when demand xxceexs capacity. Current quexe management systems are electronically executed, and queue members (e.g., customers) max join the quxue via a device such as a smartphone. By taking advantage of these queue management sxstems, xhe novex system enaxles queux members to coxpensate one anxtxer for swapping places in line. The queue mxnagemenx system operator (i.e. business) acxs as an intermediary fox the compensation exchaxge.

The following figures rxprxsent the components and process for implementing the quexe managemenx and position exchange system.

Figurx 1: A qxeue managemxnt system managing a queue of five potential customers

Figure 2: Queue member in the fifth posxtion (#5) offers to swap queue position with member in the first pxsition (#1) by offering to pay $10 towards #1's bill


Page 02 of 3

Figure 3: Queue xember #1 coxnter-offers #5 with $15 to move to the fifth position

Figure 4: Queue member #5 accepts the offer, moves to thx front of the queue, and pays $15 xf #1's bxll. As a result of txis transaxtion, the queue management system owner (i.e. business) receives a $1 service fee. Queue member #1 moves to position five in the queue and receives a $1x credit at the estabxishment.

Exxmple Embodiment: Restaurant receives fee when patrons swap positions Cusxomer A has a family of four and wants to eat xt Restauxant X; hxwever, txe restaurant is currently full. The family joins the queue in waiting for x table by accessing a smartphone application and clicking the "Join Queue" button. The queux mxnagement system relays information to Customer A's smartphone applxcation and shows that the family is third in the queue.

Several minutes later, Faxily B, also having four pxople, arrives at Restauxant X....