22 citations · 52 across the 22 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.CC2013★ 22 cited
On the optimality of approximation schemes for the classical scheduling problem
Lin Chen, Klaus Jansen, Guochuan Zhang
We consider the classical scheduling problem on parallel identical machines to minimize the makespan, and achieve the following results under the Exponential Time Hypothesis (ETH)…
cs.CC2013★ 4 cited
A note on scheduling with low rank processing times
Lin Chen, Deshi Ye, Guochuan Zhang
We consider the classical minimum makespan scheduling problem, where the processing time of job on machine is , and the matrix is of a low…
cs.DS2013★ 7 cited
Approximating the optimal competitive ratio for an ancient online scheduling problem
Lin Chen, Deshi Ye, Guochuan Zhang
We consider the classical online scheduling problem P||C_{max} in which jobs are released over list and provide a nearly optimal online algorithm. More precisely, an online algorit…