Endüstri bazlı kısıtlar ve hedef kitleye bağlı reytinglere göre televizyon reklam çizelgelemesi

Commercials serve as the primary revenue stream for TV networks. However, these networks must comply with sectoral and governmental regulations governing the scheduling and billing of advertisements. This study addresses the challenge of selecting and scheduling commercials for one of the most prominent TV networks in Turkey, where stringent regulatory constraints and audience-specific requirements complicate the process of finding even a feasible schedule, particularly under high utilization. Moreover, the revenue generated by most commercials is highly dependent on the ratings achieved from their target audience, further increasing the impact of the scheduling process. The commercial scheduling problem can be framed as a non-renewable resource-constrained identical parallel machine scheduling problem, characterized by machine- and time-dependent rewards and constraints, with the objective of maximizing the total reward. To tackle this intricate problem, we present two MIP formulations and a novel GRASP enhanced with path-relinking and VND. Additionally, we reformulate the problem as a TOPTW and benchmark the GRASP against a HABC algorithm. Experiments with 10 real-world instances demonstrate that the GRASP heuristic consistently achieves near-optimal solutions with minimal computational effort.