公司logo

中国科学技术大学

985
211
34所
双一流

联系方式:551-63602924;63602925

  • 地区:安徽
  • 类型:理工类
  • 隶属:中央部委

学科建设:院士:45 硕士点:一级34 博士点:二级28 国家重点学科:一级8,二级4

院校排名:综合排名:15 理工类:5

地址:安徽省合肥市金寨路 96 号,邮政编码:230026

首页

中国科学技术大学管理学院导师介绍:陈华平

管理学院 中国 导师

2019-05-27

9858

个人简介:

陈华平,男,教授,博士生导师。1987年在中国科学技术大学取得计算机学士学位,并分别于1990年和1997年在中国科学技术大学取得计算机软件硕士学位和博士学位,曾应邀在美国芝加哥大学、香港理工大学、香港城市大学等研究机构进行相关领域的学术访问与研究工作。入选教育部新世纪优秀人才支持计划。已在国际主要期刊IEEE Trans、IJPR、IJPE、COR等期刊发表30余篇论文。

主要研究方向:

计算智能、商务智能、智能优化算法及其应用、管理信息与决策支持系统等。

科研项目:

主持完成了国家863项目“曙光3000客户端集成环境的研究与开发”;

以技术负责人完成国家863重点项目《安徽省防灾减灾智能信息与决策支持系统》;

主持完成了国家863计划项目《合肥网格结点的建设及若干典型网格应用的研制》;

负责“十五”期间国家科技大平台工程中的“国家网络计算环境平台建设”项目中的子课题研究;

负责国家“下一代互联网示范工程”中“基于CNGI的中国国家网格应用”项目中的子课题研究;

主持“十一五”国家863计划项目“基于应用调度的网格服务环境及若干网格应用的研制”的研究;

主持完成多项国家自然科学基金项目、教育部博士点基金项目、国家自然基金委创新群体项目子课题、国家自然科学基金海外或港澳青年合作基金(境内负责人)等课题,同时承担了中国科学院院地合作项目、企业合作项目近十项。

主要获奖:

获得2001年度“国家科技进步二等奖”。

主要论文:

Shengchao Zhou, Huaping Chen, Xueping Li, Distance matrix based heuristics to minimize makespan of parallel batch processing machines with arbitrary job sizes and release times, Applied Soft Computing, Vol.52, pp.630-641, 2017.

Zheng C, Chen H, Xu R. Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect[J]. Natural Computing, 2016: 1-13.

Shengchao Zhou, Xueping Li, Huaping Chen, Cong Guo, Minimizing makespan in a no-wait flowshop with two batch processing machines using estimation of distribution algorithm, International Journal of Production Research, Vol.54, pp.4919-4937, 2016.

Shengchao Zhou, Ming Liu, Huaping Chen, Xueping Li, An effective discrete differential evolution algorithm for scheduling uniform parallel batch processing machines with non-identical capacities and arbitrary job sizes, International Journal of Production Economics,Vol.179, pp.1-11, 2016.

X. Liang, H. Chen and J. A. Lozano, A Boltzmann-based Estimation of Distribution Algorithm for a General Resource Scheduling Model,IEEE Transactions on Evolutionary Computation, Vol.19, pp.793-806, Dec.2015.

Liang X, Chen H, Xu R. Approximately optimal algorithms for scheduling a single machine with general convex resource functions, International Journal of Computer Integrated Manufacturing, 28(9): 920-935, 2015.

Zhongya Li, Huaping Chen, Rui Xu, Xueping Li, Earliness–tardiness minimization on scheduling a batch processing machine with non-identical job sizes, Computers & Industrial Engineering, Vol.87, pp. 590–599, Sept.2015.

Huaping Chen, Shengchao Zhou, Xueping Li &RuiXu, A hybrid differential evolution algorithm for a two-stage flow shop on batch processing machines with arbitrary release times and blocking, International Journal of Production Research, 2014, 52(19): 5714-5734

Shengchao Zhou, Huaping Chen, Rui Xu, and Xueping Li. Minimising makespan on a single batch processing machine with dynamic job arrivals and non-identical job sizes, International Journal of Production Research,2014, 52(8): 2258-2274.

Rui Xu, Huaping Chen, Xueping Li. A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system. International Journal of Production Economics: 2013, 145(1): 371-386.

Xiaolin Li, Yanli Huang, Qi Tan, and Huaping Chen. Scheduling unrelated parallel batch processing machines with non-identical job sizes. Computers & Operations Research, 2013, 40(12): 2983-2990.

Shengchao Zhou, Huaping Chen, Rui Xu, Xueping Li, Xinle Liang, and Zhongya Li. Makespan Minimization on a Single Batch Processing Machine. Proceedings of the 2013 Industrial and Systems Engineering Research Conference (ISERC), San Juan, Puerto Rico, USA, May, 2013.

Xinle Liang, Huaping Chen, Rui Xu, Xueping Li, Bo Yang, Shengchao Zhou, and Zhongya Li. Resource consumption minimization of scheduling on single serial batch-processing machine. Proceedings of the 2013 Industrial and Systems Engineering Research Conference (ISERC), San Juan, Puerto Rico, USA, May, 2013.

Yaxiong Cai, Huaping Chen, Rui Xu, Hao Shao and Xueping Li. An Estimation of Distribution Algorithm for the 3D Bin Packing Problem with Various Bin Sizes. Proceedings of the 14th International Conference on Intelligent Data Engineering and Automated Learning (IDEAL), Hefei, Anhui, China, October, 2013: 401-408.

Xiaolin Li, Huaping Chen, Bing Du, and Qi Tan. Heuristics to schedule uniform parallel batch processing machines with dynamic job arrivals. International Journal of Computer Integrated Manufacturing, 2012, 26(5): 474-486.

RuiXu, Huaping Chen, Xueping Li. Makespan Minimization for Single Batch Processing Machine via Ant Colony Optimization. Computers & Operations Research : 2012, 39(3): 582-593.

Huaping Chen, Bing Du, George Q. Huang, Scheduling a batch processing machine with non-identical job sizes: a clustering perspective, International Journal of Production Research,Volume 49, Issue 19, 2011.

Chen H, Du B, Huang G Q. Metaheuristics to minimise makespan on parallel batch processing machines with dynamic job arrivals. International Journal of Computer Integrated Manufacturing, 2010. Vol 23, Issue 10: 942-956.

Hao Shao, Huaping Chen, etc., Minimizing makespan for single burn-in oven scheduling problems using ACO+DP approach, International Journal of Manufacturing Research, No.3, Vol.5, ,2010.

Yaling Zhang, Huaping Chen., Hao Shao, Rui Xu Minimizing Makespan for Single Batch Processing Machine with Non-identicalJob Sizes Using a Novel Algorithm: Free Search, 2009 International Conference on Information Technolgy and Computer Science, UKRAINE, 2009.7.

Yu Wang, Huaping Chen., Hao Shao Minimizing Makespan for Parallel Batch Processing Machines with Non-identical Job Sizes using Quantem-behaved Particle Swarm Optimization, 2009 International Conference on Intelligent Systems and Knowledge Engineering (ISKE2009,Belgium), 2009-11-27.

B.Y. Cheng, H.P. Chen, et al., A Chaotic Ant Colony Optimization Method for Scheduling a Single Batch-processing Machine with Non-identical Job Sizes. 2008 IEEE Congress on Evolutionary Computation, Vols 1-8, 2008: p. 40-43.

B.Y. Cheng, H.P. Chen, and S.S. Wang, Fuzzy Scheduling for Single Batch-processing Machine with Non-identical Job Sizes. 2008 Ieee International Conference on Fuzzy Systems, Vols 1-5, 2008: p. 27-30.

Rui Xu, Huaping Chen, et al., Minimizing the total completion time on a single batch processing machine with non-identical job sizes using ant colony optimization. 2008 3rd IEEE Conference on Industrial Electronics and Applications, 2008: p. 2211-15.

Shao, H., Chen H.P. et al., Minimizing makespan for parallel batch processing machines with non-identical job sizes using neural nets approach. Iciea 2008: 3rd IEEE Conference on Industrial Electronics and Applications, Proceedings, Vols 1-3, 2008: p. 1921-1924.

Shao, H., Chen H.P., et al., Minimizing Makespan for a Single Batch Processing Machine with Non-identical Job Sizes Using Neural Nets Approach. ICNC 2008: Fourth International Conference on Natural Computation, Vol 6, Proceedings, 2008: p. 511-514.

Xu, R., Chen H.P., et al., A Hybrid Ant Colony Optimization to Minimize the Total Completion Time on a Single Batch Processing Machine with Non-identical Job Sizes. ICNC 2008: Fourth International Conference on Natural Computation, Vol 7, Proceedings, 2008: p. 439-443.

Zhang, W.G., Chen H.P., et al., A Novel Differential Evolution Algorithm for a Single Batch-processing Machine with Non-identical Job Sizes. ICNC 2008: Fourth International Conference on Natural Computation, Vol 6, Proceedings, 2008: p. 447-451.

Z.H. Jia, H.P. Chen, and J. Tang, An improved particle swarm optimization for multi-objective flexible job-shop scheduling problem. Proceedings of 2007 Ieee International Conference on Grey Systems and Intelligent Services, Vols 1 and 2, 2007: p. 1584-1589.

Huang, GQ, Qu, T, Chen, HP, Extending Analytical Target Cascading for Optimal Configuration of Supply Chains with Alternative Autonomous Suppliers. The 4th International Conference on Digital Enterprise Technology, Bath, September 19-21,2007.

【考研党必备学习资料包】:考研真题+免费择校择专业+免费考研复习规划,更有考研课程优惠券等你来加购~名额有限立即领取【领取链接】

【启航教育考研辅导课程推荐】:面授课集训营(寒假学霸营,>22全年集训营),专业课一对一辅导考研网课全程班包含公共课以及专业课,这些课程中都会配有内部讲义以及辅导书和资料,同时会有教研教辅双师模式对大家进行教学以及督学,并配有24小时答疑和模拟测试等,具体详情可直接咨询在线客服老师。


END

涵盖31省,862所院校,756个专业

为考研学子提供院校咨询专业咨询备考咨询

使用声明:

1.本查询系统的信息主要来源于各研招单位招生网及对外公开的数据、国家官网公布的数据

2.本平台历年高校数据仅供考生参考,如各招生数据与院校公布数据不一致,请以各高校正式公布的数据为准。

 一对一答疑

获取一对一答疑

首页 | 研究生兼职 | 付款方式 | 集训基地 | 关于我们  | 产品合作  | 网站地图

Copyright©1998-2020 jixun.iqihang.com 京ICP备16062423号

北京市启航世纪科技发展有限公司 服务热线:400-108-7500

京公网安备 11010802028430号