Ruyan Fu

17 papers Journal 17
YearRankTypeTitle / Venue / Authors
2020 J jnl
An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown.
J. Comb. Optim.
Ji Tian, Yan Zhou, Ruyan Fu
2017 J jnl
An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities.
J. Comb. Optim.
Ruyan Fu, Ji Tian, Shisheng Li, Jinjiang Yuan
2017 J jnl
Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs.
Theor. Comput. Sci.
Qian Wang, Ji Tian, Ruyan Fu, Xiangjuan Yao
2016 J jnl
Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time.
Theor. Comput. Sci.
Ji Tian, Qian Wang, Ruyan Fu, Jinjiang Yuan
2014 J jnl
Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan.
Inf. Process. Lett.
Ruyan Fu, Ji Tian, Jinjiang Yuan, Ya Li
2013 J jnl
An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan.
Oper. Res. Lett.
Ruyan Fu, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan
2011 J jnl
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan.
J. Sched.
Jinjiang Yuan, Ruyan Fu, C. T. Ng, T. C. Edwin Cheng
2011 J jnl
An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times.
Inf. Process. Lett.
Ji Tian, Ruyan Fu, Jinjiang Yuan
2010 J jnl
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan.
Inf. Process. Lett.
Ruyan Fu, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2010 J jnl
Parallel Machine Scheduling with a Simultaneity Constraint and Unit-Length Jobs to minimize the makespan.
Asia Pac. J. Oper. Res.
Lin Lin, Yixun Lin, Xianwei Zhou, Ruyan Fu
2009 J jnl
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times.
J. Comb. Optim.
Jinjiang Yuan, Shisheng Li, Ji Tian, Ruyan Fu
2009 J jnl
A best online algorithm for scheduling on two parallel batch machines.
Theor. Comput. Sci.
Ji Tian, Ruyan Fu, Jinjiang Yuan
2009 J jnl
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs.
J. Sched.
Ruyan Fu, Ji Tian, Jinjiang Yuan
2008 J jnl
A best on-line algorithm for single machine scheduling with small delivery times.
Theor. Comput. Sci.
Ji Tian, Ruyan Fu, Jinjiang Yuan
2008 J jnl
On-line scheduling on a batch machine to minimize makespan with limited restarts.
Oper. Res. Lett.
Ruyan Fu, Ji Tian, Jinjiang Yuan, Cheng He
2007 J jnl
On-line scheduling with delivery time on a single batch machine.
Theor. Comput. Sci.
Ji Tian, Ruyan Fu, Jinjiang Yuan
2007 J jnl
Online scheduling in a parallel batch processing system to minimize makespan using restarts.
Theor. Comput. Sci.
Ruyan Fu, Ji Tian, Jinjiang Yuan, Yixun Lin