Zhiyi Tan
Orcid: 0000-0002-4714-5448Affiliations:
- Zhejiang University, Hangzhou, China
According to our database1,
Zhiyi Tan
authored at least 53 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
J. Sched., June, 2024
2021
A (32+ε)-approximation algorithm for scheduling on two parallel machines with job delivery coordination.
J. Oper. Res. Soc., 2021
J. Comb. Optim., 2021
Int. Trans. Oper. Res., 2021
Int. Trans. Oper. Res., 2021
2019
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum.
Central Eur. J. Oper. Res., 2019
Proceedings of the Combinatorial Optimization and Applications, 2019
2018
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum.
Central Eur. J. Oper. Res., 2018
2017
Eur. J. Oper. Res., 2017
Proceedings of the Combinatorial Optimization and Applications, 2017
2016
2015
Theor. Comput. Sci., 2015
Eur. J. Oper. Res., 2015
A note on the lower bound for the Price of Anarchy of scheduling games on unrelated machines.
Discret. Appl. Math., 2015
2014
Inefficiency of Nash Equilibrium for scheduling games with constrained jobs: A parametric analysis.
Theor. Comput. Sci., 2014
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014
2013
Privacy-preserving vertically partitioned linear program with nonnegativity constraints.
Optim. Lett., 2013
Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time.
Inf. Sci., 2013
Inf. Process. Lett., 2013
2012
Optim. Lett., 2012
Acta Informatica, 2012
2011
Theor. Comput. Sci., 2011
Eur. J. Oper. Res., 2011
Asia Pac. J. Oper. Res., 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
2010
Discret. Optim., 2010
Discret. Appl. Math., 2010
2009
Theor. Comput. Sci., 2009
Proceedings of the Combinatorial Optimization and Applications, 2009
2008
2007
Semi-online scheduling problems on two identical machines with inexact partial information.
Theor. Comput. Sci., 2007
Eur. J. Oper. Res., 2007
Proceedings of the Combinatorics, 2007
2006
Computing, 2006
2005
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data.
Inf. Comput., 2005
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005
2004
Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system.
Sci. China Ser. F Inf. Sci., 2004
2002
Oper. Res. Lett., 2002
J. Comb. Optim., 2002
Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
Inf. Process. Lett., 2002
2001
Oper. Res. Lett., 2001
2000
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000