default search action
Zhiyi Tan 0001
Person information
- affiliation: Zhejiang University, Hangzhou, China
Other persons with the same name
- Zhiyi Tan 0002
— Nanjing University of Posts and Telecommunications, Nanjing, China
- Zhiyi Tan 0003 — Shanghai Jiao Tong University, Shanghai, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j44]Lishi Yu, Zhiyi Tan
Scheduling with periodic availability constraints to minimize makespan. J. Sched. 27(3): 277-297 (2024) - 2021
- [j43]Qianqian Chen
Mixed coordination mechanisms for scheduling games on hierarchical machines. Int. Trans. Oper. Res. 28(1): 419-437 (2021) - [j42]Chaoyu He, Zhiyi Tan
Coordination mechanisms for scheduling games with machine modification. Int. Trans. Oper. Res. 28(2): 904-925 (2021) - [j41]Rongqi Li, Zhiyi Tan
Batch scheduling of nonidentical job sizes with minsum criteria. J. Comb. Optim. 42(3): 543-564 (2021) - [j40]Yong Chen, An Zhang, Zhiyi Tan
A (32+ε)-approximation algorithm for scheduling on two parallel machines with job delivery coordination. J. Oper. Res. Soc. 72(9): 1929-1942 (2021)
2010 – 2019
- 2019
- [j39]György Dósa, Armin Fügenschuh
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum. Central Eur. J. Oper. Res. 27(4): 1107-1130 (2019) - [c10]Chaoyu He, Zhiyi Tan
Scheduling Game with Machine Modification in the Random Setting. COCOA 2019: 265-276 - 2018
- [j38]György Dósa, Armin Fügenschuh
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum. Central Eur. J. Oper. Res. 26(1): 161-180 (2018) - 2017
- [j37]Qianqian Chen
Coordination mechanisms for scheduling games with proportional deterioration. Eur. J. Oper. Res. 263(2): 380-389 (2017) - [c9]Rongqi Li, Zhiyi Tan
Minimizing Total Completion Time of Batch Scheduling with Nonidentical Job Sizes. COCOA (1) 2017: 165-179 - 2016
- [j36]János Balogh
Lower bound for 3-batched bin packing. Discret. Optim. 21: 14-24 (2016) - 2015
- [j35]Yujie Yan, Zhihao Ding, Zhiyi Tan
A note on the lower bound for the Price of Anarchy of scheduling games on unrelated machines. Discret. Appl. Math. 186: 295-300 (2015) - [j34]Long Wan, Zhihao Ding, Yunpeng Li, Qianqian Chen
Scheduling to minimize the maximum total completion time per machine. Eur. J. Oper. Res. 242(1): 45-50 (2015) - [j33]Mengyang Gu, Zhiyi Tan
A new approach for bicriteria partitioning problem. Optim. Lett. 9(5): 1025-1037 (2015) - [j32]Zhiyi Tan
Pseudo lower bounds for online parallel machine scheduling. Oper. Res. Lett. 43(5): 489-494 (2015) - [j31]Ling Lin, Xiaochen Xian, Yujie Yan, Xing He, Zhiyi Tan
Inefficiency of equilibria for scheduling game with machine activation costs. Theor. Comput. Sci. 607: 193-207 (2015) - 2014
- [j30]Ling Lin, Zhiyi Tan
Inefficiency of Nash Equilibrium for scheduling games with constrained jobs: A parametric analysis. Theor. Comput. Sci. 521: 123-134 (2014) - [c8]Ling Lin, Yujie Yan, Xing He, Zhiyi Tan
The PoA of Scheduling Game with Machine Activation Costs. FAW 2014: 182-193 - 2013
- [j29]Long Wan, Xiaofang Deng, Zhiyi Tan:
Inefficiency of Nash equilibria with parallel processing policy. Inf. Process. Lett. 113(13): 465-469 (2013) - [j28]Yong Chen, An Zhang, Zhiyi Tan
Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time. Inf. Sci. 251: 150-163 (2013) - [j27]Guangting Chen, Guohui Lin, Zhiyi Tan:
Preface. J. Comb. Optim. 26(3): 415 (2013) - [j26]Haohao Li, Zhiyi Tan, Wei Li:
Privacy-preserving vertically partitioned linear program with nonnegativity constraints. Optim. Lett. 7(8): 1725-1731 (2013) - 2012
- [j25]Zhiyi Tan
Inefficiency of equilibria for the machine covering game on uniform machines. Acta Informatica 49(6): 361-379 (2012) - [j24]Fangqiu Han, Zhiyi Tan
On the optimality of list scheduling for online uniform machines scheduling. Optim. Lett. 6(7): 1551-1571 (2012) - 2011
- [j23]An Zhang, Yiwei Jiang, Zhiyi Tan
Online and Semi-Online Scheduling on capacitated Two-Parallel Machines. Asia Pac. J. Oper. Res. 28(2): 163-182 (2011) - [j22]Zhiyi Tan
Parallel machines scheduling with machine maintenance for minsum criteria. Eur. J. Oper. Res. 212(2): 287-292 (2011) - [j21]Zhiyi Tan
Online hierarchical scheduling: An approach using mathematical programming. Theor. Comput. Sci. 412(3): 246-256 (2011) - [c7]Yong Chen, An Zhang, Zhiyi Tan
Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time. FAW-AAIM 2011: 208-219 - 2010
- [j20]Binzhou Xia
Tighter bounds of the First Fit algorithm for the bin-packing problem. Discret. Appl. Math. 158(15): 1668-1675 (2010) - [j19]György Dósa, Zhiyi Tan
New upper and lower bounds for online scheduling with machine cost. Discret. Optim. 7(3): 125-135 (2010) - [j18]Zhiyi Tan
A note on hierarchical scheduling on two uniform machines. J. Comb. Optim. 20(1): 85-95 (2010)
2000 – 2009
- 2009
- [j17]C. T. Ng
Two semi-online scheduling problems on two uniform machines. Theor. Comput. Sci. 410(8-10): 776-792 (2009) - [j16]An Zhang, Yiwei Jiang, Zhiyi Tan
Online parallel machines scheduling with two hierarchies. Theor. Comput. Sci. 410(38-40): 3597-3605 (2009) - [j15]Xingyu Chen, Leah Epstein, Zhiyi Tan
Semi-online machine covering for two uniform machines. Theor. Comput. Sci. 410(47-49): 5047-5062 (2009) - [c6]Zhiyi Tan
A Mathematical Programming Approach for Online Hierarchical Scheduling. COCOA 2009: 438-450 - 2008
- [j14]Yiwei Jiang, An Zhang, Zhiyi Tan
Online coupon consumption problem. J. Comb. Optim. 16(1): 1-15 (2008) - [j13]Zhiyi Tan
Online scheduling with reassignment. Oper. Res. Lett. 36(2): 250-254 (2008) - 2007
- [j12]Weiya Zhong, György Dósa, Zhiyi Tan
On the machine scheduling problem with job delivery coordination. Eur. J. Oper. Res. 182(3): 1057-1072 (2007) - [j11]Zhiyi Tan
Optimal semi-online algorithms for machine covering. Theor. Comput. Sci. 372(1): 69-80 (2007) - [j10]Zhiyi Tan
Semi-online scheduling problems on two identical machines with inexact partial information. Theor. Comput. Sci. 377(1-3): 110-125 (2007) - [c5]Yiwei Jiang, An Zhang, Zhiyi Tan:
Online Coupon Consumption Problem. ESCAPE 2007: 219-230 - [c4]Yong Wu, Zhiyi Tan
Optimal Semi-online Scheduling Algorithms on a Small Number of Machines. ESCAPE 2007: 504-515 - 2006
- [j9]Zhiyi Tan
Semi-online Machine Covering on Two Uniform Machines with Known Total Size. Computing 78(4): 369-378 (2006) - [j8]Guohui Lin, Zhiyi Tan:
Editorial: In memoriam: Yong He (1969-2005). J. Comb. Optim. 12(4): 325-326 (2006) - 2005
- [j7]Zhiyi Tan
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data. Inf. Comput. 196(1): 57-70 (2005) - [j6]Yiwei Jiang, Zhiyi Tan
Preemptive Machine Covering on Parallel Machines. J. Comb. Optim. 10(4): 345-363 (2005) - [c3]Zhiyi Tan
Linear Time Algorithms for Parallel Machine Scheduling. AAIM 2005: 172-182 - [c2]Zhiyi Tan
Semi-online Problems on Identical Machines with Inexact Partial Information. COCOON 2005: 297-307 - 2004
- [j5]Zhiyi Tan
Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system. Sci. China Ser. F Inf. Sci. 47(2): 161-169 (2004) - 2002
- [j4]Zhiyi Tan
Optimal online algorithm for scheduling on two identical machines with machine availability constraints. Inf. Process. Lett. 83(6): 323-329 (2002) - [j3]Yong He, Zhiyi Tan
Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time. J. Comb. Optim. 6(2): 199-206 (2002) - [j2]Zhiyi Tan
Semi-on-line problems on two identical machines with combined partial information. Oper. Res. Lett. 30(6): 408-414 (2002) - 2001
- [j1]Zhiyi Tan
Semi-on-line scheduling with ordinal data on two uniform machines. Oper. Res. Lett. 28(5): 221-231 (2001) - 2000
- [c1]Zhiyi Tan
Ordinal On-Line Scheduling on Two Uniform Machines. COCOON 2000: 232-241
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-11 20:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: