Ordinal On-Line Scheduling on Two Uniform Machines. - Zhiyi Tan 001; Yong He 014 (COCOON, 2000)

Semi-on-line scheduling with ordinal data on two uniform machines. - Zhiyi Tan 001; Yong He 014 (Oper. Res. Lett., 2001)

Optimal online algorithm for scheduling on two identical machines with machine availability constraints. - Zhiyi Tan 001; Yong He 014 (Inf. Process. Lett., 2002)

Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time. - Yong He 014; Zhiyi Tan 001 (J. Comb. Optim., 2002)

Semi-on-line problems on two identical machines with combined partial information. - Zhiyi Tan 001; Yong He 014 (Oper. Res. Lett., 2002)

Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system. - Zhiyi Tan 001; Yong He 014 (Sci. China Ser. F Inf. Sci., 2004)

Linear Time Algorithms for Parallel Machine Scheduling. - Zhiyi Tan 001; Yong He 014 (AAIM, 2005)

Semi-online Problems on Identical Machines with Inexact Partial Information. - Zhiyi Tan 001; Yong He 014 (COCOON, 2005)

Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data. - Zhiyi Tan 001; Yong He 014; Leah Epstein (Inf. Comput., 2005)

Preemptive Machine Covering on Parallel Machines. - Yiwei Jiang; Zhiyi Tan 001; Yong He 014 (J. Comb. Optim., 2005)

Semi-online Machine Covering on Two Uniform Machines with Known Total Size. - Zhiyi Tan 001; Shunjuan Cao (Computing, 2006)

Editorial: In memoriam: Yong He (1969-2005). - Guohui Lin; Zhiyi Tan 001 (J. Comb. Optim., 2006)

Optimal Semi-online Scheduling Algorithms on a Small Number of Machines. - Yong Wu; Zhiyi Tan 001; Qifan Yang (ESCAPE, 2007)

On the machine scheduling problem with job delivery coordination. - Weiya Zhong; György Dósa; Zhiyi Tan 001 (Eur. J. Oper. Res., 2007)

Semi-online scheduling problems on two identical machines with inexact partial information. - Zhiyi Tan 001; Yong He 014 (Theor. Comput. Sci., 2007)

Optimal semi-online algorithms for machine covering. - Zhiyi Tan 001; Yong Wu (Theor. Comput. Sci., 2007)

Online coupon consumption problem. - Yiwei Jiang; An Zhang 001; Zhiyi Tan 001 (J. Comb. Optim., 2008)

Online scheduling with reassignment. - Zhiyi Tan 001; Shaohua Yu (Oper. Res. Lett., 2008)

A Mathematical Programming Approach for Online Hierarchical Scheduling. - Zhiyi Tan 001; An Zhang 001 (COCOA, 2009)

Semi-online machine covering for two uniform machines. - Xingyu Chen; Leah Epstein; Zhiyi Tan 001 (Theor. Comput. Sci., 2009)

Two semi-online scheduling problems on two uniform machines. - C. T. Ng 001; Zhiyi Tan 001; Yong He 014; T. C. Edwin Cheng (Theor. Comput. Sci., 2009)

Online parallel machines scheduling with two hierarchies. - An Zhang 001; Yiwei Jiang; Zhiyi Tan 001 (Theor. Comput. Sci., 2009)

Tighter bounds of the First Fit algorithm for the bin-packing problem. - Binzhou Xia; Zhiyi Tan 001 (Discret. Appl. Math., 2010)

New upper and lower bounds for online scheduling with machine cost. - György Dósa; Zhiyi Tan 001 (Discret. Optim., 2010)

A note on hierarchical scheduling on two uniform machines. - Zhiyi Tan 001; An Zhang 001 (J. Comb. Optim., 2010)

Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time. - Yong Chen 002; An Zhang 001; Zhiyi Tan 001 (FAW-AAIM, 2011)

Online and Semi-Online Scheduling on capacitated Two-Parallel Machines. - An Zhang 001; Yiwei Jiang; Zhiyi Tan 001 (Asia Pac. J. Oper. Res., 2011)

Parallel machines scheduling with machine maintenance for minsum criteria. - Zhiyi Tan 001; Yong Chen 002; An Zhang 001 (Eur. J. Oper. Res., 2011)

Online hierarchical scheduling: An approach using mathematical programming. - Zhiyi Tan 001; An Zhang 001 (Theor. Comput. Sci., 2011)

Inefficiency of equilibria for the machine covering game on uniform machines. - Zhiyi Tan 001; Long Wan; Qi Zhang; Wei Ren (Acta Informatica, 2012)

On the optimality of list scheduling for online uniform machines scheduling. - Fangqiu Han; Zhiyi Tan 001; Yang Yang (Optim. Lett., 2012)

Inefficiency of Nash equilibria with parallel processing policy. - Long Wan; Xiaofang Deng; Zhiyi Tan 001 (Inf. Process. Lett., 2013)

Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time. - Yong Chen 002; An Zhang 001; Zhiyi Tan 001 (Inf. Sci., 2013)

Preface. - Guangting Chen; Guohui Lin; Zhiyi Tan 001 (J. Comb. Optim., 2013)

Privacy-preserving vertically partitioned linear program with nonnegativity constraints. - Haohao Li; Zhiyi Tan 001; Wei Li 158 (Optim. Lett., 2013)

The PoA of Scheduling Game with Machine Activation Costs. - Ling Lin; Yujie Yan; Xing He; Zhiyi Tan 001 (FAW, 2014)

Inefficiency of Nash Equilibrium for scheduling games with constrained jobs: A parametric analysis. - Ling Lin; Zhiyi Tan 001 (Theor. Comput. Sci., 2014)

A note on the lower bound for the Price of Anarchy of scheduling games on unrelated machines. - Yujie Yan; Zhihao Ding; Zhiyi Tan 001 (Discret. Appl. Math., 2015)

Scheduling to minimize the maximum total completion time per machine. - Long Wan; Zhihao Ding; Yunpeng Li; Qianqian Chen; Zhiyi Tan 001 (Eur. J. Oper. Res., 2015)

A new approach for bicriteria partitioning problem. - Mengyang Gu; Zhiyi Tan 001; Binzhou Xia; Yujie Yan (Optim. Lett., 2015)

Pseudo lower bounds for online parallel machine scheduling. - Zhiyi Tan 001; Rongqi Li (Oper. Res. Lett., 2015)

Inefficiency of equilibria for scheduling game with machine activation costs. - Ling Lin; Xiaochen Xian; Yujie Yan; Xing He; Zhiyi Tan 001 (Theor. Comput. Sci., 2015)

Lower bound for 3-batched bin packing. - János Balogh; József Békési; Gábor Galambos; György Dósa; Zhiyi Tan 001 (Discret. Optim., 2016)

Minimizing Total Completion Time of Batch Scheduling with Nonidentical Job Sizes. - Rongqi Li; Zhiyi Tan 001; Qianyu Zhu (COCOA (1), 2017)

Coordination mechanisms for scheduling games with proportional deterioration. - Qianqian Chen; Ling Lin; Zhiyi Tan 001; Yujie Yan (Eur. J. Oper. Res., 2017)

Tight upper bounds for semi-online scheduling on two uniform machines with known optimum. - György Dósa; Armin Fügenschuh; Zhiyi Tan 001; Zsolt Tuza; Krzysztof Wesek (Central Eur. J. Oper. Res., 2018)

Scheduling Game with Machine Modification in the Random Setting. - Chaoyu He; Zhiyi Tan 001 (COCOA, 2019)

Tight lower bounds for semi-online scheduling on two uniform machines with known optimum. - György Dósa; Armin Fügenschuh; Zhiyi Tan 001; Zsolt Tuza; Krzysztof Wesek (Central Eur. J. Oper. Res., 2019)

Mixed coordination mechanisms for scheduling games on hierarchical machines. - Qianqian Chen; Zhiyi Tan 001 (Int. Trans. Oper. Res., 2021)

Coordination mechanisms for scheduling games with machine modification. - Chaoyu He; Zhiyi Tan 001 (Int. Trans. Oper. Res., 2021)

Batch scheduling of nonidentical job sizes with minsum criteria. - Rongqi Li; Zhiyi Tan 001; Qianyu Zhu (J. Comb. Optim., 2021)

A (32+ε)-approximation algorithm for scheduling on two parallel machines with job delivery coordination. - Yong Chen 002; An Zhang 001; Zhiyi Tan 001; Ying Xue; Guangting Chen (J. Oper. Res. Soc., 2021)

Semi-online Multiprocessor Scheduling with Known Largest Job Processing Time. - Mingyang Gong; Guohui Lin; Zhiyi Tan 001 (COCOA (1), 2024)

A Simple Algorithm for Scheduling Unit Jobs with Unknown Number of Machines. - Lishi Yu; Zhiyi Tan 001 (COCOA (1), 2024)

Scheduling with periodic availability constraints to minimize makespan. - Lishi Yu; Zhiyi Tan 001 (J. Sched., 2024)

Price of Anarchy of Scheduling Games on Hierarchical Machines with Quadratic Social Cost. - Ling Lin; Zhiyi Tan 001 (Asia Pac. J. Oper. Res., 2025)

Inefficiency of multiplicative approximate Nash equilibrium for scheduling games. - Zhuyinan Wang; Chen Zhang; Zhiyi Tan 001 (J. Comb. Optim., 2025)

Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan. - Tianqi Chen; Zhiyi Tan 001 (Inf. Process. Lett., 2026)