EVENT SCHEDULING METHOD AND SYSTEM

• US 20090319304A1
• Filed: 06/23/2008
• Published: 12/24/2009
• Est. Priority Date: 06/23/2008
• Status: Abandoned Application

• Current Assignee: Daniel Richard Smith
• Original Assignee: Daniel Richard Smith
• Inventors: Smith, Daniel R.
• Application Number:
  US12/143,870
• Publication Number:
  US 20090319304A1
• Time in Patent Office: Days
• US Class Current: 705/5
• CPC Class Codes: G06Q 10/02 Reservations, e.g. for tickets, services or events
• CPC Class Codes: G06Q 10/109 Time management, e.g. calendars, reminders, meetings or time accounting
• CPC Class Codes: G06Q 10/1093 Calendar-based scheduling for persons or groups

Abstract

A computer implemented method, apparatus and program product automatically schedule events by generating templates of participant pairings based on scheduling stipulations, preferences or other constraints. The generated templates do not typically include any time or location information, which is later combined with the template to form the schedule. Constraints used to generate the template pairings may include secondary match-ups, or pairings, that do not meet a primary preference of a participant. Other constraints may include weighted time slot designators, repeat pairings, crossover games between different leagues, as well as meeting times. The template feature enables constraints to be satisfied before the parings are associated with times.

Claims

1. A computer implemented method of scheduling events involving a plurality of participants, the method comprising:

receiving a plurality of constraints associated with at least one of the plurality of participants;

generating based on a first constraint of the plurality a first template comprising pairings between the participants;

generating based on another constraint of the plurality a second template comprising pairings between the participants;

reconciling the first and second templates;

populating a remaining field of the reconciled template;

automatically associating the reconciled template with a plurality of time slots associated with at least one venue at which the events are to take place; and

outputting a schedule comprising the pairings assigned to the time slots.

2. The method of claim 1, wherein generating at least one of the first and second templates further comprises generating a plurality of templates based on at least one of the constraint or the other constraint.

3. The method of claim 2, further comprising selecting at least the first or second template from among the plurality of templates.

4. The method of claim 1, further comprising automatically generating a pairing absent from the reconciled template.

5. The method of claim 1, wherein receiving the plurality of constraints further includes receiving a constraint comprising at least one of a secondary allocation and a weighted factor.

6. The method of claim 1, wherein receiving the plurality of constraints further includes receiving a constraint comprising a preference selected from a group consisting of:

a date of the event, a time of day for the event, a pairing, a relative sequence of the pairing compared to another pairing, a ranking, and a venue.

7. The method of claim 1, wherein receiving the plurality of constraints further includes receiving a constraint associated with a frequency of how often a preference will be realized.

8. The method of claim 1, wherein receiving the plurality of constraints further includes receiving a constraint associated with a frequency of how often a preference will be unrealized.

9. The method of claim 1, wherein receiving the plurality of constraints further includes receiving a constraint comprising at least one of a primary and secondary allocation.

10. The method of claim 1, wherein receiving the plurality of constraints further includes receiving a constraint associated with at least one of the plurality of participants, wherein the plurality of participants belong to respective teams of different leagues.

11. The method of claim 1, further comprising assigning the constraint to at least one of a league, a team, a plurality of leagues, and a participant.

19. The apparatus of claim 10, wherein the program code is further configured to generate a pairing absent from the reconciled template.

12. An apparatus, comprising:

a processor;

a memory accessible to the processor, the memory including a database storing data pertaining to a plurality of participants to be scheduled in an event; and

program code executable by the processor and configured to receive a plurality of constraints associated with at least one of the plurality of participants, to generate a first template based upon a constraint of the plurality and a second template based on another constraint of the plurality, wherein the templates comprise pairings between the participants, to reconcile the first and second templates, to associate the reconciled template with a plurality of time slots associated with at least one venue at which the events are to take place, and to output a schedule comprising the pairings assigned to the time slots.

13. The apparatus of claim 12, wherein the program code is further configured to generate a plurality of templates based on at least one of the constraint or the other constraint, and to select at least the first or second template from among the plurality of templates.

14. The apparatus of claim 12, wherein the constraint comprises a preference for a repeat pairing.

15. The apparatus of claim 12, wherein the constraint is associated with a frequency of how often a preference will be realized.

16. The apparatus of claim 12, wherein the constraint comprises a secondary allocation.

17. The apparatus of claim 12, wherein the constraint comprises a weighted factor.

18. The apparatus of claim 12, wherein the plurality of participants belong to respective teams of different leagues.

20. A program product, comprising:

program code configured to receive a plurality of constraints associated with at least one of a plurality of participants, to generate a first template based upon a constraint of the plurality and a second template based on another constraint of the plurality, wherein the templates comprise pairings between the participants, to reconcile the first and second templates, to associate the reconciled template with a plurality of time slots associated with at least one venue at which the events are to take place, and to output a schedule comprising the pairings assigned to the time slots; and

a computer readable medium bearing the program code.