The complexity of scheduling TV commercials

Citations of this article
Mendeley users who have this article in their library.


Television commercial scheduling is a generalised form of partition problem, but the lengths involved are rather small, leaving the complexity of the problem unclear. This paper shows that the related problem of colour-restricted spot scheduling is NP-complete, even when the break-lengths are bounded (at most 18 units). We also show that scheduling unit-length spots is easy. The paper is intended to be self-contained. The authors are indebted to an anonymous referee whose careful and perceptive review revealed several errors in an earlier draft. © 2001 Published by Elsevier Science B.V.




Hägele, K., Ó Dúnlaing, C., & Riis, S. (2001). The complexity of scheduling TV commercials. In Electronic Notes in Theoretical Computer Science (Vol. 40, pp. 162–185).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free