| 2008 |
|---|
| 10 | EE | György Dósa,
Leah Epstein:
Preemptive scheduling on a small number of hierarchical machines.
Inf. Comput. 206(5): 602-619 (2008) |
| 2007 |
|---|
| 9 | EE | György Dósa:
The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9.
ESCAPE 2007: 1-11 |
| 8 | EE | Weiya Zhong,
György Dósa,
Zhiyi Tan:
On the machine scheduling problem with job delivery coordination.
European Journal of Operational Research 182(3): 1057-1072 (2007) |
| 2006 |
|---|
| 7 | EE | György Dósa,
Yong He:
Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines.
Computing 76(1-2): 149-164 (2006) |
| 6 | EE | György Dósa,
Yong He:
Bin packing problems with rejection penalties and their dual problems.
Inf. Comput. 204(5): 795-815 (2006) |
| 5 | EE | György Dósa,
Yong He:
Scheduling with machine cost and rejection.
J. Comb. Optim. 12(4): 337-350 (2006) |
| 2005 |
|---|
| 4 | EE | Yong He,
György Dósa:
Bin Packing and Covering Problems with Rejection.
COCOON 2005: 885-894 |
| 3 | EE | Yong He,
György Dósa:
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines.
Discrete Applied Mathematics 150(1-3): 140-159 (2005) |
| 2004 |
|---|
| 2 | EE | György Dósa,
Yong He:
Semi-Online Algorithms for Parallel Machine Scheduling Problems.
Computing 72(3-4): 355-363 (2004) |
| 1 | EE | György Dósa,
Yong He:
Better Online Algorithms for Scheduling with Machine Cost.
SIAM J. Comput. 33(5): 1035-1051 (2004) |
