System and method for an adaptive scheduling system architecture
First Claim
1. A method of scheduling, comprising:
- (a) providing an ordered list of advertising spots (“
spots”
) to be scheduled wherein each spot has an associated scheduling factor;
(b) selecting a first one of said spots;
(c) providing plural commercial break locations (“
breaks”
) for one or more networks;
(d) determining a first cost for each of said breaks as a function of a predetermined algorithm by a microprocessor based system wherein said algorithm determines said first cost as a function of a predetermined fixed parameter, and wherein said fixed parameter is user defined; and
(e) assigning said first spot to one of said breaks (“
first break”
) which has a lowest first cost(f) selecting a second one of said spots;
(g) determining a second cost for each unassigned break as a function of said first cost and as a function of a predetermined relative parameter; and
(h) assigning said second spot to one of said unassigned breaks (“
second break”
) which has a lowest second cost.
7 Assignments
0 Petitions
Accused Products
Abstract
The disclosed embodiments describe an automatic, adaptive system and method for efficiently and effectively scheduling advertising spots in commercial break locations across various networks, zones, channels, dates, times, and specific products, for example. The disclosed embodiments make use of fixed and relative factors, that may be user-defined, which assign a “cost” to one or more particular breaks which thereby allow for quick and accurate scheduling of spots. The “costs” may represent a value, or desirability, of a break for the advertiser and may be a function of both the fixed and relative factors. The fixed and relative factors may be configurable and may change for different advertising clients, different contract lines, different networks, different spot placement, etc.
The placement of spots may be accomplished through the use of an ordered list which may be generated based on a number of inputs that may be user-selected. A non-limiting example of user inputs may include: spot length, spot cost, contract line priority, beginning date/time of contract line, ending date/time of contract line, a predefined value index for the client, and contract line number, among others.
61 Citations
33 Claims
-
1. A method of scheduling, comprising:
-
(a) providing an ordered list of advertising spots (“
spots”
) to be scheduled wherein each spot has an associated scheduling factor;(b) selecting a first one of said spots; (c) providing plural commercial break locations (“
breaks”
) for one or more networks;(d) determining a first cost for each of said breaks as a function of a predetermined algorithm by a microprocessor based system wherein said algorithm determines said first cost as a function of a predetermined fixed parameter, and wherein said fixed parameter is user defined; and (e) assigning said first spot to one of said breaks (“
first break”
) which has a lowest first cost(f) selecting a second one of said spots; (g) determining a second cost for each unassigned break as a function of said first cost and as a function of a predetermined relative parameter; and (h) assigning said second spot to one of said unassigned breaks (“
second break”
) which has a lowest second cost. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method of scheduling, comprising:
-
(a) providing an ordered list of advertising spots (“
spots”
) to be scheduled wherein each spot has an associated scheduling factor;(b) selecting a first one of said spots; (c) providing plural commercial break locations (“
breaks”
) for one or more networks;(d) determining a first cost for each of said breaks as a function of a predetermined algorithm by a microprocessor based system wherein said algorithm determines said first cost as a function of a predetermined fixed parameter, and wherein said fixed parameter is user defined; and (e) assigning said first spot to one of said breaks (“
first break”
) which has a lowest first cost(f) selecting a second one of said spots; (g) determining a second cost for each unassigned break as a function of said first cost and as a function of a predetermined relative parameter; (h) determining that no unassigned breaks have a second cost less than a second predetermined amount thereby preventing said second spot from being assigned to one of said unassigned breaks; (i) determining that said second spot has a ranking greater than a ranking for said first spot; (j) bumping said first spot from said first break; and (k) assigning said second spot to said first break.
-
-
10. A method of scheduling, comprising:
-
(a) providing an ordered list of advertising spots (“
spots”
) to be scheduled wherein each spot has an associated scheduling factor;(b) selecting a first one of said spots; (c) providing plural commercial break locations (“
breaks”
) for one or more networks;(d) determining a first cost for each of said breaks as a function of a predetermined algorithm by a microprocessor based system wherein said algorithm determines said first cost as a function of a predetermined fixed parameter, and wherein said fixed parameter is user defined; and
,(e) assigning said first spot to one of said breaks (“
first break”
) which has a lowest first cost;(f) selecting a second one of said spots; (g) determining a second cost for each unassigned break as a function of said first cost and as a function of a predetermined relative parameter; (h) determining that no unassigned breaks have a second cost less than a second predetermined amount thereby preventing said second spot from being assigned to one of said unassigned breaks; (i) determining that said second spot has a ranking less than a ranking for said first spot; and (j) placing said second spot on an exceptions list and removing said second spot from said ordered list of spots. - View Dependent Claims (11)
-
-
12. A computer program stored on non-transitory computer-readable media including program instructions for scheduling an advertising spot, the program comprising program instructions for:
-
(a) providing an ordered list of advertising spots (“
spots”
) to be scheduled wherein each spot has an associated scheduling factor;(b) selecting a first one of said spots; (c) providing plural commercial break locations (“
breaks”
) for one or more networks;(d) determining a first cost for each of said breaks as a function of a predetermined algorithm wherein said algorithm determines said first cost as a function of a predetermined fixed parameter, and wherein said fixed parameter is user defined; and (e) assigning said first spot to one of said breaks (“
first break”
) which has a lowest first cost(f) selecting a second one of said spots; (g) determining a second cost for each unassigned break as a function of said first cost and as a function of a predetermined relative parameter; and (h) assigning said second spot to one of said unassigned breaks (“
second break”
) which has a lowest second cost. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19)
-
-
20. A computer program stored on non-transitory computer-readable media including program instructions for scheduling an advertising spot, the program comprising program instructions for:
-
(a) providing an ordered list of advertising spots (“
spots”
) to be scheduled wherein each spot has an associated scheduling factor;(b) selecting a first one of said spots; (c) providing plural commercial break locations (“
breaks”
) for one or more networks;(d) determining a first cost for each of said breaks as a function of a predetermined algorithm wherein said algorithm determines said first cost as a function of a predetermined fixed parameter, and wherein said fixed parameter is user defined; and (e) assigning said first spot to one of said breaks (“
first break”
) which has a lowest first cost;(f) selecting a second one of said spots; (g) determining a second cost for each unassigned break as a function of said first cost and as a function of a predetermined relative parameter; (h) determining that no unassigned breaks have a second cost less than a second predetermined amount thereby preventing said second spot from being assigned to one of said unassigned breaks; (i) determining that said second spot has a ranking greater than a ranking for said first spot; (j) bumping said first spot from said first break; and (k) assigning said second spot to said first break.
-
-
21. A computer program stored on non-transitory computer-readable media including program instructions for scheduling an advertising spot, the program comprising program instructions for:
-
(a) providing an ordered list of advertising spots (“
spots”
) to be scheduled wherein each spot has an associated scheduling factor;(b) selecting a first one of said spots; (c) providing plural commercial break locations (“
breaks”
) for one or more networks;(d) determining a first cost for each of said breaks as a function of a predetermined algorithm wherein said algorithm determines said first cost as a function of a predetermined fixed parameter, and wherein said fixed parameter is user defined; and (e) assigning said first spot to one of said breaks (“
first break”
) which has a lowest first cost;(f) selecting a second one of said spots; (g) determining a second cost for each unassigned break as a function of said first cost and as a function of a predetermined relative parameter; (h) determining that no unassigned breaks have a second cost less than a second predetermined amount thereby preventing said second spot from being assigned to one of said unassigned breaks; (i) determining that said second spot has a ranking less than a ranking for said first spot; and (j) placing said second spot on an exceptions list and removing said second spot from said ordered list of spots. - View Dependent Claims (22)
-
-
23. A system for scheduling, comprising:
-
a database comprising; an ordered list of advertising spots (“
spots”
) to be scheduled wherein each spot has an associated scheduling factor, anda plurality of commercial break locations (“
breaks”
) for one or more networks; anda microprocessor operatively connected to said database, said microprocessor comprising; circuitry for selecting a first one of said spots; circuitry for determining a first cost for each of said breaks as a function of a predetermined algorithm wherein said algorithm determines said first cost as a function of a predetermined fixed parameter, and wherein said fixed parameter is user defined; and circuitry for assigning said first spot to one of said breaks (“
first break”
) which has a lowest first cost;circuitry for selecting a second one of said spots; circuitry for determining a second cost for each unassigned break as a function of said first cost and as a function of a predetermined relative parameter; and circuitry for assigning said second spot to one of said unassigned breaks (“
second break”
) which has a lowest second cost. - View Dependent Claims (24, 25, 26, 27, 28, 29, 30)
-
-
31. A system for scheduling, comprising:
-
a database comprising; an ordered list of advertising spots (“
spots”
) to be scheduled wherein each spot has an associated scheduling factor, anda plurality of commercial break locations (“
breaks”
) for one or more networks; anda microprocessor operatively connected to said database, said microprocessor comprising; circuitry for selecting a first one of said spots; circuitry for determining a first cost for each of said breaks as a function of a predetermined algorithm wherein said algorithm determines said first cost as a function of a predetermined fixed parameter, and wherein said fixed parameter is user defined; and circuitry for assigning said first spot to one of said breaks (“
first break”
) which has a lowest first cost;wherein said circuitry for assigning said second spot determines that no unassigned breaks have a second cost less than a second predetermined amount thereby preventing said second spot from being assigned to one of said unassigned breaks, determines that said second spot has a ranking greater than a ranking for said first spot, bumps said first spot from said first break, and assigns said second spot to said first break.
-
-
32. A system for scheduling, comprising:
-
a database comprising; an ordered list of advertising spots (“
spots”
) to be scheduled wherein each spot has an associated scheduling factor, anda plurality of commercial break locations (“
breaks”
) for one or more networks; anda microprocessor operatively connected to said database, said microprocessor comprising; circuitry for selecting a first one of said spots; circuitry for determining a first cost for each of said breaks as a function of a predetermined algorithm wherein said algorithm determines said first cost as a function of a predetermined fixed parameter, and wherein said fixed parameter is user defined; and circuitry for assigning said first spot to one of said breaks (“
first break”
) which has a lowest first cost;wherein said circuitry for assigning said second spot determines that no unassigned breaks have a second cost less than a second predetermined amount thereby preventing said second spot from being assigned to one of said unassigned breaks, determines that said second spot has a ranking less than a ranking for said first spot, places said second spot on an exceptions list, and removes said second spot from said ordered list of spots. - View Dependent Claims (33)
-
Specification