Method and apparatus for priority-based jukebox queuing

• US 6,421,651 B1
• Filed: 01/12/2000
• Issued: 07/16/2002
• Est. Priority Date: 03/31/1998
• Status: Expired due to Term

• Current Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Original Assignee: Walker Digital LLC (Walker Innovation Inc. (f/k/a Patent Properties, Inc.))
• Inventors: Jorasch, James A., Tedesco, Daniel E., Mik, Magdalena
• Primary Examiner(s): Poinvil, Frantzy
• Assistant Examiner(s): KANOF, PEDRO R
• Application Number:
  US09/481,348
• Time in Patent Office: 916 Days
• Field of Search: 705/8, 705/6, 705/7, 705/5
• US Class Current: 705/7.26
• CPC Class Codes: G06Q 10/02 Reservations, e.g. for tickets, services or events
• CPC Class Codes: G06Q 10/025 Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
• CPC Class Codes: G06Q 10/06312 Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
• CPC Class Codes: G06Q 10/06314 Calendaring for a resource
• CPC Class Codes: G06Q 10/06315 Needs-based resource requirements planning or analysis
• CPC Class Codes: G06Q 10/06316 Sequencing of tasks or work
• CPC Class Codes: G07F 17/305 for record players

Abstract

A method and apparatus are described for managing a request queue for a jukebox system. According to one aspect of the present invention, a method is disclosed for managing a queue of a jukebox. The method includes the step of arranging a set of service identifiers in a queue based upon a time of receipt corresponding to each service identifier. The method also includes the step of receiving a request to expedite an identified service corresponding to one service identifier in the queue. According to the method, payment is then received for the request to expedite the identified service. The method further includes the steps of rearranging the plurality of service identifiers in the queue, thereby causing the identified service to be expedited, and performing the service.

Claims

1. A method, comprising:

arranging a plurality of service identifiers in a queue associated with a vending machine, the queue having a top and a bottom;

receiving a request to place a first service identifier in an intermediate position in the queue, the intermediate position not being at the top of the queue and not being at the bottom of the queue;

receiving a payment associated with the request; and

in response to the request and the payment, placing the first service identifier at the intermediate position in the queue.

2. The method of claim 1, wherein the vending machine comprises a jukebox and the first service identifier is associated with a song selection.

3. The method of claim 2, further comprising placing a second service identifier in a position in the queue that is closer to the top of the queue than the first service identifier.

4. A method, comprising:

arranging a plurality of service identifiers in a queue associated with a vending machine;

receiving a first request to change the position of a first service identifier in the queue;

receiving a first payment associated with the first request;

in response to the first payment and the first request, moving the first service identifier towards a top of the queue;

receiving a second request to change the position of a second service identifier in the queue;

receiving a second payment associated with the second request; and

in response to the second payment and the second request, moving the second service identifier to a position in the queue that is ahead of the first service identifier.

5. The method of claim 4, wherein the vending machine comprises a jukebox and the first and second service identifiers are associated with respective song selections.

6. An apparatus for managing a queue of a jukebox, the apparatus comprising:

a memory for storing;

a plurality of service identifiers forming a queue, each of the service identifiers corresponding to a respective song selection; and

a program code for arranging the service identifiers;

a processor connected to the memory; and

a point-of-sale system connected to the processor;

wherein the processor is operative to execute the program code to perform the steps of;

arranging the plurality of service identifiers based upon a time of receipt corresponding to each service identifier;

receiving information from the point-of-sale system;

rearranging the plurality of service identifiers on the basis of the information received from the point-of-sale system; and

playing the song selections in accordance with an order of the rearranged plurality of service identifiers.

7. A method, comprising:

arranging a plurality of service identifiers in a queue associated with a vending machine;

receiving a request to change the position of a first service identifier in the queue;

receiving a code associated with the request;

determining whether the received code matches a stored code; and

if it is determined that the received code matches the stored code, changing the position of the first service identifier in the queue in accordance with the request.

8. The method of claim 7, wherein the vending machine comprises a jukebox and the first service identifier is associated with a song selection.