Scheduling space-sharing for internet advertising

DOI10.1002/jos.74zbMath1014.90034OpenAlexW1989068254MaRDI QIDQ1600000

Micah Adler, Phillip B. Gibbons, Yossi Matias

Publication date: 9 September 2002

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jos.74

zbMATH Keywords

schedulinginternet advertisingbin packing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Marketing, advertising (90B60)

Related Items (12)

A polynomial-time approximation scheme for the MAXSPACE advertisement problem ⋮ Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ Unnamed Item ⋮ State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems ⋮ Scheduling web advertisements: a note on the minspace problem ⋮ Maximizing revenue with allocation of multiple advertisements on a Web banner ⋮ Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers ⋮ Scheduling advertisements on a web page to maximize revenue ⋮ Advertisement revenue management: determining the optimal mix of skippable and non-skippable AdS for online video sharing platforms ⋮ Branch and Price for Chance-Constrained Bin Packing ⋮ Dynamic pricing and advertising for web content providers

Cites Work

• Bin packing with divisible item sizes
• Shelf Algorithms for Two-Dimensional Packing Problems
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Preemptive weighted completion time scheduling of parallel jobs
• Optimal online scheduling of parallel jobs with dependencies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling space-sharing for internet advertising