Performance Bounds of Algorithms for Scheduling Advertisements on a Web Page

AbstractConsider a set of n advertisements (hereafter called “ads”) A ={A1,...,An} competing to be placed in a planning horizon which is divided into N time intervals called slots. An ad Ai is specified by its size si and frequency wi. The size si represents the amount of space the ad occupies in a slot. Ad Ai is said to be scheduled if exactly wi copies of Ai are placed in the slots subject to the restriction that a slot contains at most one copy of an ad. In this paper, we consider two problems. The MINSPACE problem minimizes the maximum fullness among all slots in a feasible schedule where the fullness of a slot is the sum of the sizes of ads assigned to the slot. For the MAXSPACE problem, in addition, we are given a common maximum fullness S for all slots. The total size of the ads placed in a slot cannot exceed S. The objective is to find a feasible schedule $$A' \subseteq A$$ of ads such that the total occupied slot space $$\sum {_{A_i \in A'} w_i s_i }$$ is maximized. We examine the complexity status of both problems and provide heuristics with performance guarantees.

[1]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[2]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[3]  Andrew Whinston,et al.  Electronic Commerce: A Manager's Guide , 1997 .

[4]  Donald K. Friesen,et al.  Tighter Bounds for the Multifit Processor Scheduling Algorithm , 1984, SIAM J. Comput..

[5]  Michael K. McCandless,et al.  Internet Services: Web Advertising , 1998, IEEE Intell. Syst..

[6]  Michael H. Rothkopf,et al.  Scheduling Independent Tasks on Parallel Processors , 1966 .

[7]  Michael A. Langston,et al.  Evaluation of a MULTIFIT-Based Scheduling Algorithm , 1986, J. Algorithms.

[8]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[9]  Donna L. Hoffman,et al.  New metrics for new media: toward the development of Web measurement standards , 1997, World Wide Web J..

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

[11]  Philip S. Yu,et al.  A Framework for the Optimizing of WWW Advertising , 1998, Trends in Distributed Systems for Electronic Commerce.

[12]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  G. Nemhauser,et al.  Integer Programming , 2020 .

[15]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[16]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

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

[18]  Ronald R. Yager,et al.  Intelligent agents for World Wide Web advertising decisions , 1997, Int. J. Intell. Syst..

[19]  Gerhard J. Woeginger,et al.  A Review of Machine Scheduling: Complexity, Algorithms and Approximability , 1998 .

[20]  J. M. Moore,et al.  A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .