韩鑫
个人信息Personal Information
教授
博士生导师
硕士生导师
主要任职:Professor
性别:男
毕业院校:日本京都大学
学位:博士
所在单位:软件学院、国际信息与软件学院
学科:计算机软件与理论. 运筹学与控制论
联系方式:hanxin@dlut.edu.cn
扫描关注
- [1]Zhang, Minghui,Han, Xin,Lan, Yan.Approximation algorithms for two-stage flexible flow shop scheduling[J],JOURNAL OF COMBINATORIAL OPTIMIZATION,2020,39(1):1-14
- [2]Li, Jiaxin,Han, Xin.Revised Pulse Algorithm for Elementary Shortest Path Problem with Resource Constraints[A],2019,37-44
- [3]Han, Xin,Chen, Qinyang,Makino, Kazuhisa.Online knapsack problem under concave functions[J],THEORETICAL COMPUTER SCIENCE,2019,786:88-95
- [4]张明会,韩鑫.一类带平行机的两阶段柔性流水调度近似算法[J],应用数学学报,2018,41(3):420-432
- [5]Yang, Yi-Hua,Liao, Chung-Shou,Han, Xin,Zhang, Louxin.Online buffer management for transmitting packets with processing cycles[J],THEORETICAL COMPUTER SCIENCE,2018,723:73-83
- [6]Wang, Zhenbo,Han, Xin,Dosa, Gyorgy,Tuza, Zsolt.A General Bin Packing Game: Interest Taken into Account[J],ALGORITHMICA,2018,80(5,SI):1534-1555
- [7]Han, Xin,Wang, Yinling.A New Approximation Algorithm for Flow Shop with Transporter Coordinate[A],2018,882:116-140
- [8]韩鑫.An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines Under Dynamic Priority S...[A],2018
- [9]Lan, Yan,Han, Xin,Wang, Yinling,Ge, Min,Guo, He,Chen, Xin.Flowshop problem F2 → D|v = 1,c ≥ ?|Cmaxrevisited[J],Theoretical Computer Science,2017,670(670):79-85
- [10]Lan, Yan,Han, Xin,Wang, Yinling,Ge, Min,Guo, He,Chen, Xin.Flowshop problem F2 -> D broken vertical bar nu = c >= 1 vertical bar C-max revisited[J],THEORETICAL COMPUTER SCIENCE,2017,670:79-85
- [11]张明会,韩鑫.物品大小不超过1/2的一维在线装箱模型研究[J],系统科学与数学,2017,37(3):781-791
- [12]Zhang, Minghui,Han, Xin,Lan, Yan,Ting, Hing-Fung.Online bin packing problem with buffer and bounded size revisited[J],JOURNAL OF COMBINATORIAL OPTIMIZATION,2017,33(2):530-542
- [13]韩鑫.Approximate strip packing: Revisited[J],information and computation,2017,249(1):110-120
- [14]张明会,韩鑫.物品大小不超过$\frac{1}{2}$的一维在线装箱模型研究[J],系统科学与数学,2017,37(3):781-791
- [15]Chen, Xin,Sterna, Malgorzata,Han, Xin,Blazewicz, Jacek.Scheduling on parallel identical machines with late work criterion: Offline and online cases[J],11th Workshop on New Challenges in Scheduling Theory,2016,19(6):729-736
- [16]兰艳,张明会,武宗涛,韩鑫.带等时空载返程运输的双机Flow shop调度问题复杂性[J],计算机科学,2016,43(9):18-22
- [17]Han, Xin,Iwama, Kazuo,Ye, Deshi,Zhang, Guochuan.Approximate strip packing: Revisited[J],INFORMATION AND COMPUTATION,2016,249:110-120
- [18]Han, Xin,Makino, Kazuhisa.Online minimization knapsack problem[J],THEORETICAL COMPUTER SCIENCE,2016,609:185-196
- [19]Lan, Yan,Han, Xin,Wu, Zongtao,Guo, He,Chen, Xin.Complexity of problem TF2|v=1, c=2|Cmax[J],Information Processing Letters,2016,116(1):65-69
- [20]Lan, Yan,Han, Xin,Wu, Zongtao,Guo, He,Chen, Xin.Complexity of problem TF2 vertical bar v=1, c=2 vertical bar C-max[J],INFORMATION PROCESSING LETTERS,2016,116(1):65-69