Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem
Journal of Scheduling
Improved Randomized Results for That Interval Selection Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Online story scheduling in web advertising
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
Approximation and Online Algorithms
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Improved randomized results for the interval selection problem
Theoretical Computer Science
Online splitting interval scheduling on m identical machines
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Interval scheduling on related machines
Computers and Operations Research
On-line scheduling of equal-length intervals on parallel machines
Information Processing Letters
Online scheduling of bounded length jobs to maximize throughput
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
Space-constrained interval selection
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Online interval scheduling on a single machine with finite lookahead
Computers and Operations Research
Online scheduling of bounded length jobs to maximize throughput
Journal of Scheduling
Online interval scheduling: randomized and multiprocessor cases
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Efficient online scheduling for deadline-sensitive jobs: extended abstract
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Online selection of intervals and t-intervals
Information and Computation
| Hi-index | 0.02 |
We study on-line scheduling in overloaded systems. Requests for jobs arrive one by one as time proceeds; the serving agents have limited capacity and not all requests can be served. Still, we want to serve the "best" set of requests according to some criterion. In this situation, the ability to preempt (i.e., abort) jobs in service in order to make room for better jobs that would otherwise be rejected has proven to be of great help in some scenarios. We show that, surprisingly, in many other scenarios this is not the case. In a simple, generic model, we prove a polylogarithmic lower bound on the competitiveness of randomized and preemptive on-line scheduling algorithms. Our bound applies to several recently studied problems. In fact, in certain scenarios our bound is quite close to the competitiveness achieved by known deterministic, nonpreemptive algorithms.