On-line scheduling of jobs with fixed start and end times
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Online scheduling with hard deadlines
Journal of Algorithms
An optimal online algorithm for packet scheduling with agreeable deadlines
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A Note on Scheduling Equal-Length Jobs to Maximize Throughput
Journal of Scheduling
Maximizing the throughput of parallel jobs on hypercubes
Information Processing Letters
Finding total unimodularity in optimization problems solved by linear programs
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Considering suppressed packets improves buffer management in QoS switches
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved online algorithms for buffer management in QoS switches
ACM Transactions on Algorithms (TALG)
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
SIAM Journal on Computing
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
Approximation and Online Algorithms
Online scheduling of equal-length jobs on parallel machines
ESA'07 Proceedings of the 15th annual European conference on Algorithms
One to rule them all: a general randomized algorithm for buffer management with bounded delay
ESA'11 Proceedings of the 19th European conference on Algorithms
Online, non-preemptive scheduling of equal-length jobs on two identical machines
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online scheduling with hard deadlines on parallel machines
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Online scheduling of packets with agreeable deadlines
ACM Transactions on Algorithms (TALG)
SIGACT news online algorithms column 21: APPROX and ALGO
ACM SIGACT News
Interval selection with machine-dependent intervals
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
In this talk we survey the area of scheduling with the objective to maximize the throughput, i.e., the (weighted) number of completed jobs. We focus on several open problems.