删除或更新信息,请邮件至freekaoyan#163.com(#换成@)

安徽大学互联网学院导师教师师资介绍简介-贾兆红

/2021-04-19

导师简介 院(系、所):互联网学院 姓名: 贾兆红 性别: 女 技术职称: 教授 导师类别:博导/硕导 联系方式 Jiazhaohong001@163.com 招生专业名称 计算机科学与技术 1. 人工智能及其应用 主要研究方向 个人简历 学术成果 2. 多目标优化算法及其应用 3. 数据挖掘、大数据分析 教授、博士、博士生导师,副院长。2012 年 9 月~2013 年 9 月在美国新泽西理工学院进行访学;安徽大学首批青年骨干教师培养对象。 在国内外重要学术期刊和国际学术会议上发表学术论文 50 余篇,其中 SCI\EI 收录约 40 篇,TOP 期刊 8 篇; 申请多项国家发明专利,其中已授权 2 项; 参编专著《机器学习与智能决策系统》(科学出版社)、《半导体生产中的排序理论与算法》(清华大学出版社/待出版); 先后主持两项国家自然科学基金、教育部青年基金、省自然科学基金、教育厅自然科学重点项目,及企业委托横向项目。 担任国际期刊 Applied Soft Computing 编委;担任 IEEE Automation Science and Engineering 、 IEEE Industrial Electronics 、 IEEE Systems, Man and Cybernetics: Systems 、 Swarm and Evolutionary Computation 、 Knowledge-Based Systems、International Journal of Web Services Research、 Applied soft computing 、Soft Computing 、International Journal of Systems Science、European Journal of Industrial Engineering、Journal of Industrial and Management Optimization、Optimization Letters、自动化学报等国内外重要期刊的审稿人。 近五年代表作: [1] JIA Zhao-hong*, CUI Yu-fei( 研究生), LI Kai. An ant colony-based algorithm for integrated scheduling on batch machines with non-identical capacities. Applied Intelligence, 2021. (SCI 源刊, 已录用) [2] JIA Zhao-hong*, PAN Le( 研究生)i, LIU Xiao, LI Xue-jun. A novel cloud workflow scheduling algorithm based on stable matching game theory. Journal of Supercomputing, 2021. (SCI 源刊, 已录用) [3] WANG Yan( 研 究 生 ), JIA Zhao-hong*, LI Kai. A multi-objective co-evolutionary algorithm of scheduling on parallel non-identical batch machines. Expert Systems with Applications, 2021, 167, 114145. (EI, TOP) [4] QIAN Si-yuan( 研究生), JIA Zhao-hong*, LI Kai. A Multi-objective Evolutionary Algorithm Based on Adaptive Clustering for Energy-aware Batch Scheduling Problem. Future Generation Computer Systems. 2020, 113: 441-453. (SCI, TOP) [5] ZHANG Han( 研 究 生 ), JIA Zhao-hong*; LI Kai; Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines, Computers & Operations Research, 2020, 117: 104889. (SCI,二区) [6] YANG Yang( 研究生), JIA Zhao-hong*, ZHANG Yi-wen, LI Kai. An Improved ACO with First-job Restriction and PANT for Batch Scheduling Problem. 2019 IEEE Smart World, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation, Leicester, United Kingdom, 2019, 974-980. (CCF C 会议) [7] JIA Zhao-hong*, LI Ya-jie( 研 究 生 ), LI Kai, CHEN Hua-ping. Weak-restriction bi-objective optimization algorithm for scheduling with rejection on non-identical batch processing machines. Applied Soft Computing. 2020, 86, 1-13. (SCI) [8] 贾兆红, 王燕(研究生), 张以文. 求解差异机器平行批调度的双目标协同蚁群算法. 自动化学报. 2020, 46(6): 1121-1135. [9] Jia Zhao-hong, Gao Le-Yang( 研究生), et al. A new history-guided multi-objective evolutionary algorithm based on decomposition for batching scheduling. Expert Systems with Applications, 2020, 141. (SCI/EI, JCR 一区, TOP) [10] Jia Zhao-hong, Wang Yan( 研究生), et al. Multi-objective energy aware batch scheduling using ant colony optimization algorithm. Computer & Industrial Engineering, 2019, 131, 41-56.(SCI/EI,JCR 二区) [11] 贾兆红,王燕(研究生),等. 一种基于蚁群的多目标协同优化算法.自动化学报(EI,已录用) [12] Zhang Han(研究生), Jia Zhaohong, et al. Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines. Computers & Operations Research, 2020. (SCI/EI,JCR 二区) [13] Jia Zhaohong, Yan Jianhai(研究生), et al. Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities. Applied Soft Computing, 2019, 75: 548-561. (SCI/EI,JCR 二区) [14] Jia Zhao-hong, Zhang Han( 研究生), et al. A meta-heuristic for minimizing total weighted flow time on parallel batch machines. Computers & Industrial Engineering, 2018, 125: 298-308. (SCI/EI,JCR二区) [15] Jia Zhao-hong, Zhuo Xue-xue(研究生), et al. Integrated production and transportation on parallel batch machines to minimize total weighted delivery time. Computers & Operations Research, 2019, 102: 39-51. (SCI/EI,JCR 二区) [16] Zhaohong Jia, Xiaohao Li(研究生), Joseph Y.T. Leung. Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities. Future Generation Computer Systems, 2017: 67, 22-34. (SCI/EI,JCR 二区,TOP) [17] Zhaohong Jia, Ming-li Pei( 研 究 生 ), Joseph Y.-T. Leung. Multi-objective ACO algorithms to minimize the makespan and the total rejection cost on BPMs with arbitrary job weights, International Journal of Systems Science, 2017, 48:16, 3542-3557. (SCI/EI,JCR 二区) [18] Zhao-hong Jia, Yu-lan Zhang(研究生), Joseph Y.-T. Leung, Kai Li. Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines. Applied Soft Computing, 2017, 55: 226-237. (SCI/EI,JCR 二区) [19] JIA Zhaohong, WANG Chao( 研究生), LEUNG Joseph Y.-T. An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families. Applied Soft Computing, 2016, 38: 395-404. (SCI/EI,JCR 二区) 获奖情况 2015 年获省级教学成果二等奖 在研项目 近年主持项目: 1) 国家自然科学基金面上基金(项目编号:71971002),2020.1-2023.12; 2) 国家自然科学基金青年基金(项目编号:71601001),2017.1-2019.12; 3) 教育部青年基金项目(项目编号:15YJC630041); 4) 安徽省自然科学基金面上项目(项目编号:1608085MG154); 5) 安徽省教育厅自然科学重点项目(项目编号:KJ2015A062); 6) 多项企业委托开发的横向课题。
相关话题/

  • 领限时大额优惠券,享本站正版考研考试资料!
    大额优惠券
    优惠券领取后72小时内有效,10万种最新考研考试考证类电子打印资料任你选。涵盖全国500余所院校考研专业课、200多种职业资格考试、1100多种经典教材,产品类型包含电子书、题库、全套资料以及视频,无论您是考研复习、考证刷题,还是考前冲刺等,不同类型的产品可满足您学习上的不同需求。 ...
    本站小编 Free壹佰分学习网 2022-09-19