György Dósa, Yong He Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines. [Citation Graph (0, 0)][DBLP] Computing, 2006, v:76, n:1-2, pp:149-164 [Journal]
Yong He, György Dósa Semi-online scheduling jobs with tightly-grouped processing times on three identical machines. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:150, n:1-3, pp:140-159 [Journal]
György Dósa, Yong He Bin packing problems with rejection penalties and their dual problems. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2006, v:204, n:5, pp:795-815 [Journal]
György Dósa The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9. [Citation Graph (0, 0)][DBLP] ESCAPE, 2007, pp:1-11 [Conf]
Preemptive Online Scheduling with Reordering. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP