Abstract
We consider the problem of scheduling jobs online, where jobs may be served partially in order to optimize the overall use of the machines. Service requests arrive online to be executed immediately; the scheduler must decide how long and if it will run a job (that is, it must fix the Quality of Service level of the job) at the time of arrival of the job: preemption is not allowed. We give lower bounds on the competitive ratio and present algorithms for jobs with varying sizes and for jobs with uniform size, and for jobs that can be run for an arbitrary time or only for some fixed fraction of their full execution time.
Cite
CITATION STYLE
Van Stee, R., & La Poutrè, H. (2000). Partial servicing of on-line jobs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1913, pp. 250–261). Springer Verlag. https://doi.org/10.1007/3-540-44436-x_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
