Adaptive Scheduling System for Advertising Spots
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current scheduling systems for advertising spots in various media are inefficient and ineffective due to their inability to consider multiple parameters, adapt to changing conditions, and handle the complexity of scheduling across numerous networks and channels, leading to inefficiencies and high costs.
Innovation Solution
An adaptive scheduling system that uses a ranking algorithm to select optimal commercial break locations based on user-defined fixed and relative factors, allowing for dynamic assignment of spots across multiple networks and channels, and includes a microprocessor-based system for determining costs and prioritizing spot placement.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If current scheduling systems use only a few inputs (rate and contract line priority) for determining spot scheduling, then the system operation is simple, but the scheduling effectiveness and adaptability are insufficient
Solution Approach 1:
The patent transforms the scheduling decision-making process from considering only a few static parameters (rate and priority) to evaluating multiple dynamic parameters including cost, priority, fit quality, and availability. The system calculates a composite score for each potential spot placement by weighing these multiple parameters, enabling adaptive scheduling decisions that respond to changing conditions while maintaining systematic control through algorithmic processing.
2Manufacturing precision
If current systems manually rearrange schedules to accommodate higher-priority spots, then scheduling accuracy can be improved, but time consumption and operational effort increase significantly
Solution Approach 1:
The patent pre-calculates and stores availability information for commercial breaks before the actual scheduling process begins. When a spot needs to be scheduled, the system immediately queries this pre-prepared availability data rather than performing time-consuming manual rearrangements. This preliminary preparation enables rapid, accurate scheduling decisions without requiring iterative manual adjustments.
Solution Approach 2:
The patent replaces manual scheduling operations with an automated computer-based system that algorithmically evaluates multiple parameters and calculates optimal spot placements. The system uses software to perform what would otherwise require manual intervention, significantly reducing both time and human effort while maintaining or improving scheduling accuracy through consistent application of defined criteria.
3Productivity
If current scheduling systems use fixed rules for spot placement, then the system operation is straightforward, but the system cannot handle the complexity of multiple networks and channels efficiently
Solution Approach 1:
The patent creates a universal scheduling system that can handle multiple networks, channels, and spot types through a single integrated platform. The system uses a standardized data structure and algorithmic approach that works across different media types (TV, radio, online, mobile), eliminating the need for separate scheduling processes for each network or channel while maintaining the ability to handle their unique requirements through configurable parameters.
4Adaptability or versatility
If current systems require large amounts of time and effort to change priorities, then system stability is maintained, but the system lacks flexibility to adapt to changing advertising demands
Solution Approach 1:
The patent implements dynamic priority handling where spot priorities and scheduling parameters can be easily modified through software configuration rather than requiring system restructuring. The algorithm automatically recalculates optimal placements when parameters change, allowing rapid adaptation to new advertising demands without manual intervention or time-consuming reconfiguration of the entire scheduling system.
Data Source
AI summary
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.


