Yong He

According to our database, Yong He authored at least 27 papers between 2000 and 2009.

Collaborative distances:

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

2009

Two semi-online scheduling problems on two uniform machines.

C. T. Ng, Zhiyi Tan, Yong He, T. C. Edwin Cheng

Theor. Comput. Sci., 2009

2007

Semi-online scheduling problems on two identical machines with inexact partial information.

Zhiyi Tan, Yong He

Theor. Comput. Sci., 2007

Single-machine scheduling with trade-off between number of tardy jobs and compression cost.

Yong He, Qi Wei, T. C. E. Cheng

J. Sched., 2007

Batch delivery scheduling with batch delivery cost on a single machine.

Min Ji, Yong He, T. C. Edwin Cheng

Eur. J. Oper. Res., 2007

A simple linear time algorithm for scheduling with step-improving processing times.

Min Ji, Yong He, T. C. Edwin Cheng

Comput. Oper. Res., 2007

Single-machine scheduling with periodic maintenance to minimize makespan.

Min Ji, Yong He, T. C. Edwin Cheng

Comput. Oper. Res., 2007

Online Algorithms for Scheduling with Machine Activation Cost.

Yong He, Shuguang Han, Yiwei Jiang

Asia Pac. J. Oper. Res., 2007

Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information.

Yiwei Jiang, Yong He

Acta Informatica, 2007

2006

Scheduling linear deteriorating jobs with an availability constraint on a single machine.

Min Ji, Yong He, T. C. Edwin Cheng

Theor. Comput. Sci., 2006

Scheduling with step-improving processing times.

T. C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger

Oper. Res. Lett., 2006

Semi-Online Algorithms for Scheduling with Machine Cost.

Yiwei Jiang, Yong He

J. Comput. Sci. Technol., 2006

Optimal Preemptive Semi-Online Algorithm for Scheduling Tightly-Grouped Jobs on Two Uniform Machines.

Yiwei Jiang, Yong He

Asia Pac. J. Oper. Res., 2006

2005

Optimal semi-online preemptive algorithms for machine covering on two uniform machines.

Yong He, Yiwei Jiang

Theor. Comput. Sci., 2005

Preemptive Machine Covering on Parallel Machines.

Yiwei Jiang, Zhiyi Tan, Yong He

J. Comb. Optim., 2005

Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data.

Zhiyi Tan, Yong He, Leah Epstein

Inf. Comput., 2005

Preemptive online algorithms for scheduling with machine cost.

Yiwei Jiang, Yong He

Acta Informatica, 2005

Preemptive Semi-online Scheduling on Parallel Machines with Inexact Partial Information.

Yong He, Yiwei Jiang

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Semi-online Problems on Identical Machines with Inexact Partial Information.

Zhiyi Tan, Yong He

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Linear Time Algorithms for Parallel Machine Scheduling.

Zhiyi Tan, Yong He

Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004

Preemptive Semi-Online Scheduling with Tightly-Grouped Processing Times.

Yong He, Yiwei Jiang

J. Comput. Sci. Technol., 2004

Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system.

Zhiyi Tan, Yong He

Sci. China Ser. F Inf. Sci., 2004

Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines.

Yong He, Yiwei Jiang

Acta Informatica, 2004

2002

Semi-on-line problems on two identical machines with combined partial information.

Zhiyi Tan, Yong He

Oper. Res. Lett., 2002

Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time.

Yong He, Zhiyi Tan

J. Comb. Optim., 2002

Optimal online algorithm for scheduling on two identical machines with machine availability constraints.

Zhiyi Tan, Yong He

Inf. Process. Lett., 2002

2001

Semi-on-line scheduling with ordinal data on two uniform machines.

Zhiyi Tan, Yong He

Oper. Res. Lett., 2001

2000

Ordinal On-Line Scheduling on Two Uniform Machines.

Zhiyi Tan, Yong He

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000