Preemptive online scheduling with rejection of unit jobs on two uniformly related machines

2013 ◽  
Vol 17 (1) ◽  
pp. 87-93 ◽  
Author(s):  
Leah Epstein ◽  
Hanan Zebedat-Haider
Keyword(s):  
Online Scheduling ◽  
Uniformly Related Machines ◽  
Related Machines ◽  
Scheduling With Rejection

scholarly journals Online Scheduling of Jobs with Fixed Start Times on Related Machines

Algorithmica ◽  
2014 ◽  
Vol 74 (1) ◽  
pp. 156-176 ◽  
Author(s):  
Leah Epstein ◽  
Łukasz Jeż ◽  
Jiří Sgall ◽  
Rob van Stee
Keyword(s):  
Online Scheduling ◽  
Related Machines

scholarly journals Online scheduling with a buffer on related machines

2008 ◽  
Vol 20 (2) ◽  
pp. 161-179 ◽  
Author(s):  
György Dósa ◽  
Leah Epstein
Keyword(s):  
Online Scheduling ◽  
Related Machines

scholarly journals Online scheduling with rejection and withdrawal

2011 ◽  
Vol 412 (48) ◽  
pp. 6666-6674 ◽  
Author(s):  
Leah Epstein ◽  
Hanan Zebedat-Haider
Keyword(s):  
Online Scheduling ◽  
Scheduling With Rejection

scholarly journals Approximate strong equilibria in job scheduling games with two uniformly related machines

2013 ◽  
Vol 161 (13-14) ◽  
pp. 1843-1858 ◽  
Author(s):  
Leah Epstein ◽  
Michal Feldman ◽  
Tami Tamir ◽  
Łukasz Witkowski ◽  
Marcin Witkowski
Keyword(s):  
Job Scheduling ◽  
Uniformly Related Machines ◽  
Strong Equilibria ◽  
Related Machines ◽  
Scheduling Games
Sign in / Sign up

Export Citation Format

Share Document