Andrew Gonzalez Eli Levin Morgan Strauss ABCs 2010 Fall Schedule Scheduling Strategies Leadoff Leadin Hammocking Block Programming TentPoling Leadoff Leadin Hammocking Block Programming ID: 332392
Download Presentation The PPT/PDF document "Broadcast Programming: Techniques & ..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Slide1
Broadcast Programming: Techniques & ABC’s Weekly Lineup
Andrew Gonzalez
Eli Levin
Morgan StraussSlide2
ABC’s 2010 Fall ScheduleSlide3
Scheduling Strategies
Lead-off
Lead-in
Hammocking
Block Programming
Tent-PolingSlide4
Lead-off
Lead-in
Hammocking
Block Programming
Tent-PolingSlide5
A18-49+
A18-49+ = 100*(shows average rating/league average)
Key:
0-69: flop
70-99: marginal
100-124: solid
125-149: hit
150-199: big hit
200+: megahit
For Friday:
60-74: solid
75+: hitSlide6
Our Problem
P6 | prec,d
j
,w
j
| max
j
(A18-49+) -> max
t,d (A18-49+)
prec: Dancing with the Stars
Performance show must be broadcasted before the results showpj: Duration of shows (1,2,4)
wj: A18-49+ rankings*Heuristic Based ObjectivesSlide7
Machine Environment
P6: M1, M2, M3, M4, M5, M6
Parallel Machines Sunday through Friday, respectivelySlide8
Machine
Environment
DiagramSlide9
Constraint Set
prec, (r
j
), d
j
, w
j
Precedence Constraint
See: Dancing With The Stars
Lead-In
Release/Due Date
all shows due by 11Weighted on A18-49+Slide10
Variable Objective
See Algorithm for Pure Programming
Variability of Objectives
Overall Viewership
Promote specific shows
others
How do we achieve these?
With different heuristic approaches conditioned off of our base algorithmSlide11
Our Scheduling Heuristic
1. Create an empty 6x6 matrix with starting times 1-6 (8:00-10:30) on the columns & days 1-6 (Monday-Sunday) on the rows
2. Create the set Shows containing all aired shows in 2010-11 & the set Slots containing all available slots in the matrix
3. Sort all shows in descending order by 2010-11 A18-49+ rankings
4. Sort all time slots in descending order by historical A18-49+ rankings
5. Set j: the next highest ranked show in Shows & set (t,d): the next highest ranked slot in Slots
6. If j has a precedence constraint
Do Steps 7 & 8 together for j and j
prec
maximizing the sum of A18-49+ rankings for both feasible time slots
If there is no room for j and/or jprec according to its precedence constraint
Delete the lowest ranked show(s) from a feasible time slot for j and/or jprec Add the deleted show(s) back to Shows and any remaining time back to Slots7. If t + pj
<= 6 & (t,d) thru (t+pj,d) is NOT already scheduledSchedule show j in slots (t,d) thru (t+pj,d) in the matrix
Remove show j from Shows & remove slot (t,d) thru (t+pj,d) from Slots8. If (t+pj,d) is scheduled already
Set the iterative variable (t,d): next highest ranked slot in Slots Go back to Step 6Slide12
Ranking Time Slots & ShowsSlide13
Our Schedule for ABC’s Weekly LineupSlide14
ABC’s Lineup vs. Our HeuristicSlide15
Going Forward
Implement scheduling strategies into our heuristic
Lead-off: early due date
Lead-in: precedence constraint
Hammocking: precedence constraint (other variations exist as well)
Block Programming: precedence constraint, scheduling on same machine
Tent-Poling: release time-due-date combination