WO2006082583A2

WO2006082583A2 - Improved queue control system

Info

Publication number: WO2006082583A2
Application number: PCT/IL2006/000136
Authority: WO
Inventors: Roy Madmon; Erez Hybloom
Original assignee: Roy Madmon; Erez Hybloom
Priority date: 2005-02-02
Filing date: 2006-02-02
Publication date: 2006-08-10
Also published as: WO2006082583A3

Abstract

A computerized method for controlling use of multiple tables in a food court. The food court includes restaurants sharing use of the tables, and the restaurants serve many customers. The restaurants are attached to a computer. One of the restaurants upon serving food to a customer, receives from the customer a request for a table. Upon checking availability of the table using the computer, a code associated with the table is transferred to the customer. When the code is transferred, data is transferred to the computer, thereby assigning the table to the customer, and status of the table is changed to unavailable. Preferably, the customer occupies a table of the food court solely upon receiving the code. Preferably, a device is located at each of the tables. The device includes a status control connected to the computer, and upon vacating the table, status is restored to available using the device.

Description

IMPROVED QUEUE CONTROL SYSTEM

FIELD AND BACKGROUND OF THE INVENTION

The present invention relates to an improved control system and, more particularly, to a computerized system for assigning discrete spaces to individuals and/or groups waiting to use a facility shared by multiple enterprises.

In many instances, a person or group waits in a queue only to discover that there is no available space. Examples of such a scenario are seating space, e.g tables in a food court and parking spaces in a parking lot/garage. Waiting for admittance only to discover that there is no parking space, available table or other discrete space is a source of customer dissatisfaction.

When a food court is crowded and most of the tables are in use, there is a tendency of patrons to send a member of the party to occupy a empty table while other members of the party wait in a queue to purchase food at one of the restaurants. Occupying a table, prior to eating at the table further reduces availability of the tables.

A parking lot, for instance in a commercial building typically has reserved parking spaces to corporate tenants operating out of the building. As an example, corporate tenant XYZ Inc. rents monthly reserved parking spaces reserved for employees. A guest to XYZ Inc. is typically required to look for a parking space in an area reserved for visitors or open for public use even if one of the parking spaces reserved and paid for by XYZ corporation is available.

There is thus a need for, and it would be highly advantageous to have_., an improved control system that maximizes efficient use of discrete spaces in a single facility shared by a multiple enterprises. There is considerable prior art in the area of management of persons waiting simultaneously on multiple queues. Representative examples of prior art regarding management of multiple queues are described briefly as follows. An amusement facility reservation device has been disclosed (Japanese Patent Laid-Open Publication No. 2001-202406) in which smart cards are prepared for each customer, reservations are coordinated according to the desired time of use and the amusement facilities that are designated by the customers. When an opening occurs in a designated amusement facility at a designated time, this state is displayed and communicated to the customer's terminal.

^" In addition^ a^"reservation~system has been- disclosed (Japanese Patent Laid-Open- Publication No. 2002-351975) in which a host device is provided for controlling the state of reservations in a plurality of hospitals, whereby, when a desired reservation time and location of a hospital to be reserved are supplied as input from a subscriber's terminal, the states of reservations in a plurality of relevant hospitals are displayed on the terminal, and the subscriber is thus enabled to select from among these hospitals and make a reservation

A queue object control system (US patent application publication, 2006-0002413) in which store terminals, user terminals, and a queue control server are connected by way of a network so as to allow communication. The queue control server includes: store groups in which a multiple of stores are controlled as group turn-waiting queues; a store group control unit that receives usability states of the stores from store terminals and then determines whether any of the stores are available for use; a queue manipulation unit that receives requests from user terminals to register in the queues of store groups, registers the user terminals in the group turn-waiting queues, and, when any store of the store groups becomes available for use, selects user terminals that are registered in the group turn-waiting queues; and a usability notification unit that transmits notification of usability of stores that have become available for use to user terminals that have been selected. The present application addresses a different problem from that of the prior art as cited herein. In the present invention the customers are waiting in a single queue for use of a facility shared among multiple enterprises. The prior art deals with the different problem of managing multiple queues, such as in the amusement park or individually owned discrete spaces, e.g. hospital beds.

The term "queue" as used herein refers to waiting for use of the shared facility, e.g tables in a food court. In the food court embodiment, the term "queue" as used herein does not refer to waiting in line for food at one of the restaurants in the food court.

The term "restaurant"^" as used herein refers to restaurants in a food court. ^•

SUMMARY OF THE INVENTION According to the present invention there is provided a computerized method for controlling use of multiple tables in a food court. The food court includes restaurants sharing use of the tables, and the restaurants serve many customers. The restaurants are attached to a computer. One of the restaurants upon serving food to a customer, receives from the customer a request for a table. Upon checking availability of the table using the computer, a code associated with the table is transferred to the customer. When the code is transferred, data is transferred to the computer, thereby assigning the table to the customer, and status of the table is changed to unavailable. Preferably, the customer occupies a table of the food court solely upon receiving the code. Preferably, a device is located at each of the tables. The device includes a status control connected to the computer, and upon vacating the table, status is restored to available using the device. Preferably the code is in machine readable form, such as a machine readable bar code, and the device includes a bar code scanner and the table is restored to available status by scanning the bar code by the scanner of the device. Typically, the request is received with attributes of the table and the availability is checked for the requested attributes. Table attributes include table location, table occupancy, smoking section, and an available resource, e.g. Internet connection;, at the table. Typically, table occupancy is requested as an attribute, and table availability of a particular occupancy is checked when checking for availability of a table.

According to the present invention, there is provided a computerized system which controls use of tables shared by restaurants in a food court. The tables are used by customers of the restaurants, and a restaurant receives a request from one of the customers for a table. The system includes a computer attached to the restaurants, e.g. cash register isTattached to the computer: The computer is attached to a data storage device. One of the restaurants checks availability of the requested table by querying data stored in the data storage device. When a table is verified as available, the restaurant transfers a code to the customer, the code being associated with the available table. When the code is transferred to the customer, the available table is assigned to the customer and the status of the table is changed to an unavailable status.

According to the present invention there is provided a computerized method for controlling use of parking spaces in a car park, the car park serving multiple enterprises and clients. The enterprises are attached to a computer. One of the enterprises receives a request from a client for a parking space, when the client enters the queue at the car park. Availability of the parking space is checked by using the computer and a code associated with the available parking place is transferred to the client by the enterprise. Upon transferring the code, data is transferred to the computer attached to the enterprises. The parking place is assigned to the client and status of the parking place is changed from available to unavailable. Preferably the code is in machine readable form. In an embodiment of the present invention, a device is located at each of the parking spaces. The device includes a status control connected to the computer, and upon vacating the parking space, status of the parking place using the device. Preferably, a device is located at a gate of the car park, and the client transfers the code to the device which restores the available status of the parking place. Preferably, the code includes a machine readable bar code and the device includes a bar code scanner, and the available status is restored by scanning the bar code. Preferably, the request includes a requested attribute of the parking space and when availability is checked, availability of the requested attribute is checked. Parking space attributes include ownership, size, location, and disabled accessibility.

According to the present invention there is provided a computerized method for controlling multiple discrete spaces in a facility. The facility serves multiple enterprises and clients; The^* enterprises^" are attached^' to a computer. One of the enterprises receives a- request from a client for a discrete space, when the client enters the queue and upon checking availability of the discrete space, a code is transferred associating the discrete space to the client. Upon transferring the code, data is transferred to the computer attached to the enterprises, the discrete space is assigned the client, and status of the discrete space is changed to unavailable. Preferably, the request is received including an attribute of the discrete space and availability of the discrete space is checked which includes checking whether the discrete space has the requested attribute.

According to the present invention there is provided, a computerized system which controls use of discrete spaces in a facility, The facility serves multiple enterprises and multiple clients. A computer is attached to the enterprises, and the computer is attached to a data storage device. When the client enters a queue for the facility, one of the enterprises receives a request from the client for one of the discrete spaces. The enterprise checks availability of the discrete space by querying data stored in the data storage device, and the enterprise transfers a code to the client. The code is associated with an available discrete space and when the code is transferred to the client, the discrete space is assigned to the client and status of the discrete space is changed to an unavailable status by updating in said data storage device.

According to the present invention there is provided a program storage device readable by a computer, tangibly embodying a program of instructions executable by the computer to perform a computerized method for controlling one queue for discrete spaces in a facility, the facility serving a multiple enterprises and clients, the computer is attached to the enterprises. The method includes checking availability of a discrete space; and code associated with the discrete space is transferred to the enterprise; and data is received from the enterprise, changing a status of the discrete space to unavailable.

BRIEF DESCRIPTION OF THE DRAWINGS -

The invention is herein described, by way of example only, with reference to the accompanying drawings, wherein:

FIG. 1 is a simplified drawing of a control system for a single queue of a shared facility in a food court, an embodiment of the present invention;

FIG. 2A is a simplified flow chart of a process of a method of the present invention in the embodiment of Figure 1 ;

FIG 2B is a simplified flow chart of parallel process of the method of the present invention in the embodiment of Figures 1 and 2; and FIG 3 is a simplified drawing of a control system in a car park, according to another embodiment of the present invention.

DESCRIPTION OF PREFERRED EMBODIMENTS OF THE INVENTION

The present invention is of a computerized system and method of managing a single queue by improving efficiency of use of discrete spaces in a facility shared by multiple enterprises. Specifically, the system includes a computerized server and a mechanism, which inputs availability data of the discrete spaces from the multiple enterprises into the server. A computer application installed on the server or on another computer attached to the server uses the availability data to assign a discrete space to members of the queue. The principles and operation of a system and method of a single queue, of a shared facility, according to the present invention, may be better understood with reference to the drawings and the accompanying description.

It should be noted, that although the discussion herein relates to two specific embodiments, a food court and a car park, the present invention may, by non-limiting example, alternatively be configured as well using other analogous embodiments.

Befδre~explaihirig embodiments^" of the^" invention in detail, it is to be understood- that the invention is not limited in its application to the details of design and the arrangement of the components set forth in the following description or illustrated in the drawings. The invention is capable of other embodiments or of being practiced or carried out in various ways. Also, it is to be understood that the phraseology and terminology employed herein is for the purpose of description and should not be regarded as limiting.

The present invention successfully addresses the shortcomings of the presently known configurations by providing a computerized system for assigning discrete spaces to members of a single queue for a shared facility. The system is expected to find especial utility in situations when the discrete spaces become available at different unpredictable times.

According to still further features of the invention, each of the discrete spaces becomes available with at different periods or times as opposed to a theater where it is known in advance that all the seats are in use for an entire period of the performance.

According to further features of the invention described below, the server further stores additional data or attributes pertaining to each of the discrete spaces. For tables in a food court attributes may include smoking/non-smoking designation, occupancy of table, e.g. table for two persons. A car park includes attributes assigned to the parking space such as location, ownership of the parking space, e.g. reserved by XYZ Inc.,, handicap accessibility, size, e.g. sedan, van, truck or bus. According to still further features of the invention each of the discrete spaces is equipped with an indicator i.e. status monitor indicating availability status (e.g. red light for occupied and green light for vacant or a display screen indicating occupied or vacant.

Alternatively, a status control is used to set whether the discrete space is vacant or occupied.

According to still further features of the invention embodiments of the present invention^" are integrated mtδlTcasrf registef"όf aπrenterprise"using the car park or food- court.

According to still further features of the invention the user client issues a legible ticket indicating one or more discrete spaces which have been assigned (e.g. table 7 or floor 3; row D; space 27) .

According to still further features of the invention the user client issues a machine-readable code, e.g. bar code or smart card, radio frequency identification (RFID) indicating one or more discrete spaces which have been assigned (e.g. in a food court, table 27 or in a car park floor P3; row D; space 27)

According to still further features of the invention the system further includes at least one reading device (e.g. bar code reader or smart code reader) to read the machine- readable tickets. The reading device may serve, for example, to issue a signal to the server to change availability status of the discrete space(s) as encoded on the machine-readable ticket.

According to still further features of the invention the reading device is incorporated into a cash register or other billing device or entrance gate. For instance in a parking garage or car park where a patron pre-pays or receives a ticket before entering the garage. The pre-payment and/or ticket would serve to make the specific space available for a patron entering the car park. According to still further features of the invention the system is further equipped with a mechanism for declaring that no discrete spaces are currently available.

According to still further features of the invention the discrete spaces are assigned for a predetermined amount of time, after which their status automatically reverts to "available".

According to still further features of the invention, tickets are valid for redemption oi additional premiums, me premiums may oe, iόr example~music7games7 video clips or Internet access presented/provided on/through a display screen at a restaurant table.

According to still further features of the invention, a display screen or any electronic signal or device or sign at a restaurant table serves to inform a patron that at least a portion of an order is ready.

According to still further features of the invention the server performs pre- allocation of the discrete spaces among two or more businesses operating as user clients of the system. According to still further features of the invention access to discrete spaces which are not available is prevented by means of physical barriers subject to control by the server

Implementation of the method and system of the present invention involves performing or completing selected tasks or steps manually, automatically, or a combination thereof. Moreover, according to actual instrumentation and equipment of preferred embodiments of the method and system of the present invention, several selected steps could be implemented by hardware or by software on any operating system of any firmware or a combination thereof. For example, as hardware, selected steps of the invention could be implemented as a chip or a circuit. As software, selected steps of the im^ention could be implemented as a plurality of software instructions being executed by a computer using any suitable operating system. In any case, selected steps of the method and system of the invention could be described as being performed by a data processor, such as a computing platform for executing a plurality of instructions.

It is appreciated that certain features of the invention, which are, for clarity, described in the context of separate embodiments, may also be provided in combination in a single embodiment. Conversely, various features of the invention, which are. for brevity, described in the context of a single embodiment, may also be provided separately or in any suitable sub-combinatiorh

Referring now to the drawings, Figure 1 illustrates a queue management system in a food court, according to embodiments of the present invention. Figures 2 A and 2B and illustrates a simplified method including processes 20 and 21 respectively. In step 201, a customer, e.g. family, approaches a restaurant 110 of the food court, for instance a pizza restaurant 110a, and orders pizza and requests one of tables 106 for six persons. Using a computer terminal (not shown), attached e.g. by a network 123 to a server 120, the pizza salesperson using the application previously installed on server 120, checks availability of tables (decision box 203). On verifying that tables 106 are available in general (decision box 203), the salesperson verifies (in decision box 211) availability of a table 106 for six occupants. On finding a table 106 for six occupants, table 106 is assigned (step 213) to the customer. A coupon is printed (step 219) with a code, e.g. bar code, associated Λvith table 106. Customer receives the ordered food, e.g. pizza, approaches table 106 and typically after placing the pizza on table 106, scans the code using bar code scanner/reader 101 or alternatively enters the code as received on the coupon on a keypad 101. Bar code scanner/reader/keypad 101 is attached to server computer 120, preferably using a wireless connection from a λvireless router 130, and scanner 101 sends a status signal to computer server 120 that table 106 is currently occupied. Server computer 120 updates status of table 106 in a storage device or memory attached to server computer 120. Alternatively or preferably, server 120 updates status of table 106 using a network connection between a cash register at pizza restaurant HOa when the coupon is issued.

Otherwise, if the application previously installed on on server 120 responds that no table is available (decision box 203) the customer is presented with alternatives, such as eating while standing, or take-out to another venue or waiting. Using the application, pizza salesperson can present (step 205) the waiting family with a forecast regarding expected waiting time, ine noperuiiy not too nungry iamnyrήay'chσose (decision- box - 207) to order now, receive a turn in the queue and receive the pizza later at the time based on the received turn (step 209). For example, the forecast for availability of a table for six is 15 minutes. The family orders, receives a turn in the queue and walks around the mall for 20 minutes based on the received waiting forecast and upon returning to the pizza restaurant receives with the pizza, preferably hot and fresh, and using the code/coupon sits at table 106, now available. Otherwise, the customer is not willing to wait (decision box 207) because the wait is too long. If a table 106 for six occupants is not available (decision box 211), the family is told (step 215) for instance that a table 104 for four occupants is available and a table 102 for two occupants is available. The family accepts (step 217) the two tables, especially since table 102 is adjacent to table 104. Furthermore, table 102 is equipped in addition to standard reader 101 an additional resource 105 including for instance Internet access and/or computer games and/or shopping mall data base to occupy some of the party during their hopefully short wait for their pizza.

When the family is finished (step 223) with table 106 (or tables 102 and 104), the code is scanned or read again to indicate that table 106 has been made available and the available status of table 106 is updated by server 120. Preferably, a maintenance person enters (step 225) the code with a master code, e.g. bar code/smart card, changing the status to available after table 106 is clean and consequently available for use again. In the food court embodiment, tables 106 are used efficiently for two reasons. The customer no longer tends to occupy table 106 prior to receiving food from one of restaurants 110 and furthermore, the customers are preferably seated according to the table occupancy, e.g a party of two is seated in a table for two. Another embodiment of the present invention is illustrated in Figure 3, of a queue management system in a car park. An enterprise 110, for instance medical clinic HOb has available to its employeeTaHd^" patienf s^~parking^paces^" 305~of different' attributesrSome parking places 305 are rented monthly, and used solely by medical clinic HOb. Other parking places are charged on a use or hourly based and are shared by all enterprises 110. Other attributes for parking places 305 are based on location floor/section/ or in proximity to which enterprise 110 . Still other attributes are based on disability access or emergency access. For instance, one parking place 305 situated right in front of MD Clinic HOb is always reserved for emergency patients. The car park queue management system includes a reader 301 at the gate to the car park. A patient of MD clinic 110b, when an appointment is made or alternatively just prior to arrival is given a code, e.g. a four digit code by clerk at MD clinic HOb. Typically the code is entered by hand, or scanned into reader 301. The code is either already associated with a particular parking space based on requested attributes or the association to the particular parking is made on arrival after entering the code into reader 301. In either case, reader 301 reads the code and a ticket is printed with the location of the parking place. Use of a queue management system of the present invention allows enterprise 110b to preferentially use parking places 303 which are already payed for e.g on a monthly basis, thereby saving the expense of paying for hourly use of publicly used parking space 305. All users benefit because parking spaces 305 are pre-allocated and time is not wasted driving around the parking lot looking for a space. In other car park embodiments, each parking space 305 includes a sensor 303 a which is connected, e.g. wirelessly to server computer 120. Sensor 303 indicates if parking space 305 is currently in use.

Although the invention has been described in conjunction with specific embodiments thereof, it is evident that many alternatives;, modifications and variations will be apparent to those skilled in the art. Accordingly, it is intended to embrace all such alternatives, modifications and variations that fall ^"within the^" spirit and broad scope- of the - appended claims. All publications, patents and patent applications mentioned in this specification are herein incorporated in their entirety by reference into the specification, to the same extent as if each individual publication, patent or patent application was specifically and individually indicated to be incorporated herein by reference. In addition, citation or identification of any reference in this application shall not be construed as an admission that such reference is available as prior art to the present invention.

Claims

WHAT IS CLAIMED IS:

1. A computerized method for controlling use of a plurality of tables in a food court, the food court including a plurality of restaurants sharing use of the tables, the restaurants serving a plurality of customers, the method comprising:

(a) providing a computer operatively- attached to the-restaurants;-

(b) at least one of the restaurants receiving a request from at least one of the customers for at least one of the tables;

(c) upon checking availability using said computer of said at least one table, transferring a code associated with said at least one table to said at least one customer; and

(d) upon said transferring said code, data is transferred to said computer, thereby assigning said at least one table to said customer, and changing to an unavailable status said at least one table.

2. The method, according to claim 1, wherein said at least one customer occupies said at least one table solely upon receiving said code.

3. The method, according to claim 1, wherein a device is located at each of the tables said device including a status control operatively connected to said computer, further comprising the step of:

(d) upon vacating said at least one table, restoring said status to available of said at least one table, wherein said restoring is performed using said device.

4. The method, according to claim 1, wherein said code is in machine readable form.

5. The method, according to claim 1, wherein said code includes a machine readable bar code, wherein said device includes a bar code scanner and wherein said restoring said at least one table to available status is performed by scanning said bar code.

6. The method, according to claim 1, wherein said receiving a request includes a requested attribute ^■ of said- at* least- one- table and wherein- said checking- availability- includes said checking whether said least one table has said requested attribute.

7. The method, according to claim 6, wherein said attribute is selected from the group of attributes consisting of: table location, table occupancy, smoking section, and an available resource at said at least one table.

8. The method, according to claim 6, wherein said attribute is a requested table occupancy and wherein said checking availability includes checking if said at least one table has said requested table occupancy.

9. A computerized system which controls use of a plurality of tables shared by a plurality of restaurants in a food court, wherein the tables are used by a plurality of customers of the restaurants, wherein at least one of the restaurants receives a request from at least one of the customers for at least one of the tables, the system comprising:

(a) a computer operatively attached to the restaurants, wherein said computer is operatively attached to a data storage device; wherein the at least one of the restaurants checks availability of said tables by querying data stored in said data storage device, and when at least one table is verified as available, the at least one of the restaurants transfers a code to the at least one customer, wherein said code is associated in with said at least one table and when said code is transferred to ^' said at least one customer, availability status of said at least one table is changed to an unavailable status.

10. A computerized method for controlling use of a plurality of parking spaces in a car park; the' car"park" serving" a- plurality of- enterprises and a plurality of clients the method comprising:

(a) providing a computer attached to the enterprises;

(b) at least one of the enterprises receiving a request from at least one of the clients for a parking space, when said at least one of the clients enters a queue for the car park;

(c) upon checking availability of said parking space using said computer, said at least one of the enterprises transferring a code associated with said parking space to said at least one client, and

(d) upon said transferring said code, transferring data to said computer thereby assigning said parking space to said client, and changing to an unavailable status said parking space.

11. The method, according to claims 1O₅ wherein said code is in machine readable form.

12. The method, according to claim 10, wherein a device is located at each of the parking spaces, said device including a status control operatively connected to said computer, further comprising the step of:

(e) upon vacating said at least one parking space, restoring said status to available of said at least one parking space, wherein said restoring is performed using said device.

13. The method, according to claim 10, wherein a device is located at a gate of the car park, further comprising the step of:

(e) transferring said code to said device, thereby restoring said status of said parking place.

14: The^~method.r according to claims~12- or-13r wherein said code includes a machine, readable bar code, wherein said device includes a bar code scanner and wherein said restoring said at least one parking place to said available status is performed by scanning said bar code.

15. The method, according to claim 10, wherein said receiving a request includes a requested attribute of said parking space and wherein said checking availability includes said checking if said parking space has said requested attribute.

16. The method, according to claim 15, wherein said attribute is selected from the group of attributes consisting of: ownership, size, location, and disabled accessibility.

17. A computerized method for controlling use for a plurality of discrete spaces in a facility, the facility serving a plurality of enterprises and a plurality of clients the method comprising:

(a) providing a computer operatively attached to the enterprises;

(b) at least one of the enterprises receiving a request from at least one of the clients for a discrete space;

(c) upon checking availability of said discrete space, transferring a code associated with said discrete space to said at least one of the clients, (d) upon said transferring said code by said at least one enterprise to said at least one of the clients, transferring data to said computer, thereby assigning said discrete space to said at least one of the clients, and changing to an unavailable status said discrete space.

18. The method, according to claim 17, wherein said receiving a request includes a

said discrete space and- wherein- said checking availability- includes, checking whether said discrete space has said requested attribute.

19. A computerized system which controls use of a plurality of discrete spaces shared by a plurality of enterprises wherein the discrete spaces are used by a plurality of clients, wherein at least one of the enterprises receives a request from at least one of the clients for at least one of the discrete spaces, the system comprising:

(a) a computer operatively attached to the enterprises, wherein said computer is operatively attached to a data storage device; when at least one of said clients enters a queue for at least one of the discrete spaces, said at least one client requests from one of the enterprises said at least one discrete space and said one enterprise checks availability of said at least one discrete space by querying data stored in said data storage device, and when said at least one discrete space is verified as available the at least one of the enterprises transfers a code to said at least one client wherein said code is associated with said at least one discrete space and when said code is transferred to said at least one client, said at least one discrete space is assigned to said at least one client and availability status of said at least one discrete space is changed to an unavailable status by updating said status in said data storage device.

20. A program storage device readable by a computer, tangibly embodying a program of instructions executable by the computer to perform a computerized method for controlling one queue for a plurality of discrete spaces in a facility, the facility serving a plurality of enterprises and a plurality of clients,wherein the enterprises are attached to the computer, and when at least one of the clients enters said queue for at least one of the ^{^}discrete spaces^{^} said- at least- one- of- the clients- requests- from- said-at least.one_ of the enterprises said at least one of the discrete spaces, the method comprising the steps of : (a) checking availability of said at least one discrete space;

(b) transferring a code associated with said at least one discrete space to said at least one enterprise; and

(c) receiving data from said at least one enterprise, thereby changing a status to an unavailable status of said at least one discrete space.