CUSTOMER QUEUE CONTROL APPARATUS

Abstract: Customer queue control apparatus for an establishment having a plurality of service stations (40-50) utilizes a main queue and a plurality of local queues having not more than two members, at the individual service stations (40-50). A switch (66) detects the presence of a customer at the head of the main queue and keys (52) at the individual service stations (40-50) are utilized by the operators to signal that the station is open for business or that a customer has left the station after service. A synthesized voice message directs the customer to a local queue determined to have the expected minimum waiting time, dependent on the number of customers in each local queue, and the probable service time per customer in each local queue.

Description: CUSTOMΞR QUEUE CONTROL APPARATUS Technical Field This invention relates to customer queue con¬ trol apparatus for an establishment having a plurality of service stations, of the kind including customer direc¬ ting means adapted to provide directions for the custo¬ mer at the head of a main queue to go to one of said plurality of service stations. Background Art Customer queue control apparatus of the kind specified is known from U.S. Patent Specification No. 3,868,670. According to this known apparatus there is provided a central display panel visible to the custom¬ ers in the queue and which contains illuminable desig- nations representing the service stations. Individual switching means are provided at each service station so that the individual operators may turn their respective ' designations on or off in the- panel. Furthermore, cus¬ tomer activated switching pads are also provided indi- vidually at each service station and automatically turn off the associated illuminated designation whenever a customer is at the associated service station, the designation turning on again automatically when the customer leaves the service station. The known system has the disadvantage of lim¬ ited efficiency since operator time is wasted resulting from the time taken by the customer at the head of the queue to appreciate that a service station is available and the time taken by the customer to proceed from the queue to the available service station. Disclosure of the Invention It is an object of the present invention to provide customer queue control apparatus of the kind specified, wherein the aforementioned disadvantage is alleviated. OMPI Therefαre, according to the present invention, there is provided customer queue control apparatus of the kind specified characterized by time determining means coupled to said customer directing means and adapted to permit formation of local queues at said service stations and to determine which service station has a local queue expected to provide the shortest waiting time fo ' r said customer, said directing means being adapted to direct said customer to the thus determined service station. It will be appreciated that the provision for the formation of local queues, which may-be of limited length, at the individual service stations and the deter¬ mination of the expected shortest waiting time enable a highly efficient control to be achieved by the apparatus. It is to be noted that customer waiting time is minimized. According to a further feature of the inven¬ tion, the customer directing means includes synthesized voice generating means to ' direct the customer to the relevant service station. ' This has the advantage that difficulties in recognizing service station numbers and/or arrows displayed on panels are avoided. Furthermore, the decor of the interior of the establishment is improved by the absence of the illuminated display panel. Brief Description of the Drawings One embodiment of the invention will now be described by way of example with reference to the accom¬ panying drawings, in which: Fig. 1 is a block diagram of a customer queue control apparatus according to the present invention; Fig. 2 is a diagram of a main processor memory and a speech processor memory, included in the apparatus of Fig. 1, showing the type of information .stored in the various sections of each memory; Figs. 3, 4 and 5 are diagrams showing the man- ner in which the time utilized in a customer service transaction is divided into various categories under various methods of customer queue control; Figs. 6A, 6B and 6C comprise a flow diagram for the main processor customer queue control program; Fig. 7 is a flow diagram for an interrupt ser¬ vice routine for the program of Figs. βA, 6B and β C; and Figs. 8A and 8B comprise a flow diagram for the speech processor program. Best Mode for Carrying Out the Invention Referring now to Fig. 1, there is shown a block diagram of the system. A main processor 20 has associated therewith a memory 22, and is .coupled to, and controls, address bus 24 and data bus 26, for communi¬ cation with other elements of the system. A signal CNTRL1 controls communication between the processor 20, the memories 22 and 30, and address decoder 64. A speech processor 28 has associated therewith a memory 30 and is coupled to and controls, address bus 32 and data bus 34 for communication with the other elements of the system. The busses 32 and 34 at given times are con¬ trolled by processor 20 f or the purpose of transferring data to the speech processor memory 30. A signal CNTRL2 controls communication between the speech processor 28 and the associated memory 30. Buffer 36 interconnects the tri-state buses 24 aifd 32, while buffer 38 intercon¬ nects the tri-state buses 26 and 34. Both, buffers 36 and 38 are controlled by a signal B12 which is generated by the main processor 20. In the illustrated embodiment, the system includes a plurality of customer service stations 40, 42, 44, 46, 48 and 50. It will be recognized that a larger or smaller number of stations could be provided, if desired. Each station is provided with two control elements or keys 52 and 54. The "open" key_ 52 of each station may be depressed or otherwise operated to indi¬ cate that the station is open for business, or that a transaction has just been completed, and the station is ready to receive another customer. The "close" key 54 of each station may be depressed or otherwise operated ^ ■ ^A - ' .E ^_ A c i '"'i - - to indicate that the station is closed, and is therefore not available to receive customers. Conductors 56 and 58, connected to keys 52 and 54, respectively, of the various stations 40 to 50, 5 provide inputs to a switch detector and encoder 60. In response to the various inputs from the service stations 40 to 50, the switch detector and encoder 60 provides a first output interrupt signal INTR1, which is applied to the main processor 20, and which indicates by its logic 10 level whether or not either one of the two "open" or "close" keys 52 and 54 of one of the various stations 40 to 50 has been depressed. The switch detector and encoder 60 also provides five parallel output conductors , to a peripheral interface 62. Four of these conductors IS are combined to give the identifying number of the specific station 40 to 50 in which a key has been actu¬ ated, and the fifth conductor indicates by its logic level whether the actuated key was an "open" key 52 or a "close" key 54. 20 The peripheral interface 62 transfers the above data to the bus 26 in response to a signal from an address encoder 64, which in turn is controlled by the main processor 20 through the bus 24. The station num¬ ber and key status information output from the interface 25 62 is carried by the bus 26 to the main processor 20. A signal DETΞCTOR is generated by a customer presence detector 66 and is transmitted to the main processor 20 whenever a customer is present at the head of the main queue. Any suitable means, such as a switch 30 contained in a mat upon which the customer stands, may be employed as the detector 66. Main processor 20 controls speech processor 28 by means of a HOLD signal on line 68, which, when at a high logic level, causes the buses 32, 34 to "float" 35 and maintains the speech processor 28 inactive. When the speech processor 28 has commenced a speech synthe¬ sizing operation, it transmits a 3USY signal back to the processor 20 on line 70 -co indicate its activit . Th main processor 20 " provides general control of the system through its software. Voice message information is transmitted from the main processor 20 through buses 24, 26, buffers 36, 38, and buses 32, 34 to the speech processor 28. The memory 22 associated with the main processor 20 contains all definition tables and working tables, as well as pointers P, P3 and P4, and the main and interrupt programs, as will subsequently be described in greater detail. The memory 22 interfaces with the processor 20 to provide control programs and certain information required for generation of the messages transmitted to the speech processor 28. The speech processor 28 is usually in a "hold" state until activated by the main processor 20, and controls the flow of data to a speech synthesizer 80, which in turn operates a speaker 82 to produce the speech messages heard by customers in the main queue. The processor 28 interfaces with the speech memory 30, which contains addresses of the speech data, as well as the speech data itself, plus speech processor program, as will subsequently be described in greater detail. A timer unit 84 generates a clock pulse C S required for use by the speech synthesizer 80. The signal CKS is transmitted to a gate 86 where it is logically combined with the signal GATECK generated by the speech processor 28. The signal GATECK is active during the time of a message transmission, and at other times will block the signal CKS from reaching the speech synthesizer 80. The gated signal CKS is also conducted to a pulse generator 88, where it is shaped to produce an interrupt signal INTR2, which is applied to the speech processor 28. A signal DIGIDATA from the speech processor 28 carries a serial bit stream of speech data to the speech synthesizer 80 at a rate determined by the signal INTR2. This data stream, when applied to the speech synthesizer 80, causes an output to the speaker 82 which produces the desired speech message. Specific circuit implementation in accordance with the system diagram of Fig. 1 may readily be accom¬ plished by one having ordinary skill in the art. Suit¬ able devices for various elements of the system are not limited to, but may include, the following. For the switch detector and encoder 60, an AM9318 priority encoder manufactured by Advanced Micro Devices, Inc. , may be employed. Each such device is capable of handling up to four stations in the present system, so that if a larger number of stations are to be included, the devices may be connected in parallel. For the peripheral inter¬ face 62, an Intel 8255A programmable peripheral interface may be employed. For the address decoder 64, a Signetics 54/74138 three-to-eight line decoder/demultiplier may be" employed. For the buffers 36, 38, a Fairchild 74S2 1 device may be employed. The processors 20 and 28 may be implemented using an Intel 8085 microprocessor. For the memories 22, 30, an Intel 2716 read-only memory and an Intel 8185 read/write member may be employed. For the speech synthesizer 80, a suitable device is a Motorola. MC3417 continuously variable slope delta modulator. The timer 84 and the gate 86 may be implemented together in a single Intel 8253 programmable interface timer (mode 3). For the pulse generator 88, a Fairchild 9600 mono— stable multivibrator may be used. Referring now to Fig. 2, the map of the memory - 22, which is also referred to in certain portions of the description as "Ml", is divided into a first read-only memory section 100 and a second read-write memory section 102. The contents of the read-only memory section 100 are determined during the design process for the system, and are written into the memory device before the device is incorporated into the system. Included_in the read¬ only memory section 100 is a first area 104 in which the main and interrupt programs are stored. Also included in the section 100 is an area 106 in which is stored the delav parameters definition table DPDT. This table defines a set value for each timer in the table CDT. The timers will be subsequently described in greater detail in the discussion of the table CDT. The manner in which the values for the timers for the table DPDT are determined will now be described. Shown in Fig. 3 is a diagram depicting the various time elements which make up a typical service station trans¬ action, and the relationship of these elements. These elements include recognition time (T ) , travel time (T * c. ), service time (T β s) and adjusting time (Ta_). Recog- nition time is time spent by the customer to recognize that one or more service stations is available and to select the nearest available service station. Travel time is required to move from the head of the queue to the selected service station. Service time is taken in serving the customer at the station and may vary sub¬ stantially, as shown by the "maximum" g AX , "minimum" T- j , and "average" T_ AV _ lengths shown in Fig. 3. After finishing a transaction, the customer remains at the station for another interval (the adjustment time) before leaving. In Fig. 4, the total time span is shown for serving a plurality of customers utilizing a standard method in which service of one customer is not begun until service of the preceding customer has been com¬ pleted. In such a case, it will be seen that the Time 3etween Transactions (TBT 0L _) for such a method is: BT OLD β T r + T t + T s + T a In Fig. 5, the method of the present invention is illustrated diagrammatiσally. The periods of customer service are overlapped, so that the Total Transaction Time (equivalent to TBT QLj;) ) is equal to a delay time plus an overlap time. An appropriate value for the delay time is computed in each case, utilizing a mathe¬ matically determined constant "C", so that the Time BAO ORIGINA Between Transactions (TBT -T E_..) , for the method of the present invention is: T3T.N T _EW- = Tr + Tt. ÷* CTs As indicated above, Total Transaction Time is equal to Delay Time plus Overlap Time, where: Total Transaction Time = Tr + Tt. + Ts + Ta Delay Time * * T + T + CT Overlap Time * = T m + Tt- + T C Combining these equations, th -following value for C is obtained: The factor C may then be determined for each service station according to statistical measurement of T_ C, . and T___) for the environment in a given establish- meπt. The value of C has .been found normally to rang'e between 0.75 and 0.90. For a given application, knowing the statistical means of T , T and T , represented by T, T and T , respectively, the factor C is computed from: T - (T + T,.) C - s. The travel time T is a function of the dis¬ tance between the service station and the main queue. A - smaller value of C tends to build the local queue for that service station to the maximum of two customers. On the other hand, a larger value for C will tend to utilize the station less efficiently. The values for the delay times to be defined for table DPDT are computed from: DPDT ( j J ) ~ T r_. + τr t. 3. + c j. . T sj. ,' for each station j . OMPI Also included in the read-only memory section 100 is an area 108 in which is stored the station posi¬ tion definition table TLT. This table indicates the positions of the various service stations with reference to the direction in which a customer must proceed in moving from the head of the main queue to the local queue at the selected station; that is, either to the left or to the right. The number of positions in the table TLT is equal to the number of service stations, and the value stored in each position is either 0, indicating a station to the left of the main queue; or 1, indicating a station to the right of the main queue. Included in the read-write memory section 102 of the memory 22 is a first area 110 in which is stored the present station activity table PTAT. This table indicates the activity at each station local queue. The number of positions in the table PTAT is equal to the number of service stations, and the value stored in each position is either 0, 1 or 2. If the value is 0, this indicates that the station has no customers; if the value is 1 or 2, this indicates the number of customers at the station in the local queue. The table is initial¬ ized to 0. When a customer in the main queue is dis- patched to a station j, the value of the position j of table PTAT is increased by one. When the operator of a station j has actuated an "open" key 52 and there is at least one customer in its local queue, then the value of position j of table PTAT is decreased by one. Also included in the read-write memory section 102 of the memory 22 is an area 112 in which is stored the next available station table NATT. This table contains a list of available service stations and indi¬ cates in which order these service stations will serve incoming customers. The number of positions in the table NATT is equal to the number of service stations, and the contents of the various positions are the iden¬ tifying numbers of the various service stations. The relative positions indicate the order in which the service stations will be assigned, with the identifying number of the next available service station being in the first position. The table is initialized to 0, indicating that no service station is available. A pointer P denotes the next available entry. After the initializing operation, P is equal to 1. If the station number j in the first position of the table NATT is not 0, then the customer at the head of the queue will be assigned to that station. Once that station has been assigned, all-.of the entries in the table NATT between positions 2 and P are shifted one position to the left and P is decreased by 1, thus removing from the table NATT the service station number formerly in the first position. When a station is closed, its identifying number j is removed from the table NATT, and the table is adjusted by shifting all entries between the position corresponding to j plus 1 and P, one position to the left. The value of position P is then decreased by 1. Also included in the read-write memory section 102 of the memory 22 is an area 114 in which is stored the delay activity table DAT. The function of this table is to specify whic * station numbers have active timers in the table CDT. Position j in the table DAT indicates the station number. The contents of table DAT indicate which timers in the table CDT are active. Each position DAT(j) may equal either 0,-1, -2 or 3. The value 0 means that the timer in table CDT is not active; the value 1 means that the timer is active; the value 2 means that the station operator has depressed the "open" key and either that the station has opened or that the operator has removed one customer.from the local queue; and the value 3 means that the station operator has depressed the "close" key. The table DAT is initialized to 3. Also included in the read-write memory section 102 of the memory 22 is an area 116 in which is stored OMPI the countdown delay table CDT. The function of this table is to indicate the amount of time remaining for each station until the next customer in the main queue can be dispatched to that associated local queue. A software timer is contained in this table for each service station. The table CDT contains a number of positions which is equal to the number of service sta¬ tions, and the contents of each position has a value which indicates the amount of time left at a given instant in the timer assigned to that position. The range of values for the time t for each position varies from the delay value for that position stored in the table. DPDT, to 0. The table CDT is initialized by setting each position to the corresponding delay value stored in the table DPDT. During system operation, when the value of a given position of table CDT times out to ' 0, and there are less than two customers in its local queue, then that station number is entered at position P of table NATT, the entry value of that position of table CDT is reset to the corresponding value in table DPDT, and the corresponding position of table DAT is set to 0. Also included in the read-write memory section 102 of the memory 22 is a work area 118, for storage of variable values such as the station number j, the vari- able value p used in removing the teller number from the table NATT, and the value P used in the interrupt service routine. The speech processor memory 30, which is also referred to in certain portions of the drawings and description as M2, is implemented with two types of memory elements, the read-only memory section 124, and the read/write memory section 126. The contents of the read-only memory section 124 are determined during the design process for the system, and are written into the memory device before the device is incorporated into the system.. Three separate areas of the read-only memory section 124 are defined in Fig. 2. Area 128 contains the speech processor program shown in Fig. 8. Area 130 contains a number of locations providing message addres¬ ses. A message address indicates the starting address in memory where the speech data for this message can be found. Area 132 contains the speech data for the differ¬ ent messages required by the operating environment in which the system is utilized. The speech data, when clocked in a serial bit stream in the signal DIGIDATA and delivered to the speech synthesizer 80 (Fig. 1) will cause the synthesizer to generate an analog signal containing the necessary information to reproduce the spoken message. The contents of the read-write memory section 126 are the variable elements of the system. The shared memory portion 134 is addressed by both processors 20 and 28. Processor 20 selects this memory to transfer the service station number j, the location 1 of the service station from memory 22, and to indicate that new data are available by setting the transfer indicator TRFFLG equal to one. Memory area 136 contains tem¬ porary values required by the speech processor program. Memory area 138 contains pointers P3 and P4. Pointer P3 marks a position in the speech address list 140. Pointer P4 marks a position in the speech data section 132. The speech address list 140 s tores the starting addresses of the various messages in section 132 necessary to assemble spoken instructions to be delivered to the customer at the head of the main queue. Returning now to the read-only memory section 124 ,of the memory 30, a brief summary of the various locations is provided. Locations 146, 148, 150, 152, 154, 156 contain the addresses of areas 166, 168, 170, 172, 174, 176, respectively. These areas 166-176 of the memory 30 contain the speech data for messages 1-6 respectively. Returning to the read/write memory section 126, location 142 of memory 30 contains the station number of the selected station. Location 144 of the memory 30 contains the selected station location direc¬ tion. The value at the location can be either 0 or 1, indicating that the station is located to the right or the left of the main queue. Location 145 contains the transfer indicator TRFFLG. Area 178 contains the speech address list. This list is compiled every time that the speech processor is activated, in order to deliver the next spoken message with the correct teller number and location. Let it now be assumed that the>main processor 20 transfers from the memory 22 to the memory 30 at locations 142 and 144 the teller number 2 and the loca¬ tion 1 respectively. The speech address list 140, starting with the address at the beginning of the area 178 will contain the starting addresses of areas 166, 172, 168, 176. This corresponds to the following voice message: "Please proceed to your, left, to station two." The manner in which the system of the present invention functions to select a local queue and to generate a voice message to direct a customer at the head of the main queue to the selected local queue is best explained by reference to the flow diagrams of Figs. 6A, 6B, 6C, 7, 8A and 8B. Referring now to Fig. 6A, the operation of the system is commenced at the start position of the main program, represented by block 190. A number of initial- ization operations are first performed, as indicated in block 192. The contents of Table PTAT are set equal to 0 for all station positions j, indicating that all stations have no customers at their local queues. The contents of Table NATT are set equal to 0, and its associated pointer P is set equal to 1, indicating that no station is available. The contents of Table DAT are set equal to 3 for all station positions j, to indicate that all stations are closed. The contents of Table CDT are set to the values stored in the Table DPDT. CDT(j) is equal to DPDT(j), which represents the amount of time between the assignment of a customer to the local queue of a given station and the assignment of the next cus- tomer to the local queue for that station. The indicator LASTK is set equal to 0 , to indicate that processing for the last customer has been completed. The indicator LASTM is set equal to 0 to indicate that there is no message for the speech processor. The hold signal line which indicates a hold state for the speech processor 28 is set equal to one. Once the initialization operations of block 192 have been completed, the interrupt function is enabled, as indicated ' in block 194 of the flow diagram of Fig. 6A. This involves a gating operation which permits the "open" and "close" keys 52, 54 of the various service stations 40-50 to affect control of the system operation. After completing initialization, the system enters what may be considered to be a "normal" condition, which consists of two states, updating of timers and monitoring of customer presence at the head of the main queue. Each time a station operator presses one of the "open" or "close* keys 52 or 54, the normal condition of the system is interrupted and the system enters a routine to service the operator request. Once this routine is completed, the operation returns the system to the point at which it left the normal condition. In the updating of timers in table CDT, the active timers, represented by DAT(j) = 1, are decreased by t units of time, where t is a function of the number of instructions performed between two successive updates. If a particular active timer CDT(j) equals 0, the sta- tion number j is entered in the available teller list in Table NATT and the CDT(j ) and DAT(j ) values are then re¬ initialized. This is accomplished by the portion of the £LE. OMPI process indicated in the dashed line block 196 of Fig. 6B, which will now be described in greater detail. As indicated in block 198, the value of j, relating to a service station number, is set equal to 1. System operation then proceeds to decision block 200, where position j of the delay activity table DAT, designated on flow diagram of Fig. 6B A as DAT(j), is tested to determine whether or not it is equal to 0 or 3. If it is equal to 0 or 3, the software timer for that station is not active, and if the value is not equal to 0 or 3 then the timer is active. Assuming that DAT(j) is not equal to 0 or 3, the process proceeds to decision block 202, where DAT(j) is tested to determine whether or not it is equal to 2, which would mean that the operator of station j has depressed the "open" key 52. Assuming that DAT(j) « 2, the process proceeds to decision block 204, where it is determined if station j is present in table NATT; if present, signified ' by NATT(p) » j, the process continues to block 205 where the value of DAT(j) is set to 0. From block 205 the process proceeds to block 216. If j is not present in table NATT, operation proceeds to decision block 209, where the equivalence of PTAT(j) to zero is tested to determine whether a customer is present at the local queue j. If no customer is present at the local queue, the operation proceeds sequentially through blocks 206, 208, 210, 212 and 214 to decision block 216. First, in block 206, the interrupt function is disabled. In block 208, the Table NATT is updated by first shifting all values between NATT(l) and NATT(P) one position to the right, and then making the value of position 1 equal to j. This has the effect of making station j the next station to be selected. In block 210, the.value of P is incremented by 1, and position P of Table NATT is made equal to 0. In block 212, DAT(j) is set equal to 0 and CDT(j) is set equal to DPDT(j), and in block 214, the interrupt is enabled once again. OMPI The process then proceeds to the decision block 216, in which the value of j is tested for equality with N, which, it will be recalled, is the total number of service stations. If j is not equal to N, the process loops back on path 218 to block 220, in which j is incremented by 1, and then back over path 222 to the previously-described decision block 200, after which the process is repeated with the greater value of j-. This looping continues until j is found to be equal to N in decision block 216, so that the status .of all stations is ascertained and they are appropriately positioned in the Table NATT. When j is determined in decision block 216 to be equal to N, the process then proceeds on path 224 to decision block 226 (Fig. 6C), for generation of customer-directing messages where appropriate, as will subsequently be described. Returning now to decision block 202, it will be noted that if DAT(j) is not equal to 2, the process continues to block 207 where the value of CDT(j) is tested for equivalence to a negative value- If so, operation continues to block 234. If not, then the delay time for station j is decremented in block 228 by t, which, as previously stated, is a function of the number of instructions performed between two successive updates. The process then proceeds to block 230, where the equality of CDT(j) to 0 or negative is tested, to determine whether any time remains on this timer. If not, the process proceeds over path- 2-32 to the pre¬ viously-mentioned decision block 216.. If CDT(j) is equal to 0 or negative, the process continues to decision block 234, where the value of position j of the Table PTAT is tested for equality with 2. If such equality exists, this indicates that two customers are already present in the local queue associated with that service station, and the process therefore proceeds over path 236 to block 239, where the value of CDT(j) is set to minus one. From there, the process continues to the decision block 216. If the value of position j of Table PTAT is not equal to 2, the process proceeds sequentially to a disable interrupt block 238, a block 240 in which position P of the Table NATT is set equal to j, and through the previously- mentioned blocks 210, 212 and 214, incrementing the value of P by 1, setting NATT(P) equal to 0, setting DAT(j) equal to 0, setting CDT(j) equal to DPDT(j), re- enabling the interrupt, and then proceeding to the decision block 216. In block 209, if the value of PTAT(j) is not • 0, operation proceeds to blocks 238, 240, 210, 212, 214 and 216, previously described, and where station j is entered in the next available position of table NATT. The system proceeds to block 226 where the equivalence of the hardware line KDETECTOR to 1 is tested. If such equivalence exists, it is established that there is at least one person in the main queue. If the equivalence does not exist, indicating that no customer is present in the main queue, the value LASTK is set equal to 0 in block 243, and the process. returns over paths 242 and 264 to block 19-6 to update the timers. Assuming that KDETECTOR = 1, the system pro- ceeds to decision block 244, in which the equivalence of LASTK to 1 is tested. This determines whether or not there is already a customer who has been previously detected. If not, an inquiry is made of Table NATT to see whether any station jj is available for this custom¬ er, this being done in decision block 246. The value jj, as used here, represents the station number in the first position in the table NATT, which will be assigned to the next customer in the main queue. The first position in Table NATT is examined and if that position is other than 0, then a station is available to service the customer at the head of the queue. If there is no station available, the system proceeds back over paths 248 and 264 to update the timers as previously described OMPI in connection with block 196. Assuming that a service station is available, the value LASTK is set equal to 1 in block 250. Interrupt is then disabled in block 252 and the value of jj is set to equal position 1 of the Table NATT in block 254. Next, in block 256, the posi¬ tion value p of Table NATT is made equal to the value of position p +• 1 for positions p being equal to positions 1, 2 up to position P_. P is made equal to P-l in block 258, and the value of NATT(P) is made equal to 0 in block 260. This has the effect of removing service station jj from the Table NATT. Subsequently, the value of LASTM is set equal to 1 in block 262, signifying ' that a message must be sent to the customer at the head of the main queue. Interrupt is then enabled in block 263 and from there, over path 264, -the system loops back to update * the timers in " block 196 " . After updating the timers is completed, the system returns to decision block 226 to ascertain whether KDETECTOR " is equal to 1. This value will ' remain 1 because the customer is still standing at the head-of the queue. The system proceeds to block 244 where a test is made as to whether or not LASTK is equal to 1, which will be the case because it has previously been set to 1. The system then proceeds to decision block 266, where the equivalence of the value LASTM to 0 is tested. This constitutes an inquiry as to whether or not the message for this customer has been delivered. LASTM has been set to value 1 in block 262, so that the "No" branch from block 266 is taken, leading to decision block 268. A determination here is made as to whether or not the speech processor is available, and this is done by checking the hardware line BUSY. If this line is not equal to 0, then the speech processor 28 is not free and the system returns over paths 270 and 264 to update the timers in block 196. If the speech processor is free, or not busy, the "Yes" branch from the block 268 is taken. In block 272, HOLD is set equal to 1, so OMPI that the speech processor 28 is put into a hold state, which means that the speech processor will release busses 32 and 34 of Fig. 1 for use by the processor 20. In block 274, busses 32 and 34 are enabled by making hardware signal B12 for the buffers 36 and 38 equal to 1. The system, then transfers the station number jj and the position of the station location from the processor 20 to the memory 30, and sets the transfer indicator TRFFLG equal to one. This is accomplished by setting memory location 142 of- the memory 30 equal to TLT(jj) in block 278, and by setting memory location 144 in the memory 30 equal to jj, which is the station number, in block 280, and by setting memory location 145 of memory 30 equal to one. The value of TLT(j) is either 0 or 1, indicating that the selected station is either to the right or to the left of the main queue. When these settings have been accomplished, the busses 32 and 34 are released, by setting the signal B12 equal .to 0 in block 282. The signal HOLD is set equal to 0 in block 284, freeing the speech processor to function and to deliver the message. The process then proceeds to block 286 in which the value LASTM is set equal to 0 to signify that the message has been delivered. Interrupt is then disabled in block 287 and * the timer for the selected station is then activated by setting DAT(jj) equal to 1 in block 288, and the new customer is added to the local queue total for the station j by setting PTAT(jj) equal to PTAT(jj) + 1 in block 290. In block 291 interrupt is enabled and from this block, the process continues over paths 2,32 and 264 to return to block 196 for further updating of the timers. This concludes the description of the main program for the system, as contained in Figs. 6A, 6B and 6C. The manner in which the interrupt service routine functions to interrupt the main program is best explained by reference to the flow diagram of Fig. " 7. τ_ ?. Referring to that Figure, the interrupt service routine becomes active each time that a service station operator depresses an "open" key 52 or a "close" key 54. It will be recalled from the previous description of the system of Fig. 1 that the signal resulting from the depression of a key 52 or 54 is transmitted to the switch detector and encoder 60, which generates a first signal XNTRl which is applied to the processor 20 ; a second signal OCF identifying the type of key depressed, which utilizes one of five parallel lines applied to the peripheral interface 62 from the switch detector and encoder 60; and a third signal utilizing the other four lines applied to the peripheral interface 62, which provides the identifying number of the service station in which the key 52 or 54 has been depressed. These data are entered into the processor 20 via bus 26. Thus, in Fig. 7, the routine is entered in • block 300, and j, (representing the specific station number that has actuated on "open" or "close"- key) is set equal to the station number in block 302. The value of the signal OCF is tested in decision block 304 as to its equality to zero. If OCF is not equal to zero, indicating that the "open" key of the station was de¬ pressed, the process proceeds to decision block 306, where the equivalents of the value PTAT(J 1 ) to 0 is tested. If PTAT(j, ) is equal to zero, this means that there is no customer in the local queue, and the process continues via path 308 to the block 310, in which the value DAT (j,) is set equal to 2 to indicate to the main program that station j. has actuated the "open" key. The routine then returns to the main program over the path 312. If the value PTAT(j 1 ) is not equal to zero, meaning that there is at least one customer in the local queue, the process continues to block 314, in which the value of PTAT(j. ) is decreased by one, removing one customer from the queue total. The process then con¬ tinues to block 310-, and over path 312 to return to the main program, as before. If OCF is equal to zero, this means that the service station is closing, and that the station number j, must therefore be removed from the various tables. Proceeding from decision block 304, the station number j. will be removed, if present, from the table NATT. The value of DAT(j,) will be set equal to 3, indicating to the main program that station j. has closed. The value of the timer CDT(j.) will be reset to the value of DPDT(j,). To do this, p is set equal to 1 in block 318 and the process proceeds to the decision block 320, where the equivalence of NATT(p) to j. is tested. If NATT(p) is not equal to j., the process continues to the decision block 322, where the equivalence of p (table position) to P (total number of table positions) is tested. If p equals P, the system proceeds over path 324 to block 326, where DAT(j,) is set equal to three; then to block 328, where CDT(j.) is set equal to DPDT(j,), and then over path 330 to return to the main program. If p does not equal P, p is incremented by one in block 332, and the process returns to decision block 320 over path 334. The equivalence of NATT(p) to j- is again tested in block 320. If there is no equivalence, the process proceeds to decision block 322 and continues the routine previously described, from that block * If NATT(p) equals j., the routine continues over path 336 to block 338, where the value ' ATT(p) is set equal to the value of NATT(p + 1), and to decision block 340, where the equivalence of p to P-l is tested. If p does not equal P-l, the process loops through block 342, where p is set equal to p + 1, back to block 338. If p is equal to P-l in block 340, the process continues over path 344 to block 346, where P is set equal to P-l, and then to block 348, where NATT(P) is set equal to zero. The process continues through pre iously-men- tioned blocks 326 and 328 to the path 330, to return to the main program, as before. This concludes the description of the interrupt service routine for the system, as contained in Fig. 7. The manner in which the speech processor routine functions to- control the system of Fig. 1 to produce voice messages to direct customers from a main queue to a selected one of a plurality of local queues 5 will now be explained. The speech processor 28 functions essentially as a "slave" of the main processor 20. For purposes of this description, let it be assumed that the system is ready to deliver a spoken message to the customer at the 10 head of the main queue. It is first necessary to transfer data consis¬ ting of the station number and the station location from the processor 20 to the processor 28. A "flag" desig¬ nated TRFFLG which indicates whether or not such a 15 transfer has taken place is located in the speech proces¬ sor memory 30. The processor memory 30 is also desig¬ nated and referred to in the flow diagram of Figs. 8A and 8B, and in the ensuing description, as M2. No data transfer is indicated by setting TRFFLG equal to zero, 20 while setting TRFFLG equal to one indicates that data have been transferred. The processor 20 sets the value of the HOLD line equal to one in order to indicate a request for use of the address bus 32 an " the data bus 34. The speech 25 processor 28, upon receiving the HOLD request, relin¬ quishes use of these buses as soon as any current bus data transfers are completed. The processor 20 sets the value of the line B12 equal to one in order to condition buffers 36, 38 to 30 connect bus 24 to bus 32 and to connect bus 26 to bus 34. The processor 20 then transfers the value of the selected service station number and location to the Speech Processor Memory 30, and sets the value of the flag TRFFLG to equal one. Following this, the busses 24 35 and 26 are disconnected from the busses 32 and 34, respectively, by setting the value of the line B12 equal to zero. The HOLD condition is then removed by the processor 20 by setting HOLD equal to zero, so that the OMPI Speech Processor 28 regains access to its busses 32 and 34. The processor 20 then continues with the execution of the main program of Figs. 6A, 6B and 6C , while the speech processor -28 processes the message and delivers the speech data to the speech synthesizer 80. Operation of the system by the speech processor program may best be understood by reference to the flow diagram of Figs. 8A and 8B. 31ock 360 of this diagram represents an "idle" state, in which the processor 28 will be, when a message has been delivered, and it is waiting for new data constituting the next message to be % transmitted from the processor 20. In decision block 362 of block 360, the equi¬ valence of the value of TRFFLG to one is tested. So long as TRFFLG. is equal to zero, the idle condition continues. When TRFFLG becomes equal to one, new data is present in the memory.30, and the process proceeds to block 364, where the BUSY line is set equal to one, to inform the processor that the speech processor 28 is entering the BUSY state. In block 366, the flag TRFFLG is set equal to zero. The process then continues to the dashed block 368, in which the message addresses are compiled in the section designated by the reference character 178 of the memory 30. First, in block 370, the contents of M2(c), that is, the starting address of Message 1 ("PLEASE PROCEED TO YOUR"), found in location 146 of memory 30 (Fig. 2), is entered in M2(z), that is, the speech address list, designated by reference character 178 in the memory 30. Value z is the starting address of the speech address list section. In decision block 372, the equivalence of M2(b), that is, the contents found in location repre¬ sented by reference character 144 in the memory 30, to zero is tested. It will be recalled that the value at M2(b) determines the position of the selected service station, whether to the right or the left of the main queue. If the value found at M2(b) is equal to zero, the process proceeds to block 374, in which the second location of the speech address list, represented by M2(z+1) is provided with the address of Message 3 ("RIGHT"), stored in location e, designated by reference character 150 (Fig. 2). If the value found at M2(b) is not equal to zero, the process proceeds to block: 376, in which the second location of the speech address list, represented by M2(z+1) is provided with the address of Message 4 ("LEFT"), stored in location f, designated by reference character 152 (Fig. 2). From either of the blocks 374 or 376, the process continues to block 378, in which the third location of the speech address list, represented by M2(z+2), is provided with the address of Message 2 ("TO STATION"), stored in location d, designated by reference character 148 (Fig. 2). The process then continues to block 330, in which the -fourth location of the speech address list, represented by M2(z+3), is provided with an address stored in the location of memory 30 determined by adding the address f to the value of the selected service station stored in location a (reference character 142). Thus, if service station number one were selected, the value of address f would be increased by one, which is address g (reference character 154), which contains the Message 5 address. In location 174 (Fig. 2), it will be noted that Message 5 is "One", which is the number of the selected station. The process then continues to block 382, in which the fifth location of the speech address list, represented by M2(z+4), is set equal to zero to signify the end of the message. The process proceeds to block 384, in which the value of register P3 (contained in section 138 of memory 30) is set equal to z, the starting address of the speech address list. Also in block 384, the line GATECK applied to the gate 86 (Fig. 1) is set equal to OMPI one, thus passing the signal CKS from the timer 84 to the speech synthesizer 80. Next, as seen in block 386, the value found at location addressed by register P3 is put into the regis- ter P4 (also in location 138 of the memory 30). In block 388, the value stored in the register P3 is in¬ creased by one. ' The register P3 points to the starting address of the next message, and the register P4 contains the address of the present message to be delivered. The process proceeds to decision block 390 in which the equivalence of P4 to 0 is tested. If P4 is equal to 0, all of the messages in the speech address list have been delivered, and the operation continues over path 392, setting GATECK equal to 0 in block 394, setting BUSY equal to 0 in block 396, and returning to the idle state represented in block 360. If P4 is found not to be equal to 0 in block 390, the process continues over path 398 to block 400 (Fig. 8B) in which a memory word W, which contains eight bits of data, located in the work area found in area 136 of memory 30, is set equal to the value found at memory 30 location indexed by P4. It may -be noted that some or all of the various messages contained in locations 166 to 176 of the memory 30 may be the equivalent of a. number of words W in length, and that these messages are therefore transmitted from the memory 30 to the speech synthesizer 80 in a number of serial eight bit segments. Memory location W acts as a one-word buffer for the speech data contained in the memory 30. The eight bits of speech data contained in the word W are shifted serially out on the line DIGIDATA to the speech synthe¬ sizer 80. The bit position to be accessed in the word W is signified by the value I, which is embodied in an eight bit software counter situated in work area loca- tion 136 of the memory 30. The value I is initialized to 1 in block 402. The process proceeds to decision block 404, where further operation awaits the application of a "■• Q : J £« ' signal INTR2 to the processor 28 from the pulse generator 88 (Fig. 1). So long as the signal INTR2 is not equal to one, the process cycles through the decision block 404. When INTR2 becomes equal to one, the process continues to block 406, where the signal DIGIDATA is set equal to bit I of word W, and then to decision block 408, where the equivalence of I to 8 is tested. If I is not equal to 8, the process loops from the decision block over the path 410 to the block 412, where the value of I is incremented by one, and then back to decision block 404, so that all eight bits of the word W are serially included „in the signal DIGIDATA. If. I is found to be equal to 8 in block 408, then the value P4 is increased by 1 in block 414, and the process proceeds to decision block 416, where a determination is made as to whether the end of the message has been reached. If it has not been reached, the process loops back, over path 418 to block 400, where W is set equal to M2(?4), comprising the next eight bits of speech data, and then proceeds as previously described to serially output this data in the signal DIGIDATA to the speech synthesizer 80. If the message is found in block 416 to be completed, the process loops back over the path 420 to the block 386, where P4- is set equal to M2(P3), repre- senting the starting address of the next message, and then continues as previously described. OMPI

Claims: CLAIMS : 1. Customer queue control apparatus for an establishment having a plurality of service stations (40-50), including customer directing means (28, 80, 82) adapted to provide directions for the customer at the head of a main queue to go to one of said plurality of service stations (40-50), characterized by time deter¬ mining means (20, 22) coupled to said customer directing means and adapted to permit formation of local queues at said service stations (40-50) and to determine which service station has a local queue expected to provide the shortest waiting time , for said customer, said directing means (28, 80, 82) being adapted to direct said customer to the thus determined service, station. 2. Customer queue control apparatus accord-r ing to claim 1, wherein said time determining means (20, 22) includes counting means (110) adapted' to main¬ tain a count of the number of customers in each local queue, and timing means (106, 116) ' adapted to provide respective timed periods for said service stations (40-50) whereby said customer directing means (28, 80, 82) is inhibited from directing said customer to service stations for which the associated timed periods are effective and for which more than a predetermined number of customers are in the associated local queues. 3. Customer queue control apparatus accord¬ ing to claim 2, characterized by next available station storage means (112) adapted to store identifying indicia for said service stations (40-50) in an order corres- ponding to the order in which the .corresponding local queues are to be selected for direction of customers thereto. 4. Customer queue control apparatus accord¬ ing to claim 3, characterized in that said time OMPI 4. (concluded ) determining means (20, 22) are adapted to decrement said ' timing means (106, 116) whereby said timed periods are terminated upon the respective timing means (106, 116) being decremented to zero, and to cause identifying indicia for a service station for which the timed period has terminated to be entered into said next available station storage means (112). 5. Customer queue control apparatus accord¬ ing to claim 4, wherein said service- stations (40-50) are provided with respective switching means (52) adapted to provide signals representing that customers have completed their operations at the service stations and have been removed from the local queues. 6. Customer queue control apparatus accord¬ ing to claim, 5 wherein said switching means includes first and second ' switching devices (52-54) adapted to provide signals indicating that the associated service station is open and closed for business respectively. 7. Customer queue control apparatus accord¬ ing to claim 1, characterized by detection means (66) adapted to detect the presence of a customer at the head of said main queue. 8. Customer queue control- apparatus accord¬ ing to claim 1, characterized in that said customer directing means includes synthesized voice generating means. 9. Customer queue control apparatus accord¬ ing to claim 8, characterized in that said synthesized voice generating means includes message storage means (132) adapted to store message segments which may be selected to constitute the content of a message, and OMPI 9. ( concluded ) responsive to data from said time determining means (20, 22) to provide a message representing said determined service station, which message is applied in operation to speech producing means (80, 82). _,υ i-"C- OMPI

Inventors: ANAVIL YODHIN, HALE WILLIAM JOEL, LEE KWANG HIE, PAGANINI BRUNO JOSE
Applicants: NCR CO, NCR CORP
Application year: 1982
Main classification: G08B5
IPC codes: G07C11, G08B3, G08B5, G08B7