1. Broadcast Programming: Techniques & ABC’s Weekly Lineup Andrew Gonzalez Eli Levin Morgan Strauss

2. ABC’s 2010 Fall Schedule

3. Scheduling Strategies Lead-off Lead-in Hammocking Block Programming Tent-Poling

4. Lead-off Lead-in Hammockin g Block Programming Tent- Poling

5. A18-49+ A18-49+ = 100*(shows average rating/league average) Key: o 0-69: flop o 70-99: marginal o 100-124: solid o 125-149: hit o 150-199: big hit o 200+: megahit For Friday: o 60-74: solid o 75+: hit

6. Our Problem P6 | prec,d j,w j | max j (A18-49+) -> max t,d (A18-49+) o prec: Dancing with the Stars  Performance show must be broadcasted before the results show o p j : Duration of shows (1,2,4) o w j : A18-49+ rankings *Heuristic Based Objectives

7. Machine Environment P6: M1, M2, M3, M4, M5, M6 o Parallel Machines Sunday through Friday, respectively

8. Machine Environment Diagram

9. Constraint Set prec, (r j ), d j, w j Precedence Constraint o See: Dancing With The Stars o Lead-In Release/Due Date o all shows due by 11 Weighted on A18-49+

10. Variable Objective See Algorithm for Pure Programming Variability of Objectives o Overall Viewership o Promote specific shows o others How do we achieve these? o With different heuristic approaches conditioned off of our base algorithm

11. 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 j prec according to its precedence constraint Delete the lowest ranked show(s) from a feasible time slot for j and/or j prec Add the deleted show(s) back to Shows and any remaining time back to Slots 7. If t + p j <= 6 & (t,d) thru (t+p j,d) is NOT already scheduled Schedule show j in slots (t,d) thru (t+p j,d) in the matrix Remove show j from Shows & remove slot (t,d) thru (t+p j,d) from Slots 8. If (t+p j,d) is scheduled already Set the iterative variable (t,d): next highest ranked slot in Slots Go back to Step 6

12. Ranking Time Slots & Shows

13. Our Schedule for ABC’s Weekly Lineup

14. ABC’s Lineup vs. Our Heuristic

15. Going Forward Implement scheduling strategies into our heuristic o Lead-off: early due date o Lead-in: precedence constraint o Hammocking: precedence constraint (other variations exist as well) o Block Programming: precedence constraint, scheduling on same machine o Tent-Poling: release time-due-date combination