 | 2011 |
| 11 |  | Ji Tian,
Ruyan Fu,
Jinjiang Yuan:
An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times.
Inf. Process. Lett. 111(21-22): 1048-1053 (2011) |
| 10 |  | Jinjiang Yuan,
Ruyan Fu,
C. T. Ng,
T. C. Edwin Cheng:
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan.
J. Scheduling 14(4): 361-369 (2011) |
| 2010 |
| 9 |  | Lin Lin,
Yixun Lin,
Xianwei Zhou,
Ruyan Fu:
Parallel Machine Scheduling with a Simultaneity Constraint and Unit-Length Jobs to minimize the makespan.
APJOR 27(6): 669-676 (2010) |
| 8 |  | Ruyan Fu,
T. C. Edwin Cheng,
C. T. Ng,
Jinjiang Yuan:
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan.
Inf. Process. Lett. 110(11): 444-450 (2010) |
| 2009 |
| 7 |  | Jinjiang Yuan,
Shisheng Li,
Ji Tian,
Ruyan Fu:
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times.
J. Comb. Optim. 17(2): 206-213 (2009) |
| 6 |  | Ruyan Fu,
Ji Tian,
Jinjiang Yuan:
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs.
J. Scheduling 12(1): 91-97 (2009) |
| 5 |  | Ji Tian,
Ruyan Fu,
Jinjiang Yuan:
A best online algorithm for scheduling on two parallel batch machines.
Theor. Comput. Sci. 410(21-23): 2291-2294 (2009) |
| 2008 |
| 4 |  | Ruyan Fu,
Ji Tian,
Jinjiang Yuan,
Cheng He:
On-line scheduling on a batch machine to minimize makespan with limited restarts.
Oper. Res. Lett. 36(2): 255-258 (2008) |
| 3 |  | Ji Tian,
Ruyan Fu,
Jinjiang Yuan:
A best on-line algorithm for single machine scheduling with small delivery times.
Theor. Comput. Sci. 393(1-3): 287-293 (2008) |
| 2007 |
| 2 |  | Ruyan Fu,
Ji Tian,
Jinjiang Yuan,
Yixun Lin:
Online scheduling in a parallel batch processing system to minimize makespan using restarts.
Theor. Comput. Sci. 374(1-3): 196-202 (2007) |
| 1 |  | Ji Tian,
Ruyan Fu,
Jinjiang Yuan:
On-line scheduling with delivery time on a single batch machine.
Theor. Comput. Sci. 374(1-3): 49-57 (2007) |