Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes

2021 ◽  
pp. 106211
Author(s):  
Asaf Levin
Keyword(s):  
Preemptive Scheduling ◽  
Robust Algorithms ◽  
Uniform Machines

OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES

2006 ◽  
Vol 23 (01) ◽  
pp. 77-88 ◽  
Author(s):  
YIWEI JIANG ◽  
YONG HE
Keyword(s):  
Online Algorithm ◽  
Size Ratio ◽  
Speed Ratio ◽  
Preemptive Scheduling ◽  
Scheduling Problem ◽  
Time Zero ◽  
Uniform Machines ◽  
Machine Speed

In this paper, we consider a semi-online preemptive scheduling problem on two uniform machines, where we assume that all jobs have sizes between p and rp for some p > 0 and r ≥ 1. The goal is to maximize the continuous period of time (starting from time zero) when both machines are busy. We present an optimal semi-online algorithm for any combination of the job size ratio r and machine speed ratio s.

scholarly journals Preemptive scheduling on uniform machines to minimize mean flow time

2009 ◽  
Vol 36 (10) ◽  
pp. 2816-2821 ◽  
Author(s):  
Svetlana A. Kravchenko ◽  
Frank Werner
Keyword(s):  
Flow Time ◽  
Preemptive Scheduling ◽  
Mean Flow ◽  
Mean Flow Time ◽  
Uniform Machines

Robust Algorithms for Preemptive Scheduling

Algorithmica ◽  
2012 ◽  
Vol 69 (1) ◽  
pp. 26-57 ◽  
Author(s):  
Leah Epstein ◽  
Asaf Levin
Keyword(s):  
Preemptive Scheduling ◽  
Robust Algorithms

scholarly journals Preemptive Scheduling of Uniform Machines Subject to Release Dates

1984 ◽  
pp. 245-261 ◽  
Author(s):  
J. Labetoulle ◽  
E.L. Lawler ◽  
J.K. Lenstra ◽  
A.H.G. Rinnooy Kan
Keyword(s):  
Release Dates ◽  
Preemptive Scheduling ◽  
Uniform Machines
Sign in / Sign up

Export Citation Format

Share Document