Zhiyi Tan

According to our database1, Zhiyi Tan authored at least 48 papers between 2000 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Predicting the Top-N Popular Videos via a Cross-Domain Hybrid Model.
IEEE Trans. Multimedia, 2019

Tight upper bounds for semi-online scheduling on two uniform machines with known optimum.
CEJOR, 2018

Coordination mechanisms for scheduling games with proportional deterioration.
European Journal of Operational Research, 2017

Minimizing Total Completion Time of Batch Scheduling with Nonidentical Job Sizes.
Proceedings of the Combinatorial Optimization and Applications, 2017

A Novel Time Series Approach for Predicting the Long-Term Popularity of Online Videos.
TBC, 2016

Lower bound for 3-batched bin packing.
Discrete Optimization, 2016

Inefficiency of equilibria for scheduling game with machine activation costs.
Theor. Comput. Sci., 2015

Pseudo lower bounds for online parallel machine scheduling.
Oper. Res. Lett., 2015

A new approach for bicriteria partitioning problem.
Optimization Letters, 2015

Scheduling to minimize the maximum total completion time per machine.
European Journal of Operational Research, 2015

A note on the lower bound for the Price of Anarchy of scheduling games on unrelated machines.
Discrete Applied Mathematics, 2015

Inefficiency of Nash Equilibrium for scheduling games with constrained jobs: A parametric analysis.
Theor. Comput. Sci., 2014

The PoA of Scheduling Game with Machine Activation Costs.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

Lifetime popularity prediction for online videos.
Proceedings of the IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, 2014

Privacy-preserving vertically partitioned linear program with nonnegativity constraints.
Optimization Letters, 2013

J. Comb. Optim., 2013

Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time.
Inf. Sci., 2013

Inefficiency of Nash equilibria with parallel processing policy.
Inf. Process. Lett., 2013

On the optimality of list scheduling for online uniform machines scheduling.
Optimization Letters, 2012

Inefficiency of equilibria for the machine covering game on uniform machines.
Acta Inf., 2012

Online hierarchical scheduling: An approach using mathematical programming.
Theor. Comput. Sci., 2011

Parallel machines scheduling with machine maintenance for minsum criteria.
European Journal of Operational Research, 2011

Online and Semi-Online Scheduling on capacitated Two-Parallel Machines.
APJOR, 2011

Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

A note on hierarchical scheduling on two uniform machines.
J. Comb. Optim., 2010

New upper and lower bounds for online scheduling with machine cost.
Discrete Optimization, 2010

Tighter bounds of the First Fit algorithm for the bin-packing problem.
Discrete Applied Mathematics, 2010

Online parallel machines scheduling with two hierarchies.
Theor. Comput. Sci., 2009

Two semi-online scheduling problems on two uniform machines.
Theor. Comput. Sci., 2009

Semi-online machine covering for two uniform machines.
Theor. Comput. Sci., 2009

A Mathematical Programming Approach for Online Hierarchical Scheduling.
Proceedings of the Combinatorial Optimization and Applications, 2009

Online scheduling with reassignment.
Oper. Res. Lett., 2008

Optimal semi-online algorithms for machine covering.
Theor. Comput. Sci., 2007

Semi-online scheduling problems on two identical machines with inexact partial information.
Theor. Comput. Sci., 2007

On the machine scheduling problem with job delivery coordination.
European Journal of Operational Research, 2007

Optimal Semi-online Scheduling Algorithms on a Small Number of Machines.
Proceedings of the Combinatorics, 2007

Online Coupon Consumption Problem.
Proceedings of the Combinatorics, 2007

Editorial: In memoriam: Yong He (1969-2005).
J. Comb. Optim., 2006

Preemptive Machine Covering on Parallel Machines.
J. Comb. Optim., 2005

Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data.
Inf. Comput., 2005

Semi-online Problems on Identical Machines with Inexact Partial Information.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Linear Time Algorithms for Parallel Machine Scheduling.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system.
Science in China Series F: Information Sciences, 2004

Semi-on-line problems on two identical machines with combined partial information.
Oper. Res. Lett., 2002

Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time.
J. Comb. Optim., 2002

Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
Inf. Process. Lett., 2002

Semi-on-line scheduling with ordinal data on two uniform machines.
Oper. Res. Lett., 2001

Ordinal On-Line Scheduling on Two Uniform Machines.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000