Scheduling web banner advertisements with multiple display frequencies

Online advertising continues to be a significant source of income for many Internet-based organizations. Recent indications of improved economic growth are having an impact on advertisement revenue, with the estimated online advertising revenue in the United States for the fourth quarter of 2003 totaling a record of $2.2 billion. A substantial portion of this income comes from banner advertisements, and efficient scheduling of these advertisements could result in a considerable increase in profits. The problem of scheduling banner advertisements has been observed to be intractable via traditional optimization techniques and has received only limited attention in the literature. In addition, all past attempts to address this problem have been based on an "all-or-nothing" framework, where a customer specifies the exact number of copies of the ad to be displayed over the planning horizon, if it is selected for display by the provider of the advertisement space. This paper extends it to a more realistic setting, where the customer is allowed to specify a set of acceptable display frequencies. The Lagrangian decomposition-based solution approaches presented in this paper are observed to provide good schedules in a reasonable period of time.

[1]  Naoki Abe,et al.  Unintrusive Customization Techniques for Web Advertising , 1999, Comput. Networks.

[2]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[3]  Linus Schrage,et al.  Order Allocation for Stock Cutting in the Paper Industry , 2002, Oper. Res..

[4]  Krishna R. Pattipati,et al.  Computationally efficient algorithms for multiple fault diagnosis in large graph-based systems , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[5]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[6]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[7]  Chelliah Sriskandarajah,et al.  Hybrid Genetic Algorithms for Scheduling Advertisements on a Web Page , 2001, ICIS.

[8]  Ronald L. Graham,et al.  Bounds for Multiprocessor Scheduling with Resource Constraints , 1975, SIAM J. Comput..

[9]  Krishna R. Pattipati,et al.  Scheduling parallelizable tasks to minimize make-span and weighted response time , 2002, IEEE Trans. Syst. Man Cybern. Part A.

[10]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[11]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[12]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[13]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[14]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[15]  David Pisinger,et al.  A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..

[16]  Monique Guignard-Spielberg,et al.  Lagrangean decomposition: A model yielding stronger lagrangean bounds , 1987, Math. Program..

[17]  Yossi Matias,et al.  Scheduling space-sharing for internet advertising , 2002, Journal of Scheduling.

[18]  Ali Amiri,et al.  Scheduling Banner Advertisements on the Web , 2004, INFORMS J. Comput..

[19]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .