On-line scheduling of jobs with fixed start and end times
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Improved Bounds for the Online Scheduling Problem
SIAM Journal on Computing
The Power of Reordering for Online Minimum Makespan Scheduling
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Improved randomized results for the interval selection problem
Theoretical Computer Science
On-line scheduling of equal-length intervals on parallel machines
Information Processing Letters
On the value of preemption in scheduling
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Open problems in throughput scheduling
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
On the value of job migration in online makespan minimization
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
On online labeling with polynomially many labels
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
For this column, I would like to report on some conferences that I attended recently, with special attention given (of course) to results in online algorithms. Most of the papers discussed below consider online scheduling, another favorite problem area of mine. Generally, for a job j we will denote its processing time by pj , its weight by wj (if applicable), its release time by rj , and its deadline by dj . In the discussion below, I have tried to point out interesting open problems wherever possible. Enjoy.