当前位置: X-MOL首页全球导师 国内导师 › 谈之奕

个人简介

主要经历: 1992年9月—1996年7月 浙江大学应用数学系(本科) 1996年9月—2001年6月 浙江大学数学系(硕士、博士) 2001年7月—2003年7月 浙江大学系统科学与工程学系(博士后) 2003年8月—2007年12月 浙江大学数学系副研究员 2007年12月—2009年3月 浙江大学数学系教授 2009年3月— 浙江大学数学系教授,博士生导师 综述 林凌,谈之奕,平行机在线排序综述. 中国科学:数学, 50(9), 1183-1200, 2020.  中国科学 数学 Tan Zhiyi, Zhang An. Online and semi-online scheduling. In: Handbook of Combinatorial Optimization (2nd). Springer, 2013, 2191–2252. 何勇,杨启帆,谈之奕,平行机半在线排序问题研究(Ⅰ). 高校应用数学学报, 18(1), 105-114, 2003. 何勇,杨启帆,谈之奕,平行机半在线排序问题研究(Ⅱ). 高校应用数学学报, 18(2), 213-222, 2003. 科研项目 国家自然科学基金《平行机排序问题的新模型和新算法》(2004-2006) 国家自然科学基金《排序若干新问题的算法设计与分析》(2007-2009) 国家自然科学基金《排序问题的博弈分析和多目标排序》(2010-2012) 国家自然科学基金《分散决策模式下的排序问题研究》(2013-2016) 国家自然科学基金《平行机排序博弈的均衡分析与机制设计》(2017-2020) 国家自然科学基金《复杂平行机排序博弈与相关问题研究》(2021-2024) 国家自然科学基金《带预测的平行机在线排序问题和相关在线问题研究》(2026-2029) 浙江省杰出青年科学基金《若干组合优化问题的算法设计与分析》(2012-2014) 浙江省自然科学基金《网络通信和信息传播中的离散优化问题》(2008-2010) 教学与课程 课程建设 国家精品资源共享课《数学建模》负责人 国家级教学团队《数学建模方法与实践》成员 国家精品课程《数学建模》主讲教师 浙江大学荣誉课程《线性代数》、《数学建模》主讲教师 课程教学 竺可桢学院荣誉课程:数学建模,线性代数(I)(II) 运筹学方向专业课程:组合优化,数学规划(运筹学),最优化(2004-2007) 通识课程:数学建模(通识核心)、运筹与决策(原应用运筹学)(通识选修) 工程教育高级班辅修课程:数学建模 研究生课程:组合优化、计算复杂性、图论与组合学、排序(调度)理论,近似算法,博弈论 教材 谈之奕、林凌:组合优化与博弈论,浙江大学出版社,2015 杨启帆、谈之奕、何勇:数学建模,浙江大学出版社,2008 在线课程 组合优化(导引) 中国大学MOOC 数学建模(基础篇)中国大学MOOC

研究领域

· 运筹学组合优化 · 算法设计与分析 · 算法博弈论

近期论文

查看导师新发文章 (温馨提示:请注意重名现象,建议点开原文通过作者单位确认)

52 Chen Tianqi, Tan Zhiyi, Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan, Information Processing Letters, 191, 106598, 2026(SCI). 51 Lin Ling, Tan Zhiyi, Price of Anarchy of scheduling games on hierarchical machines with quadratic social cost, Asia-Pacific Journal of Operations Research, 42, 2450010, 2025(SCI). 50 Wang Zhuyinan, Zhang Chen, Tan Zhiyi, Inefficiency of multiplicative approximate Nash equilibrium for scheduling games. Journal of Combinatorial Optimization, 49, Article No. 38, 2025(SCI). 49 Yu Lishi, Tan Zhiyi, Scheduling with periodic availability constraints to minimize makespan. Journal of Scheduling, 27:277–297, 2024(SCI). 48 Chen Yong, Zhang An, Tan Zhiyi, Xue Ying, Chen Guangting, A 3/2-approximation algorithm for scheduling on two parallel machines with job delivery coordination. Journal of the Operational Research Society, 72, 9, 1929–1942, 2021(SCI, SSCI). 47 Li Rongqi, Tan Zhiyi, Zhu, Qianyu, Batch scheduling of nonidentical job sizes with minsum criteria, Journal of Combinatorial Optimization, 42, 543-564, 2021(SCI). 46 He Caoyu, Tan Zhiyi, Coordination mechanisms for scheduling games with machine modification. International Transactions in Operational Research, 28, 904–925, 2021(SCI, SSCI). 45 Chen Qianqian, Tan Zhiyi, Mixed coordination mechanisms for scheduling games on hierarchical machines. International Transactions in Operational Research, 28, 419–437, 2021(SCI, SSCI). 44 Dósa Gyorgy, Fügenschuh Armin, Tan, Zhiyi, Tuza, Zsolt, Węsek, Krzysztof, Tight lower bounds for semi-online scheduling on two uniform machines with known optimum. Central European Journal of Operations Research, 27, 1107-1130, 2019(SCI). 43 Dósa Gyorgy, Fügenschuh Armin, Tan Zhiyi, Tuza Zsolt, Węsek Krzysztof, Tight upper bounds for semi-online scheduling on two uniform machines with known optimum. Central European Journal of Operations Research, 26, 161-180, 2018(SCI). 42 Chen, Qianqian, Lin, Ling, Tan Zhiyi, Yan Yujie, Coordination mechanisms for scheduling games with proportional deterioration, European Journal of Operational Research, 263, 2017.(SCI) 41 Balogh, Janos, Békési, Jozsef, Galambos, Gabor,, Lower bound for 3-batched bin packing, Discrete Optimization, 21, 2016.(SCI) 40 Lin Ling, Xian Xiaochen, Yan Yujie, He Xing, Tan Z, Inefficiency of equilibria for scheduling game with machine activation costs, Theoretical Computer Science, 607, 2015.(SCI) 39 Tan Zhiyi, Li Rongqi, Pseudo lower bounds for online parallel machine scheduling, Operations Research Letters, 43, 2015.(SCI) 38 Gu Mengyang, Tan Zhiyi, Xia Binzhou, Yan Yujie, A new approach for bicriteria partitioning problem, Optimization Letters, 9, 2015.(SCI) 37 Yan Yujie, Ding Zhihao, Tan Zhiyi, A note on the lower bound for the Price of Anarchy of scheduling games on unrelated machines, Discrete Applied Mathematics, 186, 2015.(SCI) 36 Wan Long, Ding Zhihao, Li Yunpeng, Chen Qianqian, , Scheduling to minimize the maximum total completion time per machine, European Journal of Operational Research, 242, 2015.(SCI) 35 Dosa Gyorgy, Tan Zhiyi, Tuza Zsolt, Yan Yujie, Lá, Improved Bounds for Batch Scheduling with Nonidentical Job Sizes, Naval Research Logistics, 61, 2014.(SCI) 34 Lin Ling, Tan Zhiyi, Inefficiency of Nash Equilibrium for scheduling games with constrained jobs: A parametric analysis, Theoretical Computer Science, 521, 2014. 33 Tan Zhiyi, Chen Yong, Zhang An, On the exact bounds of SPT for scheduling on parallel machines with availability constraints, International Journal of Production Economics, 146, 2013.(SCI) 32 Chen Yong,Zhang An,Tan Zhiyi, Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time, Information Sciences, 251, 2013.(SCI) 31 Tan Zhiyi,Wan Long,Zhang Qi,Ren Wei, Inefficiency of equilibria for the machine covering game on uniform machines, Acta Informatica, 49, 2012.(SCI) 30 Han Fangqiu,Tan Zhiyi,Yang Yang, On the optimality of List Scheduling for online uniform machines scheduling, Optimization Letters, 6, 2012.(SCI) 29 Chen Yong,Zhang An,Tan Zhiyi, Single machine scheduling with semi-resumable machine availability constraints, Applied Mathematics A Journal of Chinese Universit, 26, 2012.(SCI) 28 Tan Zhiyi, Chen Yong, Zhang An, Parallel machines scheduling with machine maintenance for minsum criteria, European Journal of Operational Research, 212, 2011.(SCI) 27 Zhang An, Jiang Yiwei, Tan Zhiyi, Online and semi-online scheduling on capacitated two-parallel machines, Asia-Pacific Journal of Operations research, 28, 2011.(SCI) 26 Tan Zhiyi, Zhang An, Online hierarchical scheduling: An approach using mathematical programming, Theoretical Computer Science, 412, 2011.(SCI) 25 Xia Binzhou, Tan Zhiyi, Tighter bounds of the First Fit algorithm for the bin-packing problem, Discrete Applied Mathematics, 158, 2010.(SCI) 24 Tan Zhiyi, Zhang An, A note on hierarchical scheduling on two uniform machines, Journal of Combinatorial Optimization, 20, 2010.(SCI) 23 Dosa Gyorgy, Tan Zhiyi, New upper and lower bounds for online scheduling with machine cost, Discrete Optimization, 7, 2010.(SCI) 22 Chen Xingyu, Epstein Leah, Tan Zhiyi, Semi-online machine covering for two uniform machines, Theoretical Computer Science, 410, 2009.(SCI) 21 Zhang An, Jiang Yiwei, Tan Zhiyi, Online parallel machines scheduling with two hierarchies, Theoretical Computer Science, 410, 2009.(SCI) 20 Ng C. T., Tan Zhiyi, He Yong, Cheng T. C. E., Two semi-online scheduling problems on two uniform machines, Theoretical Computer Science, 410, 2009.(SCI) 19 Lin Ling, He Dong, Tan Zhiyi, Bounds on delay start LPT algorithm for scheduling on two identical machines in the lp norm, Journal of Industrial and Management Optimization, 4, 2008.(SCI) 18 Jiang Yiwei, Zhang An, Tan Zhiyi, Online coupon consumption problem, Journal of Combinatorial Optimization, 16, 2008.(SCI) 17 Tan Zhiyi, Yu Shaohua, Online scheduling with reassignment, Operations Research Letters, 36, 2008.(SCI) 16 Cao Shunjuan, Tan Zhiyi, Online Uniform Machine Covering with Known the Largest Size, Progress in Natural Science, 17, 2007.(SCI) 15 Zhong Weiya, Dosa Gyorgy, Tan Zhiyi, On the machine scheduling problem with job delivery coordination, European Journal of Operational Research, 182, 2007.(SCI) 14 Tan Zhiyi,He Yong, Semi-online scheduling problems on two identical machines with inexact partial information, Theoretical Computer Science, 377, 2007.(SCI) 13 Tan Zhiyi,He Yong, Linear time algorithms for parallel machine scheduling, Acta Mathematica Sinica(English Series), 23, 2007.(SCI) 12 Tan Zhiyi, Wu Yong, Optimal semi-online algorithms for machine covering, Theoretical Computer Science, 372, 2007.(SCI) 11 Tan Zhiyi, Cao Shunjuan, Semi-online machine covering on two uniform machines with known total size, Computing, 78, 2006.(SCI) 10 Jiang Yiwei, Tan Zhiyi, He Yong, Preemptive machine covering on parallel machines, Journal of Combinatorial Optimization, 10, 2005.(SCI) 9 Tan Zhiyi,He Yong,Epstein Leah, Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data, Information and Computation, 196, 2005.(SCI) 8 谈之奕,何勇, 并行处理系统的有序调度问题及其渐近最优算法, 中国科学(E), 33, 2003.(SCI) 7 He Yong,Tan Zhiyi, Randomized on-line and semi-on-line scheduling on identical machine, Asia-Pacific Journal of Operations research, 20, 2003.(SCI) 6 He Yong,Tan Zhiyi,Zhu Jing,Yao Enyu, k-Partitioning Problems for Maximizing the Minimum Load, Computers & Mathematics with Applications, 46, 2003.(SCI) 5 Tan Zhiyi,He Yong, Semi-on-line problems on two identical machines with combined partial information, Operations Research Letters, 30, 2002.(SCI) 4 Tan Zhiyi,He Yong, Optimal online algorithm for two identical machine scheduling with machine availability constraints, Information Processing Letters, 83, 2002.(SCI) 3 Tan Zhiyi,He Yong, Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times, Computer & Mathematics with Applications, 43, 2002.(SCI) 2 He Yong,Tan Zhiyi, Ordinal on-line scheduling for maximizing the minimum machine completion time, Journal of Combinatorial Optimization, 6, 2002.(SCI) 1 Tan Zhiyi,He Yong, Semi online scheduling with ordinal data on two uniform machines, Operations Research Letters, 28, 2001.(SCI)

推荐链接
down
wechat
bug