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 3/2 for the two-machine case by carefully investigating various strategies. Deterministic lower bounds for the general case are also given. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Ding, J., & Zhang, G. (2006). Online scheduling with hard deadlines on parallel machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4041 LNCS, pp. 32–42). Springer Verlag. https://doi.org/10.1007/11775096_5
Mendeley helps you to discover research relevant for your work.