談之奕

談之奕，男，博士，浙江大學數學系教授，博士生導師。

基本介紹

• 中文名：談之奕
• 畢業院校：浙江大學
• 學位/學歷：博士
• 專業方向：運籌學組合最佳化、算法設計與分析、算法博弈論
• 就職院校：浙江大學

個人經歷

1992年9月—1996年7月 浙江大學套用數學系（本科）

1996年9月—2001年6月 浙江大學數學系（碩士、博士）

2001年7月—2003年7月 浙江大學系統科學與工程學系（博士後）

2003年8月—2007年12月 浙江大學數學系副研究員

2007年12月—2009年3月 浙江大學數學系教授

2009年3月— 浙江大學數學系教授，博士生導師

國家精品資源共享課《數學建模》負責人

國家級教學團隊《數學建模方法與實踐》成員

國家精品課程《數學建模》主講教師

浙江大學榮譽課程《線性代數》《數學建模》主講教師

浙江大學數學建模實踐基地指導教師

主講課程

本科生課程

竺可楨學院榮譽課程：數學建模，線性代數（I）（II）

運籌學方向專業課程：組合最佳化，數學規劃，最最佳化（2004－2007）

通識課程：運籌與決策（原套用運籌學）

工程教育高級班輔修課程：數學建模

研究生課程

計算複雜性、組合最佳化、圖論與組合學、排序（調度）理論，近似算法，博弈論。

研究方向

·運籌學組合最佳化

·算法設計與分析

·算法博弈論

學術成果

[1] Chen, Qianqian, Lin, Ling, Tan Zhiyi, Yan Yujie, Coordination mechanisms for scheduling games with proportional deterioration, European Journal of Operational Research, 263, 2017.(SCI)

[2] Balogh, Janos, Békési, Jozsef, Galambos, Gabor,, Lower bound for 3-batched bin packing, Discrete Optimization, 21, 2016.(SCI)

[3] 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)

[4] Tan Zhiyi, Li Rongqi, Pseudo lower bounds for online parallel machine scheduling, Operations Research Letters, 43, 2015.(SCI)

[5] Gu Mengyang, Tan Zhiyi, Xia Binzhou, Yan Yujie, A new approach for bicriteria partitioning problem, Optimization Letters, 9, 2015.(SCI)

[6] 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)

[7] 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)

[8] Dosa Gyorgy, Tan Zhiyi, Tuza Zsolt, Yan Yujie, Lá, Improved Bounds for Batch Scheduling with Nonidentical Job Sizes, Naval Research Logistics, 61, 2014.(SCI)

[9] Lin Ling, Tan Zhiyi, Inefficiency of Nash Equilibrium for scheduling games with constrained jobs: A parametric analysis, Theoretical Computer Science, 521, 2014.

[10] 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)

[11] 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)

[12] Tan Zhiyi,Wan Long,Zhang Qi,Ren Wei, Inefficiency of equilibria for the machine covering game on uniform machines, Acta Informatica, 49, 2012.(SCI)

[13] Han Fangqiu,Tan Zhiyi,Yang Yang, On the optimality of List Scheduling for online uniform machines scheduling, Optimization Letters, 6, 2012.(SCI)

[14] 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)

[15] Tan Zhiyi, Chen Yong, Zhang An, Parallel machines scheduling with machine maintenance for minsum criteria, European Journal of Operational Research, 212, 2011.(SCI)

[16] 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)

[17] Tan Zhiyi, Zhang An, Online hierarchical scheduling: An approach using mathematical programming, Theoretical Computer Science, 412, 2011.(SCI)

[18] Xia Binzhou, Tan Zhiyi, Tighter bounds of the First Fit algorithm for the bin-packing problem, Discrete Applied Mathematics, 158, 2010.(SCI)

[19] Tan Zhiyi, Zhang An, A note on hierarchical scheduling on two uniform machines, Journal of Combinatorial Optimization, 20, 2010.(SCI)

[20] Dosa Gyorgy, Tan Zhiyi, New upper and lower bounds for online scheduling with machine cost, Discrete Optimization, 7, 2010.(SCI)

[21] Chen Xingyu, Epstein Leah, Tan Zhiyi, Semi-online machine covering for two uniform machines, Theoretical Computer Science, 410, 2009.(SCI)

[22] Zhang An, Jiang Yiwei, Tan Zhiyi, Online parallel machines scheduling with two hierarchies, Theoretical Computer Science, 410, 2009.(SCI)

[23] 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)

[24] 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)

[25] Jiang Yiwei, Zhang An, Tan Zhiyi, Online coupon consumption problem, Journal of Combinatorial Optimization, 16, 2008.(SCI)

[26] Tan Zhiyi, Yu Shaohua, Online scheduling with reassignment, Operations Research Letters, 36, 2008.(SCI)

[27] Cao Shunjuan, Tan Zhiyi, Online Uniform Machine Covering with Known the Largest Size, Progress in Natural Science, 17, 2007.(SCI)

[28] Zhong Weiya, Dosa Gyorgy, Tan Zhiyi, On the machine scheduling problem with job delivery coordination, European Journal of Operational Research, 182, 2007.(SCI)

[29] Tan Zhiyi,He Yong, Semi-online scheduling problems on two identical machines with inexact partial information, Theoretical Computer Science, 377, 2007.(SCI)

[30] Tan Zhiyi,He Yong, Linear time algorithms for parallel machine scheduling, Acta Mathematica Sinica（English Series）, 23, 2007.(SCI)

[31] Tan Zhiyi, Wu Yong, Optimal semi-online algorithms for machine covering, Theoretical Computer Science, 372, 2007.(SCI)

[32] Tan Zhiyi, Cao Shunjuan, Semi-online machine covering on two uniform machines with known total size, Computing, 78, 2006.(SCI)

[33] Jiang Yiwei, Tan Zhiyi, He Yong, Preemptive machine covering on parallel machines, Journal of Combinatorial Optimization, 10, 2005.(SCI)

[34] 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)

[35] 談之奕,何勇, 並行處理系統的有序調度問題及其漸近最優算法, 中國科學(E), 33, 2003.(SCI)

[36] He Yong,Tan Zhiyi, Randomized on-line and semi-on-line scheduling on identical machine, Asia-Pacific Journal of Operations research, 20, 2003.(SCI)

[37] He Yong,Tan Zhiyi,Zhu Jing,Yao Enyu, k-Partitioning Problems for Maximizing the Minimum Load, Computers & Mathematics with Applications, 46, 2003.(SCI)

[38] Tan Zhiyi,He Yong, Semi-on-line problems on two identical machines with combined partial information, Operations Research Letters, 30, 2002.(SCI)

[39] Tan Zhiyi,He Yong, Optimal online algorithm for two identical machine scheduling with machine availability constraints, Information Processing Letters, 83, 2002.(SCI)

[40] Tan Zhiyi,He Yong, Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times, Computer & Mathematics with Applications, 43, 2002.(SCI)

[41] He Yong,Tan Zhiyi, Ordinal on-line scheduling for maximizing the minimum machine completion time, Journal of Combinatorial Optimization, 6, 2002.(SCI)

[42] Tan Zhiyi,He Yong, Semi online scheduling with ordinal data on two uniform machines, Operations Research Letters, 28, 2001.(SCI)

科研項目

國家自然科學基金《平行機排序問題的新模型和新算法》（2004－2006）

國家自然科學基金《排序若干新問題的算法設計與分析》（2007－2009）

國家自然科學基金《排序問題的博弈分析和多目標排序》（2010－2012）

國家自然科學基金《分散決策模式下的排序問題研究》（2013－2016）

國家自然科學基金《平行機排序博弈的均衡分析與機制設計》（2017－2020）

浙江省傑出青年科學基金《若干組合最佳化問題的算法設計與分析》（2012－2014）

浙江省自然科學基金《網路通信和信息傳播中的離散最佳化問題》（2008－2010）