7 citations · 11 across the 3 of their papers we have counts for
4 papers
On the NP-hardness of scheduling with time restrictions
An Zhang, Yong Chen, Lin Chen +1
In a recent paper, Braun, Chung and Graham [1] have addressed a single-processor scheduling problem with time restrictions. Given a fixed integer , there is a set of jobs…
Scheduling Maintenance Jobs in Networks
Fidaa Abed, Lin Chen, Yann Disser +5
We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focu…
An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization
Lin Chen, Nicole Megow, Kevin Schewior
We consider the online machine minimization problem in which jobs with hard deadlines arrive online over time at their release dates. The task is to determine a feasible schedule o…
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…