Patience is a virtue: the effect of slack on competitiveness for admission control
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Online scheduling with hard deadlines
Journal of Algorithms
Online deadline scheduling: multiple machines and randomization
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Admission control with immediate notification
Journal of Scheduling - Special issue: On-line scheduling
Online, non-preemptive scheduling of equal-length jobs on two identical machines
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online nonpreemptive scheduling of equal-length jobs on two identical machines
ACM Transactions on Algorithms (TALG)
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
Online preemptive scheduling with immediate decision or notification and penalties
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Online, non-preemptive scheduling of equal-length jobs on two identical machines
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Dispatching equal-length jobs to parallel machines to maximize throughput
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Open problems in throughput scheduling
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Online scheduling with preemption or non-completion penalties
Journal of Scheduling
| Hi-index | 0.00 |
In this paper, motivated by on-line admission control in the hard deadline model, we deal with the following scheduling problem. We are given m identical machines (multi-streams). All jobs (requests) have identical processing time. Each job is associated with a release time and a deadline, neither of which is known until the job arrives. As soon as a job is available, we must immediately decide if the job is accepted or rejected. If a job is accepted, then it must be completed no later than its deadline. The goal is to maximize the total number of jobs accepted. The one-machine case has been extensively studied while little is known for multiple machines. Our main result is deriving a nontrivial optimal online algorithm with competitive ratio $\frac{3}{2}$ for the two-machine case by carefully investigating various strategies. Deterministic lower bounds for the general case are also given.