Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times

2016 ◽  
Vol 20 (2) ◽  
pp. 115-127
Author(s):  
Leah Epstein ◽  
Ido Yatsiv
Keyword(s):  
Preemptive Scheduling ◽  
Uniformly Related Machines ◽  
Related Machines ◽  
Completion Times

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