IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v28y2025i6d10.1007_s10951-025-00852-1.html
   My bibliography  Save this article

Scheduling web banner advertisements with conflicts and time windows: a column generation-based solution approach

Author

Listed:
  • Ali Amiri

    (Oklahoma State University)

  • Reza Barkhi

    (Virginia Polytechnic and State University)

Abstract

In the ever-evolving landscape of online advertising, where revenue holds significant importance for Internet-based organizations, the efficient scheduling of banner advertisements has become paramount. This paper studies the banner advertisement scheduling problem, expanding its scope to include ad conflicts and display time windows, highlighting the complex dynamics of modern advertising. Conflicts arise when advertisements cannot be shown in the same time slots, often due to brand rivalry or content incongruity. Furthermore, each accepted ad must be displayed within a designated time window. The study develops a column generation-based algorithm to tackle this challenging scheduling problem. Computational experiments on large datasets show that the column generation approach is highly effective, delivering near-optimal solutions in a reasonable time frame. This efficiency is crucial in an industry where time-sensitive decisions to maximize revenue are paramount.

Suggested Citation

  • Ali Amiri & Reza Barkhi, 2025. "Scheduling web banner advertisements with conflicts and time windows: a column generation-based solution approach," Journal of Scheduling, Springer, vol. 28(6), pages 601-613, December.
    • Handle: RePEc:spr:jsched:v:28:y:2025:i:6:d:10.1007_s10951-025-00852-1
    DOI: 10.1007/s10951-025-00852-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-025-00852-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-025-00852-1?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:spr:jsched:v:28:y:2025:i:6:d:10.1007_s10951-025-00852-1. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.springer.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.