On-line preemptive scheduling on uniform machines

On-line preemptive scheduling on uniform machines

0.00 Avg rating—0 Votes
Article ID: iaor20031407
Country: China
Volume: 14
Issue: 4
Start Page Number: 373
End Page Number: 377
Publication Date: Oct 2001
Journal: Journal of Systems Science and Complexity
Authors: , ,
Abstract:

We address the problem of preemptively scheduling on-line jobs on a set of m arbitrary uniformly related machines with the objective of minimizing the schedule length. We provide the first on-line algorithm for this general problem, and show the competitive ratio of the algorithm in terms of the speeds of the m machines.

Reviews

Required fields are marked *. Your email address will not be published.