Skip to main content
SpringerLink
Log in

Scheduling advertising slots for television

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

The ISCI (Industry Standard Commercial Identification) rotator problem requires the assignment of a set of commercial videotapes to slots such that multiple airings of each tape in the set are as equally spaced as possible with respect to an L1 loss function. The contributions of this research paper are threefold. First, an enhanced branch-and-bound algorithm is presented and shown to produce optimal solutions for each of several problems that were not computationally feasible for a previously developed branch-and-bound implementation. Second, a fast simulated annealing heuristic is developed for larger problems. This heuristic has established new benchmark (best-known) solutions for 16 large ISCI rotator problems from a recently published test suite. Third, we consider alternative loss function metrics, and have found that a branch-and-bound algorithm for the L∞ algorithm is especially scalable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2

Similar content being viewed by others

References

  • Bollapragada S, Bussieck MR and Malik S (2004). Scheduling commercial videotapes in broadcast television. Opns Res 52: 679–689.

    Article  Google Scholar 

  • Černý V (1985). Thermodynamical approach to the traveling salesman problem. J Comb Optim Theory Appl 45: 41–51.

    Article  Google Scholar 

  • Glover F and Laguna M (1993). Tabu search. In: Reeves C. (ed). Modern Heuristic Techniques For Combinatorial Problems. Blackwell: Oxford, pp. 70–141.

    Google Scholar 

  • Goldberg DE (1989). Genetic Algorithms In Search, Optimization, And Machine Learning. Addison-Wesley: New York.

    Google Scholar 

  • Hansen P and Mladenović N (2003). Variable neighborhood search. In: Glover F.W. and Kochenberger G.A. (eds). Handbook of Metaheuristics. Kluwer: Norwell, MA, pp. 145–184.

    Chapter  Google Scholar 

  • Horen JH (1980). Scheduling of network television programs. Mngt Sci 26: 354–370.

    Article  Google Scholar 

  • Kelton CML and Schneider Stone LG (1998). Optimal television schedules in alternative competitive environments. Eur J Opl Res 104: 451–473.

    Article  Google Scholar 

  • Kirkpatrick S, Gelatt CD and Vecchi MP (1983). Optimization by simulated annealing. Science 220: 671–680.

    Article  Google Scholar 

  • Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller A and Teller E (1953). Equation of state calculations by fast computing machines. J Chem Phys 21: 1087–1092.

    Article  Google Scholar 

  • Miltenburg J (1989). Level schedules for mixed-model assembly lines in just-in-time production systems. Mngt Sci 35: 192–207.

    Article  Google Scholar 

  • Reddy SK, Aronson JE and Stam A (1998). SPOT: Scheduling programs optimally for television. Mngt Sci 44: 83–102.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Florida State University, Tallahassee, FL, USA

    M J Brusco

Authors
  1. M J Brusco
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M J Brusco.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brusco, M. Scheduling advertising slots for television. J Oper Res Soc 59, 1363–1372 (2008). https://doi.org/10.1057/palgrave.jors.2602481

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2602481

Keywords

Search

Navigation