姓名：高园

职务/职称：副教授

研究领域：图论与组合最优化

邮箱：gaoyuan_maths @zzu.edu.cn

简要经历

高园，女，河南固始人，理学博士，郑州大学数学与统计学院硕士研究生导师。2011年获得郑州大学数学与统计学院数学与应用数学专业理学学士学位。2014年获得郑州大学数学与统计学院运筹学与控制论专业理学硕士学位。2018年获得郑州大学数学与统计学院运筹学与控制论专业博士学位。2017年10月至2018年8月在香港理工大学进行学术访问。2018年9月起在郑州大学数学与统计学院从事教学科研工作。 2018年9月至2021年12月在郑州大学信息与通信工程学科从事博士后研究工作。

主要项目

1.主持郑州大学基础研究培育基金面上项目，2023.9-2024.8,在研。

2.主持国家自然科学基金青年项目：工件可自由下线的平行批ND-双代理排序研究，2020.1-2022.12，已结题。

3.主持第65批中国博士后科学基金面上项目：工件可自由下线的无界平行批ND-双代理排序研究，2019.5-2021.1已结题。

奖励

1.论文《A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan》获2021年河南省教育厅优秀科技论文奖二等奖；

2.获2022年全省教育系统教学技能竞赛(大学理科)三等奖。

论文

[1] Rubing Chen, Yuan Gao, Zhichao Geng, Jinjiang Yuan, Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work, International Journal of Production Research, 2023, 61(22):7630-7648.

[2] Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng, Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost, 4OR-A Quarterly Journal of Operations Research, 2022, 20(2):273-287.

[3] Yuan Gao, Min–max scheduling of batch or drop-line jobs under agreeable release and processing times, Asia-pacific Journal of Operational Research, 2022, 39(2), 2150023, DOI:10.1142/S0217595921500238.

[4] Yuan Gao, Jinjiang Yuan, C.T. Ng, T.C.E. Cheng, A note on competing-agent Pareto-scheduling, Optimization Letters, 2021, 15:249-262.

[5] Yuan Gao, Jinjiang Yuan, C.T. Ng, T.C.E. Cheng, A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan, European Journal of Operational Research, 2019, 273:74-81.

[6] Yuan Gao, Jinjiang Yuan, Zhigang Wei, Unbounded parallel-batch scheduling with drop-line tasks, Journal of Scheduling 2019, 22:449-463.  

[7] Yuan Gao, Jinjiang Yuan, Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs, Journal of Combinatorial Optimization, 2019, 38:698-711.  

[8] Rubing Chen, Jinjiang Yuan, Yuan Gao, The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs, Journal of Scheduling, 2019, 22:581-593.

[9] Yuan Gao, Jinjiang Yuan, Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints, Discrete Optimization, 2017, 25:105-119.

[10] Yuan Gao, Jinjiang Yuan, Unary NP-hardness of minimizing total weighted tardiness with generalized due dates, Operations Research Letters, 2016, 44:92-95.

[11] Yuan Gao, Jinjiang Yuan, A note on Pareto minimizing total completion time and maximum cost, Operations Research Letters, 2015, 43:80-82.

[12] Yuan Gao, Jinjiang Yuan, Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates, Discrete Applied Mathematics, 2015, 189: 49-52.