Ruyan Fu

According to our database, Ruyan Fu authored at least 17 papers between 2007 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown.

Ji Tian, Yan Zhou, Ruyan Fu

J. Comb. Optim., 2020

2017

Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs.

Qian Wang, Ji Tian, Ruyan Fu, Xiangjuan Yao

Theor. Comput. Sci., 2017

An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities.

Ruyan Fu, Ji Tian, Shisheng Li, Jinjiang Yuan

J. Comb. Optim., 2017

2016

Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time.

Ji Tian, Qian Wang, Ruyan Fu, Jinjiang Yuan

Theor. Comput. Sci., 2016

2014

Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan.

Ruyan Fu, Ji Tian, Jinjiang Yuan, Ya Li

Inf. Process. Lett., 2014

2013

An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan.

Ruyan Fu, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan

Oper. Res. Lett., 2013

2011

A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan.

Jinjiang Yuan, Ruyan Fu, C. T. Ng, T. C. Edwin Cheng

J. Sched., 2011

An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times.

Ji Tian, Ruyan Fu, Jinjiang Yuan

Inf. Process. Lett., 2011

2010

Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan.

Ruyan Fu, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan

Inf. Process. Lett., 2010

Parallel Machine Scheduling with a Simultaneity Constraint and Unit-Length Jobs to minimize the makespan.

Lin Lin, Yixun Lin, Xianwei Zhou, Ruyan Fu

Asia Pac. J. Oper. Res., 2010

2009

A best online algorithm for scheduling on two parallel batch machines.

Ji Tian, Ruyan Fu, Jinjiang Yuan

Theor. Comput. Sci., 2009

On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs.

Ruyan Fu, Ji Tian, Jinjiang Yuan

J. Sched., 2009

A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times.

Jinjiang Yuan, Shisheng Li, Ji Tian, Ruyan Fu

J. Comb. Optim., 2009

2008

A best on-line algorithm for single machine scheduling with small delivery times.

Ji Tian, Ruyan Fu, Jinjiang Yuan

Theor. Comput. Sci., 2008

On-line scheduling on a batch machine to minimize makespan with limited restarts.

Ruyan Fu, Ji Tian, Jinjiang Yuan, Cheng He

Oper. Res. Lett., 2008

2007

On-line scheduling with delivery time on a single batch machine.

Ji Tian, Ruyan Fu, Jinjiang Yuan

Theor. Comput. Sci., 2007

Online scheduling in a parallel batch processing system to minimize makespan using restarts.

Ruyan Fu, Ji Tian, Jinjiang Yuan, Yixun Lin

Theor. Comput. Sci., 2007