<mets:mets OBJID="eprint_4512" LABEL="Eprints Item" xsi:schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mets="http://www.loc.gov/METS/" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mets:metsHdr CREATEDATE="2024-01-01T23:19:08Z"><mets:agent ROLE="CUSTODIAN" TYPE="ORGANIZATION"><mets:name>IIASA Repository</mets:name></mets:agent></mets:metsHdr><mets:dmdSec ID="DMD_eprint_4512_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:titleInfo><mods:title>Optimal Prime-Time Television Network Scheduling</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">S.K.</mods:namePart><mods:namePart type="family">Reddy</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">J.E.</mods:namePart><mods:namePart type="family">Aronson</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">A.</mods:namePart><mods:namePart type="family">Stam</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>This paper introduces SPOT (Scheduling of 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 3 novel, mixed-integer, generalized network 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 obtained from a cable network during the first quarter of 1990. The optimization model produces solutions which would have generated an increase of approximately 2 percent in overall profitability, representing over $12 million annually for a typical network with an average Nielsen rating of 18. 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.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1995-08</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>WP-95-084</mods:publisher></mods:originInfo><mods:genre>Monograph</mods:genre></mets:xmlData></mets:mdWrap></mets:dmdSec><mets:amdSec ID="TMD_eprint_4512"><mets:rightsMD ID="rights_eprint_4512_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:useAndReproduction>
<p xmlns="http://www.w3.org/1999/xhtml"><strong>For work being deposited by its own author:</strong>
In self-archiving this collection of files and associated bibliographic
metadata, I grant IIASA Repository the right to store
them and to make them permanently available publicly for free on-line.
I declare that this material is my own intellectual property and I
understand that IIASA Repository does not assume any
responsibility if there is any breach of copyright in distributing these
files or metadata. (All authors are urged to prominently assert their
copyright on the title page of their work.)</p>

<p xmlns="http://www.w3.org/1999/xhtml"><strong>For work being deposited by someone other than its
author:</strong> I hereby declare that the collection of files and
associated bibliographic metadata that I am archiving at
IIASA Repository) is in the public domain. If this is
not the case, I accept full responsibility for any breach of copyright
that distributing these files or metadata may entail.</p>

<p xmlns="http://www.w3.org/1999/xhtml">Clicking on the deposit button indicates your agreement to these
terms.</p>
    </mods:useAndReproduction></mets:xmlData></mets:mdWrap></mets:rightsMD></mets:amdSec><mets:fileSec><mets:fileGrp USE="reference"><mets:file ID="eprint_4512_4061_1" SIZE="1664221" OWNERID="https://pure.iiasa.ac.at/id/eprint/4512/1/WP-95-084.pdf" MIMETYPE="application/pdf"><mets:FLocat LOCTYPE="URL" xlink:type="simple" xlink:href="https://pure.iiasa.ac.at/id/eprint/4512/1/WP-95-084.pdf"></mets:FLocat></mets:file></mets:fileGrp></mets:fileSec><mets:structMap><mets:div DMDID="DMD_eprint_4512_mods" ADMID="TMD_eprint_4512"><mets:fptr FILEID="eprint_4512_document_4061_1"></mets:fptr></mets:div></mets:structMap></mets:mets>