IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v59y2008i10d10.1057_palgrave.jors.2602481.html
   My bibliography  Save this article

Scheduling advertising slots for television

Author

Listed:
  • M J Brusco

    (Florida State University)

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.

Suggested Citation

  • M J Brusco, 2008. "Scheduling advertising slots for television," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(10), pages 1363-1372, October.
    • Handle: RePEc:pal:jorsoc:v:59:y:2008:i:10:d:10.1057_palgrave.jors.2602481
    DOI: 10.1057/palgrave.jors.2602481
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602481
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602481?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Srinivas K. Reddy & Jay E. Aronson & Antonie Stam, 1998. "SPOT: Scheduling Programs Optimally for Television," Management Science, INFORMS, vol. 44(1), pages 83-102, January.
    2. John Miltenburg, 1989. "Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems," Management Science, INFORMS, vol. 35(2), pages 192-207, February.
    3. Srinivas Bollapragada & Michael R. Bussieck & Suman Mallik, 2004. "Scheduling Commercial Videotapes in Broadcast Television," Operations Research, INFORMS, vol. 52(5), pages 679-689, October.
    4. Jeffrey H. Horen, 1980. "Scheduling of Network Television Programs," Management Science, INFORMS, vol. 26(4), pages 354-370, April.
    5. Kelton, Christina M. L. & Schneider Stone, Linda G., 1998. "Optimal television schedules in alternative competitive environments," European Journal of Operational Research, Elsevier, vol. 104(3), pages 451-473, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. García-Villoria, Alberto & Pastor, Rafael, 2010. "Solving the response time variability problem by means of a genetic algorithm," European Journal of Operational Research, Elsevier, vol. 202(2), pages 320-327, April.
    2. Giovanni Giallombardo & Giovanna Miglionico & Houyuan Jiang, 2015. "New Reformulations for the Conflict Resolution Problem in the Scheduling of Television Commercials," Working Papers 2015/03, Cambridge Judge Business School, University of Cambridge.
    3. Albert Corominas & Alberto García-Villoria & Rafael Pastor, 2013. "Metaheuristic algorithms hybridised with variable neighbourhood search for solving the response time variability problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(2), pages 296-312, July.
    4. Giovanni Giallombardo & Houyuan Jiang & Giovanna Miglionico, 2016. "New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials," Operations Research, INFORMS, vol. 64(4), pages 838-848, August.
    5. Corominas, Albert & Kubiak, Wieslaw & Pastor, Rafael, 2010. "Mathematical programming modeling of the Response Time Variability Problem," European Journal of Operational Research, Elsevier, vol. 200(2), pages 347-357, January.
    6. José Antonio Carbajal & Peter Williams & Andreea Popescu & Wes Chaar, 2019. "Turner Blazes a Trail for Audience Targeting on Television with Operations Research and Advanced Analytics," Interfaces, INFORMS, vol. 49(1), pages 64-89, January.
    7. García-Villoria, Alberto & Salhi, Said & Corominas, Albert & Pastor, Rafael, 2011. "Hyper-heuristic approaches for the response time variability problem," European Journal of Operational Research, Elsevier, vol. 211(1), pages 160-169, May.
    8. Shinjini Pandey & Goutam Dutta & Harit Joshi, 2017. "Survey on Revenue Management in Media and Broadcasting," Interfaces, INFORMS, vol. 47(3), pages 195-213, June.
    9. José Antonio Carbajal & Wes Chaar, 2017. "Turner Optimizes the Allocation of Audience Deficiency Units," Interfaces, INFORMS, vol. 47(6), pages 518-536, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Shinjini Pandey & Goutam Dutta & Harit Joshi, 2017. "Survey on Revenue Management in Media and Broadcasting," Interfaces, INFORMS, vol. 47(3), pages 195-213, June.
    2. Danaher, Peter J. & Dagger, Tracey S. & Smith, Michael S., 2011. "Forecasting television ratings," International Journal of Forecasting, Elsevier, vol. 27(4), pages 1215-1240, October.
    3. Srinivas Bollapragada & Marc Garbiras, 2004. "Scheduling Commercials on Broadcast Television," Operations Research, INFORMS, vol. 52(3), pages 337-345, June.
    4. José Antonio Carbajal & Wes Chaar, 2017. "Turner Optimizes the Allocation of Audience Deficiency Units," Interfaces, INFORMS, vol. 47(6), pages 518-536, December.
    5. José Antonio Carbajal & Peter Williams & Andreea Popescu & Wes Chaar, 2019. "Turner Blazes a Trail for Audience Targeting on Television with Operations Research and Advanced Analytics," Interfaces, INFORMS, vol. 49(1), pages 64-89, January.
    6. I. Robert Chiang & Jhih‐Hua Jhang‐Li, 2020. "Competition through Exclusivity in Digital Content Distribution," Production and Operations Management, Production and Operations Management Society, vol. 29(5), pages 1270-1286, May.
    7. Bollapragada, Srinivas & Bussieck, Michael & Mallik, Suman, 2002. "Scheduling Commercial Videotapes in Broadcast Television," Working Papers 02-0127, University of Illinois at Urbana-Champaign, College of Business.
    8. Giovanni Giallombardo & Houyuan Jiang & Giovanna Miglionico, 2016. "New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials," Operations Research, INFORMS, vol. 64(4), pages 838-848, August.
    9. Corominas, Albert & Kubiak, Wieslaw & Pastor, Rafael, 2010. "Mathematical programming modeling of the Response Time Variability Problem," European Journal of Operational Research, Elsevier, vol. 200(2), pages 347-357, January.
    10. García-Villoria, Alberto & Salhi, Said & Corominas, Albert & Pastor, Rafael, 2011. "Hyper-heuristic approaches for the response time variability problem," European Journal of Operational Research, Elsevier, vol. 211(1), pages 160-169, May.
    11. Eliashberg, Jehoshua & Hegie, Quintus & Ho, Jason & Huisman, Dennis & Miller, Steven J. & Swami, Sanjeev & Weinberg, Charles B. & Wierenga, Berend, 2009. "Demand-driven scheduling of movies in a multiplex," International Journal of Research in Marketing, Elsevier, vol. 26(2), pages 75-88.
    12. Daya Ram Gaur & Ramesh Krishnamurti & Rajeev Kohli, 2009. "Conflict Resolution in the Scheduling of Television Commercials," Operations Research, INFORMS, vol. 57(5), pages 1098-1105, October.
    13. Giovanni Giallombardo & Giovanna Miglionico & Houyuan Jiang, 2015. "New Reformulations for the Conflict Resolution Problem in the Scheduling of Television Commercials," Working Papers 2015/03, Cambridge Judge Business School, University of Cambridge.
    14. García-Villoria, Alberto & Pastor, Rafael, 2010. "Solving the response time variability problem by means of a genetic algorithm," European Journal of Operational Research, Elsevier, vol. 202(2), pages 320-327, April.
    15. Albert Corominas & Alberto García-Villoria & Rafael Pastor, 2013. "Metaheuristic algorithms hybridised with variable neighbourhood search for solving the response time variability problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(2), pages 296-312, July.
    16. Danaher, Peter & Dagger, Tracey, 2012. "Using a nested logit model to forecast television ratings," International Journal of Forecasting, Elsevier, vol. 28(3), pages 607-622.
    17. Zhou, Wei & Piramuthu, Selwyn, 2012. "Manufacturing with item-level RFID information: From macro to micro quality control," International Journal of Production Economics, Elsevier, vol. 135(2), pages 929-938.
    18. N. Brauner & Y. Crama & A. Grigoriev & J. Klundert, 2005. "A Framework for the Complexity of High-Multiplicity Scheduling Problems," Journal of Combinatorial Optimization, Springer, vol. 9(3), pages 313-323, May.
    19. Giard, Vincent & Jeunet, Jully, 2010. "Optimal sequencing of mixed models with sequence-dependent setups and utility workers on an assembly line," International Journal of Production Economics, Elsevier, vol. 123(2), pages 290-300, February.
    20. Bautista, Joaquín & Alfaro, Rocío & Batalla, Cristina, 2015. "Modeling and solving the mixed-model sequencing problem to improve productivity," International Journal of Production Economics, Elsevier, vol. 161(C), pages 83-95.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:59:y:2008:i:10:d:10.1057_palgrave.jors.2602481. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.