SPOT: Scheduling Programs Optimally for Television

This paper introduces SPOT (Scheduling Programs Optimally for Television), an analytical model for optimal prime-time TV program scheduling. Due in part to the advent of new cable TV channels, the competition for viewer ratings has intensified substantially in recent years, and the revenues of the m...

Full description

Saved in:
Bibliographic Details
Main Authors: REDDY, Srinivas K., Aronson, Jay E., Stam, Antonie
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 1998
Subjects:
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/2973
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.lkcsb_research-3972
record_format dspace
spelling sg-smu-ink.lkcsb_research-39722016-03-26T06:12:01Z SPOT: Scheduling Programs Optimally for Television REDDY, Srinivas K. Aronson, Jay E. Stam, Antonie This paper introduces SPOT (Scheduling Programs Optimally for Television), an analytical model for optimal prime-time TV program scheduling. Due in part to the advent of new cable TV channels, the competition for viewer ratings has intensified substantially in recent years, and the revenues of the major networks have not kept pace with the costs of the programs. As profit margins decrease, the networks seek to improve their viewer ratings with innovative scheduling strategies. Our SPOT models for scheduling network programs combine predicted ratings for different combinations of prime-time schedules with a novel, mixed-integer, generalized network-based flow, mathematical programming model, which when solved provides an optimal schedule. In addition to historical performance, subjective inputs from actual network managers were used as input to the network flow optimization model. The optimization model is flexible. It can utilize the managers' input and maximize profit (instead of ratings) by considering not only the revenue potential but also the costs of the shows. Moreover, SPOT can describe the scheduling problem over any time period (e.g., day, week, month, season), and designate certain shows to, and restrict them from, given time slots. The methodology of SPOT is illustrated using data for the first quarter of 1990, obtained from a cable network. The optimization model produces solutions that would have generated an increase of approximately 2% in overall profitability, representing over $6 million annually for the cable network. SPOT not only produces more profitable TV schedules for this network, but also provides valuable general insights into the development of mixed programming strategies for improving future schedules. 1998-01-01T08:00:00Z text https://ink.library.smu.edu.sg/lkcsb_research/2973 info:doi/10.1287/mnsc.44.1.83 Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Television Network Scheduling Generalized Networks Integer Programming Judgmental Models Advertising and Promotion Management Marketing
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Television Network Scheduling
Generalized Networks
Integer Programming
Judgmental Models
Advertising and Promotion Management
Marketing
spellingShingle Television Network Scheduling
Generalized Networks
Integer Programming
Judgmental Models
Advertising and Promotion Management
Marketing
REDDY, Srinivas K.
Aronson, Jay E.
Stam, Antonie
SPOT: Scheduling Programs Optimally for Television
description This paper introduces SPOT (Scheduling Programs Optimally for Television), an analytical model for optimal prime-time TV program scheduling. Due in part to the advent of new cable TV channels, the competition for viewer ratings has intensified substantially in recent years, and the revenues of the major networks have not kept pace with the costs of the programs. As profit margins decrease, the networks seek to improve their viewer ratings with innovative scheduling strategies. Our SPOT models for scheduling network programs combine predicted ratings for different combinations of prime-time schedules with a novel, mixed-integer, generalized network-based flow, mathematical programming model, which when solved provides an optimal schedule. In addition to historical performance, subjective inputs from actual network managers were used as input to the network flow optimization model. The optimization model is flexible. It can utilize the managers' input and maximize profit (instead of ratings) by considering not only the revenue potential but also the costs of the shows. Moreover, SPOT can describe the scheduling problem over any time period (e.g., day, week, month, season), and designate certain shows to, and restrict them from, given time slots. The methodology of SPOT is illustrated using data for the first quarter of 1990, obtained from a cable network. The optimization model produces solutions that would have generated an increase of approximately 2% in overall profitability, representing over $6 million annually for the cable network. SPOT not only produces more profitable TV schedules for this network, but also provides valuable general insights into the development of mixed programming strategies for improving future schedules.
format text
author REDDY, Srinivas K.
Aronson, Jay E.
Stam, Antonie
author_facet REDDY, Srinivas K.
Aronson, Jay E.
Stam, Antonie
author_sort REDDY, Srinivas K.
title SPOT: Scheduling Programs Optimally for Television
title_short SPOT: Scheduling Programs Optimally for Television
title_full SPOT: Scheduling Programs Optimally for Television
title_fullStr SPOT: Scheduling Programs Optimally for Television
title_full_unstemmed SPOT: Scheduling Programs Optimally for Television
title_sort spot: scheduling programs optimally for television
publisher Institutional Knowledge at Singapore Management University
publishDate 1998
url https://ink.library.smu.edu.sg/lkcsb_research/2973
_version_ 1770570681759563776