 | 2012 |
| 22 |  | Yan Lan,
Xin Chen,
Ning Ding,
György Dósa,
Xin Han:
Online Minimum Makespan Scheduling with a Buffer.
FAW-AAIM 2012: 161-171 |
| 21 |  | György Dósa,
Leah Epstein:
Generalized selfish bin packing
CoRR abs/1202.4080: (2012) |
| 2011 |
| 20 |  | Min Chen,
György Dósa,
Xin Han,
Chenyang Zhou,
Attila Benko:
2D Knapsack: Packing Squares.
FAW-AAIM 2011: 176-184 |
| 19 |  | Csilla Bujtás,
György Dósa,
Csanád Imreh,
Judit Nagy-György,
Zsolt Tuza:
The Graph-Bin Packing Problem.
Int. J. Found. Comput. Sci. 22(8): 1971-1993 (2011) |
| 18 |  | György Dósa,
Maria Grazia Speranza,
Zsolt Tuza:
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling.
J. Comb. Optim. 21(4): 458-480 (2011) |
| 17 |  | György Dósa,
Leah Epstein:
Preemptive Online Scheduling with Reordering.
SIAM J. Discrete Math. 25(1): 21-49 (2011) |
| 16 |  | Xin Chen,
Yan Lan,
Attila Benko,
György Dósa,
Xin Han:
Optimal algorithms for online scheduling with bounded rearrangement at the end.
Theor. Comput. Sci. 412(45): 6269-6278 (2011) |
| 15 |  | György Dósa,
Yuxin Wang,
Xin Han,
He Guo:
Online scheduling with rearrangement on two related machines.
Theor. Comput. Sci. 412(8-10): 642-653 (2011) |
| 2010 |
| 14 |  | Attila Benko,
György Dósa,
Zsolt Tuza:
Bin Packing/Covering with Delivery, solved with the evolution of algorithms.
BIC-TA 2010: 298-302 |
| 13 |  | György Dósa,
Zhiyi Tan:
New upper and lower bounds for online scheduling with machine cost.
Discrete Optimization 7(3): 125-135 (2010) |
| 12 |  | György Dósa,
Leah Epstein:
Online scheduling with a buffer on related machines.
J. Comb. Optim. 20(2): 161-179 (2010) |
| 2009 |
| 11 |  | György Dósa,
Leah Epstein:
Preemptive Online Scheduling with Reordering.
ESA 2009: 456-467 |
| 2008 |
| 10 |  | György Dósa,
Leah Epstein:
Preemptive scheduling on a small number of hierarchical machines.
Inf. Comput. 206(5): 602-619 (2008) |
| 2007 |
| 9 |  | 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 |  | 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 |  | 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 |  | György Dósa,
Yong He:
Bin packing problems with rejection penalties and their dual problems.
Inf. Comput. 204(5): 795-815 (2006) |
| 5 |  | György Dósa,
Yong He:
Scheduling with machine cost and rejection.
J. Comb. Optim. 12(4): 337-350 (2006) |
| 2005 |
| 4 |  | Yong He,
György Dósa:
Bin Packing and Covering Problems with Rejection.
COCOON 2005: 885-894 |
| 3 |  | 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 |  | György Dósa,
Yong He:
Semi-Online Algorithms for Parallel Machine Scheduling Problems.
Computing 72(3-4): 355-363 (2004) |
| 1 |  | György Dósa,
Yong He:
Better Online Algorithms for Scheduling with Machine Cost.
SIAM J. Comput. 33(5): 1035-1051 (2004) |