郑大考研网育博书店

标题: 【李文华】郑州大学数学与统计学院研究生导师介绍 [打印本页]

作者: 信息发布    时间: 2017-2-27 19:52
标题: 【李文华】郑州大学数学与统计学院研究生导师介绍

  研究方向:组合最优化/排序理论

  个人简介:

  李文华, 理学博士,教授, 全额资助博士生导师、硕士生导师。现任郑州大学数学与统计学院副院长, 中国运筹学会理事,中国运筹学会排序专业委员会副理事长。2012.07 - 2013.01, 美国纽约大学商学院访问学者。

  基金项目:

  1、主持2016年至2019年国家自然科学基金面上项目(11571321)“同类机上的若干排序问题研究”。

  2、主持2012年至2015年国家自然科学基金面上项目(11171313)“基于调度管理与客户利益之间平衡的排序问题”。3、主持2014年河南省教育厅科学技术研究重点项目(14A110025)“调度管理中的多目标排序问题研究”。

  4、主持2008年至2009年河南省基础与前沿项目(082300410070)“多目标分批排序问题研究”。

  5、主持2002年至2004年河南省自然科学基金项目(0211011000)“优化预测模型的选择研究及应用”。

  主要发表论文

  [1] Wenhua Li, Jie Gao, Jinjiang Yuan,Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan,Asia-Pacific Journal of Operational Research Vol. 32, No. 4 (2015) , DOI: 10.1142/S0217595915500281.

  [2] Wenhua Li, Jinjiang Yuan, Sufang Yang, Online scheduling of incompatible unit-length job families with lookahead, Theoretical Computer Science, 543 (2014) 120–125.

  [3] Kangbok Lee, Joseph Y-T. Leung, Zhao-hong Jia, Wenhua Li, Michael L. Pinedo,Bertrand M.T. Lin,Fast approximation algorithms for bi-criteria scheduling with machine assignment costs,European Journal of Operational Research, 238 (2014) 54–64.

  [4] Chenwen Jiao, Wenhua Li, Jinjiang Yuan, A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines, Asia-Pacific Journal of Operational Research,Vol. 31, No. 4 (2014), DOI:10.1142/S0217595914500304.

  [5] Wenhua Li, Zhengkun Zhang, Sufang Yang,Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead, Information Processing Letters, 112 (2012), 292–297.

  [6] Junling Yuan, Wenhua Li, Jinjiang Yuan,A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints,Theoretical Computer Science, 457(2012), 174-180.

  [7] Wenhua Li, Jinjiang Yuan, Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time,Information Processing Letters, 111 (2011) 907–911.

  [8] Wenhua Li, Queyranne、Sviridenko, Jinjiang Yuan, Approximation algorithms for shop scheduling problems with minsum objective: A correction, Journal of Scheduling, 9 (2006): 569-570.

  [9] Wenhua Li, Jinjiang Yuan,Single machine parallel batch scheduling problem with release dates and three hierarchical criteria to minimize makespan, machine occupation time and stocking cost, International Journal of Production Economics, 102(2006), 143-148.

  [10] Wenhua Li, Jinjiang Yuan, Yixun Lin, A note on special  optimal batching structures to minimize total weighted completion time, Journal of Combinatorial Optimization, 14(2007),475-480.

  [11] Yixun Lin, Wenhua Li, Parallel machine scheduling of machine-dependent jobs with unit-length, European Journal of Operational Research, 156(2004),261-266.

  [12] Wenhua Li, A method for selecting available forecasting model. International Journal of Development Planning Lecture, 15(2000),187-190.




欢迎光临 郑大考研网育博书店 (http://zzuedu.com/) Powered by Discuz! X2.5