23 citations · 129 across the 42 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017★ 2 cited
An O(log log m)-competitive Algorithm for Online Machine Minimization
Sungjin Im, Benjamin Moseley, Kirk Pruhs +1
This paper considers the online machine minimization problem, a basic real time scheduling problem. The setting for this problem consists of n jobs that arrive over time, where eac…
cs.DS2017★ 23 cited
Greed Works -- Online Algorithms For Unrelated Machine Stochastic Scheduling
Varun Gupta, Benjamin Moseley, Marc Uetz +1
This paper establishes performance guarantees for online algorithms that schedule stochastic, nonpreemptive jobs on unrelated machines to minimize the expected total weighted compl…