[可銳教育]專注碩士研究生一對一服務平臺!

咨詢熱線:400-018-9832

首頁 / 研招網 / 安徽研招院 / 合肥工業大學研招院 /

中國科學技術大學管理學院導師介紹:陳華平

合肥工業大學

211 -- -- 教育部研究教學型理工
  加入對比   在線咨詢   關注

院校代碼:10359

人氣指數 :   

21078
超過87.90%的院校

中國科學技術大學管理學院導師介紹:陳華平

發布時間 : 2019-10-23 16:10:08 來源:合肥工業大學研究生院 瀏覽量:

  ?個人簡介:

  陳華平,男,教授,博士生導師。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.

免責聲明

  可銳研招網稿件來源為合肥工業大學研究生官網,如對稿件內容有疑問,請與合肥工業大學招生辦聯系。可銳研招網轉載出于非商業性的教育和科研之目的,不代表贊同其觀點或證實其內容的真實性。如轉載稿涉及版權等問題,請來電或來函聯系可銳研招網修改或刪除。

2019考研保過
合肥工業大學推薦閱讀
  • 找學校
  • 查專業
  • 招生簡章
  • 分數線
  • 找導師

自劃線

:

國家線

:
最新資訊更多
合肥工業大學專區
考研資料 更多
2019考研住宿
關閉

用戶登錄UserLogin

用戶名: *
密   碼: *
驗證碼:
DsdDDs
看不清?換一張
时时彩免费软件