WO2018194513A1

WO2018194513A1 - Queue management system and method

Info

Publication number: WO2018194513A1
Application number: PCT/SG2017/050650
Authority: WO
Inventors: Tiong Soon KOH
Original assignee: Lovearth Ecolife Pte. Ltd.
Priority date: 2017-04-17
Filing date: 2017-12-27
Publication date: 2018-10-25

Abstract

The present invention relates to a queue management system and method, and in particular but not exclusively, to a time-based queue management system and method for providing a user with a dynamic and unique time-based queue number, and enabling a user to queue for a product and/or service via a communication device onsite or remote from another location. The queue management system and method enables a user to join a queue without the need to be physically present at the location of a merchant or service provider and also provides a user the opportunity and flexibility to utilise the waiting time in a manner as desired by providing an indicative time of when a user's turn is. The queue management system can also be integrated into a queue-order-pay system, additionally enabling a user to seamlessly place an order for a product and/or service and pay for the desired product and/or service via a communication device onsite or remote from another location.

Description

QUEUE MANAGEMENT SYSTEM AND METHOD

FIELD OF INVENTION

The present invention relates to a queue management system and method, and in particular but not exclusively, to a time-based queue management system and method for providing a user with a dynamic and unique time-based queue number, and enabling a user to queue for a product and/or service via a communication device onsite or remote from another location.

BACKGROUND TO THE INVENTION The following discussion of the background to the invention is intended to facilitate an understanding of the present invention. However, it should be appreciated that the discussion is not an acknowledgment or admission that any of the material referred to was published, known or part of the common general knowledge in any jurisdiction as at the priority date of the application. Conventional queuing systems require consumers to be physically present to wait in lines or join queues. More advanced systems allow consumers or users to obtain a queue number from a queue machine and they will then have to wait for their queue number to be called. With such systems, whilst consumers do not have to physically wait in lines for their turn, they are still required to be around the vicinity of the merchant or service provider to wait for their queue number to be called. Both types of queue systems are time consuming and troublesome for consumers as their physical presence is required to join queues.

Furthermore, such queue systems do not provide an indication of the waiting time or the exact time that a consumer will be served. Thus, consumers will just have to wait in line for their turn to ensure that they do not miss their turn and to prevent re-queueing. The time spent waiting for their turn could be better utilised if their physical presence is not required for joining a queue, and also an indication of when their turn is would provide consumers the opportunity and flexibility to utilise the waiting time in a manner as desired. Therefore, there is an urgent need for a queue management system and method to address the aforementioned disadvantages. The present invention seeks to provide such a system and a method to overcome at least in part some of the aforementioned disadvantages.

SUMMARY OF THE INVENTION Throughout this document, unless otherwise indicated to the contrary, the terms "comprising", "consisting of, and the like, are to be construed as non-exhaustive, or in other words, as meaning "including, but not limited to".

In accordance with a first aspect of the present invention, there is provided a method for queue management, comprising: defining a queue list according to a plurality of pre-determined parameters including queue date, queue time and assign user;

reading a last time key from the queue time where next assign user slot is empty; retrieving requested queue time following an input by a user to join queue or make reservation, and where applicable, providing the number of people who will be joining the user;

initiating allocation of queue number upon processing of parameters comprising requested queue time, last time key and computed time interval;

determining reservation queue number, which is dependent on the requested queue time and next available queue number, whereby the allocated queue number is assigned as the requested queue time if the request queue time is larger; while the reservation queue number is affected by the last time key and computed time interval should the next available queue number be greater;

processing the queue list for arranging and inserting the allocated queue number and user into the queue time and assign user parameters respectively; and

revising the queue number by adapting to both time interval and queue time in the case of delays. Preferably, the method further comprises initiating group ordering through sending of invitations to other users and granting them access as guest users.

Preferably, the queue time or allocated queue number is derived based on the following formula:

Q(t+h)- Q (t) 1 _{v n}_ i . wherein, Q = Calculated Queue Time; t = Current Real Time; L = Last Time Key; h = Time Interval; n = index.

Preferably, the method for queue management can be implemented by a computer.

Preferably, the computer can be one of a computing device and a mobile computing device.

In accordance with a second aspect of the present invention, there is provided a system for queue management, comprising: a backend control unit;

a media unit;

a service provider unit; and

a user unit; wherein the backend control unit, the media unit, the service provider unit and the user unit interconnect via a communication means, and wherein

(i) the backend control unit and the media unit are operable to perform the following:

defining a queue list according to a plurality of pre-determined parameters including queue date, queue time and assign user;

reading a last time key from the queue time where next assign user slot is empty;

retrieving requested queue time following an input by a user to join queue or make reservation, and where applicable, providing the number of people who will be joining the user;

initiating allocation of queue number upon processing of parameters comprising requested queue time, last time key and computed time interval; determining reservation queue number, which is dependent on the requested queue time and next available queue number, whereby the allocated queue number is assigned as the requested queue time if the request queue time is larger; while the reservation queue number is affected by the last time key and computed time interval should the next available queue number be greater;

(ii) the backend control unit, the media unit and the service provider unit are operable to perform the following:

revising the queue number by adapting to both time interval and queue time in the case of delays.

Preferably, the user unit is operable to initiate group ordering through sending of invitations to other users and granting them access as guest users.

Q t+ )- Q (t) l _Vn-n wherein, Q = Calculated Queue Time; t = Current Real Time; L = Last Time Key; h = Time Interval; n = index.

Preferably, the communication means can be one of the Internet, an intranet, a dedicated network and any network suitable for interconnecting the backend control unit, the media unit, the merchant unit and the user unit.

Preferably, each of the media unit, the merchant unit and the user unit is in the form of a communication device.

Preferably, the communication device can be one of a computing device and a mobile computing device.

Preferably, the computing device and/or mobile computing device can be in a form of a mobile phone, tablet, laptop or personal digital assistant. In accordance with a third aspect of the present invention, there is provided a computer program for queue management comprising instructions, which when the program is executed by a computer, cause the computer to carry out the method for queue management, comprising: defining a queue list according to a plurality of pre-determined parameters including queue date, queue time and assign user;

The present invention has at least the following advantages:

1. The present invention computes a (time-based) queue number based on simple moving average and finite difference method which is adapted to both the time interval and queue time. This advantageously allows the queue number to be dynamic, thus allowing "live updates" of queue numbers even in the event of delays.

2. The present invention advantageously allows a consumer or a user to join a queue without the need to be physically present at the location of a merchant or service provider, hence providing a consumer or a user the opportunity and flexibility of utilising the waiting time in a queue in a manner as desired by providing an indicative time of when a user's turn is.

3. The present invention can be integrated into a queue-order-pay system, advantageously allowing a consumer or a user to seamlessly queue, place an order for a desired product and/or service individually or as a group, and pay for the desired product and/or service via a communication device onsite or remote from another location.

Other aspects and advantages of the invention will become apparent to those skilled in the art from a review of the ensuing description, which proceeds with reference to the following illustrative drawings of various embodiments of the invention.

BRIEF DESCRIPTION OF DRAWINGS

The present invention will now be described, by way of illustrative example only, with reference to the accompanying drawings, of which:

FIG. 1 is a schematic diagram of a queue management system in accordance with an embodiment of the present invention;

FIG. 2 is a schematic diagram of some of the features of the queue management system of FIG. 1;

FIG. 3 is a flow diagram of a queuing process of the queue management system of FIG. l ; FIG. 4A illustrates a display of queue numbers based on the queue management system of FIG. 1;

FIG. 4B illustrates a data structure of the queue management system of FIG. 1 and shows that it can be sequential or non- sequential;

FIGS. 5A to 5C illustrate various processes for access into the queue management system of FIG. 1;

FIGS. 6A to 6L illustrate a queueing process of the queue management system of FIG. 1; FIG. 7 is a schematic diagram of the queue management system of FIG. 1 integrated into a queue-order-pay system in accordance with an embodiment of the present invention;

FIGS. 8A and 8B illustrate an ordering process of the queue-order-pay system of FIG. 7;

FIGS. 9A to 9C illustrate a paying process of the queue-order-pay system of FIG. 7;

FIG. 10 illustrates a user interface of the queue-order-pay system of FIG. 7 displayed on a communication device; and

FIG. 11 is a flow diagram of a queue-order-pay system of FIG. 7 in accordance with another embodiment of the present invention.

DETAILED DESCRIPTION

Particular embodiments of the present invention will now be described with reference to the accompanying drawings. The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the scope of the present invention. Additionally, unless defined otherwise, all technical and scientific terms used herein have the same meanings as commonly understood by one of ordinary skill in the art to which this invention belongs.

The use of the singular forms "a", an", and "the" include both singular and plural referents unless the context clearly indicates otherwise.

The use of "or", "/" means "and/or" unless stated otherwise. Furthermore, the use of the terms "including" and "having" as well as other forms of those terms, such as "includes", "included", "has", and "have" are not limiting.

The use of "last time key" as used herein refers to the latest time slot that is taken in a queue.

The use of "assign user" as used herein refers to the user who has been assigned to a particular booking/slot in the queue status.

The recitation of numerical ranges by endpoint includes all numbers and fractions subsumed within the respective ranges, as well as the recited endpoints. With reference to Figures 1 to 6, there is described a queue management system and method for a consumer or a user to queue for a product and/or service via a communication device onsite or remote from another location. Advantageously, the queue management system and method is a time -based queue management system and method which allows a user to join a queue without the need to be physically present onsite at the location of a merchant or service provider, and also provides a user the opportunity and flexibility of utilising the waiting time in a queue in a manner as desired by providing an indicative time of when a user's turn is.

Figure 1 shows a schematic diagram of a queue management system 10 in accordance with an embodiment of the present invention. The system 10 comprises a backend control unit (not shown), a media unit 12, a merchant/service provider unit 14 (hereinafter known as "merchant unit") and a customer or a user unit 16. The backend control unit can be hosted on cloud 18 and can be accessed by an administrator of the system 10 for management and maintenance of the system 10. The backend control unit comprises one or more modules for controlling and managing the media unit 12, the merchant/service provider unit 14 and the user unit 16. The merchant unit 14 enables a merchant/service provider to view a queue list, and where the merchant/service provider is in the food and beverage sector or industry, the merchant/service provider can advantageously utilise the information on the queue list to allocate tables accordingly. The media unit 12 is located onsite at the location of a merchant or service provider. The media unit 12 enables offline queuing and ordering should a user encounter a connection problem to access the system.

Each of the media unit 12, the merchant unit 14 and the user unit 16 is in the form of a communication device. A communication device includes a computing device and a mobile computing device such as a mobile phone, tablet, laptop or personal digital assistant. In this embodiment, the user unit is in the form of a mobile device.

The backend control unit, the media unit 12, the merchant unit 14 and the user unit 16 interconnect via a communication means. The communication means can be one of the Internet, an intranet, a dedicated network and any network suitable for interconnecting the backend control unit, the media unit 12, the merchant unit 14 and the user unit 16. Upon receiving input from the user unit 16, information will be sent to both the media unit 12 and backend control unit where it is processed. Subsequently, the processed information which also includes the allocated queue number will be sent to the merchant unit 14.

The media unit 12 and the backend control unit are operable to perform the following:

• Defining a queue list according to a plurality of pre-determined parameters or variables.

The pre-determined parameters or variables comprises queue date, queue time and assign user (see Figure 4B). The queue date is for capturing the date on which each queue entry is entered by a user. Depending on the situation, if a user is joining a queue, then the queue time refers to the current real time; if a user is making a reservation, then the queue time refers to the requested reservation queue time; if a user is making an advance booking, then the queue time refers to the requested queue time. As joining a queue or making a reservation refers to a same day queue entry while advance booking refers to a different day queue entry, the queue date is important for an advance booking.

• Reading a last key time from the queue time where the next assign user slot is empty or available.

• Retrieving requested queue time following an input by a user to join queue or make a reservation, and where applicable, providing the number of people who will be joining the user.

• Initiating allocation of queue number upon processing of parameters comprising requested queue time, last key time and computed time interval.

• Determining reservation queue number, which is dependent on the requested queue time and next available queue number, whereby the allocated queue number is assigned as the requested time if the requested queue time is larger; while the reservation queue number is affected by the last time key and computed time interval should the next available queue number be greater.

• Processing the queue list to arrange and insert the allocated queue number and user into the queue time and assign user parameters/slots/columns respectively. The merchant unit 14, the media unit 12 and the backend control unit are operable to perform the following:

• Revising the queue number by adapting to both time interval and queue time in the case of delays.

The user unit 16 is operable to perform the following:

• Initiating group ordering through sending of invitations to other users and granting them access to the system as guest users.

There is described a queue management method in accordance with an embodiment of the present invention. The queue management method comprises:

• Defining a queue list according to a plurality of pre-determined parameters or variables such as queue date, queue time and assign user;

• Reading a last time key from the queue time where next assign user slot is empty or available;

• Retrieving requested queue time following an input by a user to join queue or make reservation, and where applicable, providing the number of people who will be joining the user;

• Initiating allocation of queue number upon processing of parameters comprising requested queue time, last time key and computed time interval;

• Determining reservation queue number, which is dependent on the requested time and next available queue number, whereby the allocated queue number is assigned as the requested queue time if the request queue time is larger; while the reservation queue number is affected by the last time key and computed time interval should the next available queue number be greater; and

• Processing the queue list to arrange and insert the allocated queue number and user into the queue time and assign user parameters/slots/columns respectively, wherein the above steps are performed by the media unit 12 and the backend control unit; • Revising the queue number by adapting to both time interval and queue time in the case of delays, performed by the merchant unit 14, the media unit 12 and the backend control unit; and

• Initiating group ordering through sending of invitations to other users and granting them access to the system as guest users, performed by the user unit 16.

A user can queue for a product and/or service via a mobile application installed in the user unit 16 or a web-based browser which can be accessed from the user unit 16. Alternatively, a user can queue for a product and/or service via the media unit 12 located onsite at the location of a merchant or service provider. Prior to joining a queue for a product and/or service, a user has to first log into the system. A user can log into the system through wireless connection such as Wi-Fi (see Figure 5A), through a web access login (see Figure 5B), or through a direct APP login (see Figure 5C).

After a user has logged into the system, the user may select the desired merchant and/or service provider and select the queue option of the desired merchant and/or service provider. The user is then directed to a "queue" main page (see Figure 6A). Referring to Figure 3 and Figures 6 A to 6L, a queue management process is described hereinafter in accordance with an embodiment of the present invention. The merchant and/or service provider in this particular embodiment is a restaurant. In a first step, a user is required to input the number of people who will be dining together. In a second step, a user is required to select the "join queue" option and a queue number will be generated by the queue management system. Alternatively, a user can also make a reservation or an advance booking with the queue management system.

Figure 4B illustrates the data structure of the queue management system and shows that it can be sequential or non- sequential. The queue management system comprises a queue list which is defined by at least two variables. The at least two variables comprise queue time, assign user and preferably queue date (see Figure 4B).The queue number generated is based on the following formulae or computations:

• INPUT the at least two variables. Option 1 : Join Queue

OBTAIN Queue Time = Get Current Real Time Option 2: Make Reservation

OBTAIN Queue Time = Requested Reservation Queue Time from user

Option 3: Advance Booking

OBTAIN Queue Date and Queue Time = Requested Queue Date and Queue Time from user

• READ Last Time Key from Queue Time where next Assign User is empty

• COMPUTE Time Interval = Queue Time_n+i - Queue Time_n

• COMPUTE : Allocated Queue Time using Requested Queue Time, Last Time Key and Time Interval as follows:

IF Requested Queue Time > Last Time Key THEN

• Allocated Queue Time = Requested Queue Time

• Insert User to Assign User

ELSE

• Set^{q (t+ft}^ ^(t) = T_{L +} l∑¾:¾ /i ; wherein,

Q = Calculated Queue Time; t = Current Real Time; L = Last Time Key; h = Time Interval; n = index

• Allocated Queue Time = Last Time Key + Time Interval

• Insert User to Assign User

• ENDIF

• OUTPUT: User notified Allocated Queue Time. Allocated Queue Time and User insert into Queue List's Queue Time and Assign User columns respectively

If there is a need for a user to cancel or drop out from the queue, then the queue management system applies the following: • Search Queue Time and verify that Assign User is the User who would like to cancel or drop out from the queue

• Remove User from Assign User

The computed queue number is based on simple moving average and finite difference method which is adapted to both the time interval and queue time. This advantageously allows the queue number to be dynamic, thus allowing "live updates" of queue numbers even in the event of delays.

The estimated queue time may vary from one merchant/service provider to another as it is dependent on the nature of the product/service. Advantageously, each participating merchant/service provider is able to dynamically input into the queue management system a desired time interval such as an estimated queue time, hence, the queue number generated can also be updated where required.

Example 1

Take for example, the last time key is 11:35:00 and the time interval is 1 minute. Based on the computation above, the queue number obtained is 11:36:00.

In the event if the estimated waiting time has changed, for example the estimated waiting time has increased to 5 minutes, the system will take into account the delay of queue time and the queue number that has already been generated will automatically be updated accordingly. Alternatively, the merchant/service provider can enter into the system, the new waiting time and the queue number that has already been generated will automatically be updated accordingly. Following from Example 1 above, take for instance if the number of people in the queue has reduced to 3 but the estimated queueing time is now increased to 5 minutes, the system will re-compute or re-calculate the queue numbers that have been generated and the affected users will be notified of their respective revised queue number.

Advantageously, the queue number generated is unique to every user who joins the queue and the queue number also serves to indicate to a user the estimated time that the user will be served. Hence, with an indication of when a user will be served, a user can utilise the waiting time in a desired manner instead of being physically present at the location of the merchant and/or service provider to wait for his/her turn to be served.

Same day reservations can also be made via the queue management system. In a first step, a user is required to input the number of people who will be dining together. In a second step, a user is required to input a reservation time and then select the "reservation" option.

Example 2

In a situation when the reservation time is less than the next available queue number, in which:

Last Time Key: 12:45:00

Time Interval: 5 minutes

Reservation time: 12:35:00

Calculation

Queue Number = 12:45:00 + 5 min

= 12:50:00

Reservation Time < next available queue number

Queue Number: 12:50:00

Based on the calculation above, the queue number generated is 12:50:00. From this queue number, a user will know at once that the preferred reservation time of 12:35:00 is not available and the next available time to be served is at 12:50:00. Advantageously, the queue number is also the indicative time of when a user will be served. Hence, the user may make an informed decision of whether to proceed with the reservation or to cancel the reservation.

Example 3 In a situation when the reservation time is greater than the next available queue number, in which:

Last Time Key: 11:35:00

Time Interval: 5 minutes

Reservation time: 18:00:00 Calculation

Queue Number = 11:35: 00 + 5 min

= 11:40:00

Reservation Time > next available queue number

Queue Number: 18:00:00

Based on the above calculation, the next available queue number is 11:40:00. As the reservation time is greater than the next available queue number, the preferred time of 18:00:00 will be reserved for the user. Advantageously, the queue number is also the indicative time of when a user will be served. Example 4

In a situation when the reservation time is greater than the next available queue number but the queue number is already taken, in which:

Last Time Key: 11:35:00

Estimated queuing time: 5 minutes

Reservation time: 18:00:00 (however, this slot or queue number is taken)

Calculation

Queue Number = 11:35: 00 + 5 min

= 11:40:00

Reservation Time > next available queue number

Queue Number: 18:05:00

Based on the above calculation, the next available queue number is 11:40:00. Although the reservation time is greater than the next available queue number, as the preferred time of 18:00:00 has been taken or reserved by another user, the next available time will be given, in this case 18:05:00. Advantageously, the queue number is also the indicative time of when a user will be served.

If a user decides to join a queue or proceed with the reservation, the system generates a notification of queue and a table number may be allocated to the user. The allocation of table number will depend on the participating merchant and/or service provider as to whether they would like to present this information to the user. Alerts or reminders may be set off to remind a user of the queue number or the indicative time that the user will be served.

Advantageously, the queue management system and process facilitates direct reservation based on time and also provides an easy referencing of queuing time as the queue number or reservation number also serves as the indicative time of when a user will be served (see Figure 4A).

Advanced booking (non-same day reservations) can also be made via the queue management system. To make an advanced booking, a user is required to enter both the preferred reservation date and time. Similarly, the queue number provided is also the indicative time of when a user will be served.

A user can also cancel the queue at any time. In the event if a user misses his/her queue number or there is a "no show", the slot allocated to the user will be cancelled and the user will have to re-join the queue to obtain a new queue number if desired. Preferably, a grace waiting period is set in the system. If a user does not turn up within the grace waiting period, the merchant and/or service provider may regard it as a "no show" and the slot allocated to the user will be cancelled, and the next user or customer will be served instead. The grace waiting period may differ from one merchant/service provider to another.

Apart from utilising the queue management system of the present invention for dining queues, reservations and advance bookings, the queue management system can also be applied to other uses or sectors.

For example, one possible application of the queue management system is in a car park system. Drivers can join the parking queue through the queue management system via a communication device onsite or remote from another location. Besides, drivers can select and confirm a parking lot which is subjected to availability, similar to making a reservation or advance booking for dining.

Another possible application of the queue management system is in the Food and Beverage (F&B) sector. In this industry, where queuing for a product is inevitable, consumers can join the queue without having to be physically present around the vicinity of the F&B physical store. Thus, with a time efficient and dynamic queuing system, it generates greater sense of customer satisfaction.

Queue-Order-Pay System and Method

The present invention can be integrated into a queue-order-pay system, advantageously allowing a consumer or a user to seamlessly queue, place an order for a desired product and/or service individually or as a group, and pay for the desired product and/or service via a communication device onsite or remote from another location.

With reference to Figures 7 to 11, there is described a queue-order-pay system and method for a user to seamlessly queue, place an order for a desired product and/or service individually or as a group, and pay for the desired product and/or service via a communication device onsite or remote from another location in accordance with an embodiment of the present invention.

Figure 7 is a schematic diagram of the queue management system of the present invention integrated into a queue-order-pay system in accordance with an embodiment of the present invention. The queue-order-pay system comprises the queue management system, an ordering module and a payment module. The queue management system, the ordering module and the payment module interconnect via a communication means. The communication means can be one of the Internet, an intranet, a dedicated network and any network suitable for interconnecting the queue management system, the ordering module and the payment module. The backend control unit of the queue management system is operable to control and manage the ordering module and the payment module. In this embodiment, the backend control unit is configured to control and manage the ordering module and the payment module.

The ordering module is operable to store a plurality of selections of any product and/or service offered by a merchant and/or service provider for a user to browse, select and place an order for a desired product and/or service individually or as a group. Group ordering is achievable whereby an administrator joins a queue and sends virtual invitation to other users. Upon accepting the invitation, users can access the system as Guest User. It enables the invited users to view and modify the order accordingly. The payment module is operable to enable payment of an order placed by a user. The modes of payment include payment through Visa, Mastercard, PayPal, e-NETS, and the like.

In accordance with another embodiment of the present invention, there is described a queue-order-pay method. The queue-order-pay method comprises joining a queue, placing an order individually or as a group and paying for the order which can be a product and/or service. In the step of joining a queue, the method is as described in the previous embodiments above. In the step of placing an order, a user is presented with a plurality of selections of products and/or services of a merchant and/or service provider. A user can proceed to browse the selections provided via a mobile application or a web- based browser (see Figure 8A). Thereafter, a user places an order for the selected product and/or service (see Figure 8B). In addition, virtual invitation can be sent to other users for group ordering purpose. In a next step, a user makes payment for the product and/or service via the mobile application or web-based browser (see Figure 9A). Once payment is completed, a user is free to return to a user's home page (see Figures 9B and 9C). A user can also return to the main page of a merchant and/or service provider (see Figure 10).

In the event if a user has placed an incorrect order and wishes to cancel the order or amend the order, the system can be configured to support such a function. The availability of the cancel/amend order option may be determined by each merchant and/or service provider that utilises the system.

Figure 11 is a flow diagram of a queue-order-pay system of Figure 7 in accordance with another embodiment of the present invention. The queue-order-pay method in this embodiment comprises joining a queue, inviting other users to join the particular queue, placing an order as a group and paying for the order which can be a product and/or service. An order confirmation will be received by the user to verify and complete the transaction. In the step of joining a queue, the method is as described in the previous embodiments above. In the step of inviting other users to join the particular queue, the user is allowed to grant other users access to the particular queue and initiate a group ordering. In the step of placing an order, the user and invited users are presented with a plurality of selections of products and/or services of a merchant and/or service provider. The user and invited users can proceed to browse the selections provided via a mobile application or a web-based browser. Thereafter, a user places an order for the selected product and/or service. Each invited user can also place their respective orders should they decide not to consolidate their orders under a single user. In a next step, a user makes payment for the product and/or service via the mobile application or web-based browser (see Figure 9A). Should there be separate orders made by one or more invited users, each of these invited users can make their respective payment for the product and/or service via the mobile application or web-based browser. The system advantageously allows for either a consolidated payment by one user, or separate payments by each user/invited user. Once payment is completed, a user is free to return to a user's home page (see Figures 9B and 9C). A user can also return to the main page of a merchant and/or service provider (see Figure 10).

It is to be understood that the above embodiments have been provided only by way of exemplification of this invention, and that further modifications and improvements thereto, as would be apparent to persons skilled in the relevant art, are deemed to fall within the broad scope and ambit of the present invention described herein. It is further to be understood that features from one or more of the described embodiments may be combined to form further embodiments.

Claims

A method for queue management, comprising: defining a queue list according to a plurality of pre-determined parameters including queue date, queue time and assign user; reading a last time key from the queue time where next assign user slot is empty; retrieving requested queue time following an input by a user to join queue or make reservation, and where applicable, providing the number of people who will be joining the user; initiating allocation of queue number upon processing of parameters comprising requested queue time, last time key and computed time interval; determining reservation queue number, which is dependent on the requested queue time and next available queue number, whereby the allocated queue number is assigned as the requested queue time if the request queue time is larger; while the reservation queue number is affected by the last time key and computed time interval should the next available queue number be greater; processing the queue list for arranging and inserting the allocated queue number and user into the queue time and assign user parameters respectively; and revising the queue number by adapting to both time interval and queue time in the case of delays.

The method according to claim 1, wherein the method further comprises initiating group ordering through sending of invitations to other users and granting them access as guest users.

The method according to claim 1 or 2, wherein the queue time or allocated queue number is derived based on the following formula:

Q t+ )- Q (t) i _vn

: = ^l L + -∑h

wherein, Q = Calculated Queue Time; t = Current Real Time; L = Last Time Key; h = Time Interval; n = index.

4. A system for queue management, comprising: a backend control unit;

a media unit;

a service provider unit; and

(i) the backend control unit and the media unit are operable to perform the following: defining a queue list according to a plurality of pre-determined parameters including queue date, queue time and assign user; reading a last time key from the queue time where next assign user slot is empty; retrieving requested queue time following an input by a user to join queue or make reservation, and where applicable, providing the number of people who will be joining the user; initiating allocation of queue number upon processing of parameters comprising requested queue time, last time key and computed time interval; determining reservation queue number, which is dependent on the requested queue time and next available queue number, whereby the allocated queue number is assigned as the requested queue time if the request queue time is larger; while the reservation queue number is affected by the last time key and computed time interval should the next available queue number be greater; processing the queue list for arranging and inserting the allocated queue number and user into the queue time and assign user parameters respectively; and (ii) the backend control unit, the media unit and the service provider unit are operable to perform the following: revising the queue number by adapting to both time interval and queue time in the case of delays.

The system according to claim 4, wherein the user unit is operable to perform the following: initiating group ordering through sending of invitations to other users and granting them access as guest users.

The system according to claim 4 or 5, wherein the queue time or allocated queue number is derived based on the following formula:

Q t+ )- Q (t) i _vn

: = ^l L + -∑h

7. The system according to any one of claims 4 to 6, wherein the communication means can be one of the Internet, an intranet, a dedicated network and any network suitable for interconnecting the backend control unit, the media unit, the merchant unit and the user unit.

8. The system according to any one of claims 4 to 7, wherein the each of the media unit, the merchant unit and the user unit is in the form of a communication device.

9. The system according to claim 8, wherein the communication device can be one of a computing device and a mobile computing device.

10. The system according to claim 9, wherein the computing device and/or mobile computing device can be in a form of a mobile phone, tablet, laptop or personal digital assistant.