姓名：陈如冰

职务/职称：副研究员

研究领域：排序论

邮箱：chenrb@zzu.edu.cn

简要经历

2009.09-2013.07 郑州大学 数学与统计学院 学士

2013.09-2016.07 郑州大学 数学与统计学院 硕士

2016.09-2020.07 郑州大学 数学与统计学院 博士

2020.06-2022.06 郑州大学 信息与通讯工程流动站 博士后/助理研究员

2022.06-至今 郑州大学 数学与统计学院

主要项目

中国自然科学基金委青年基金项目，工件加工可中断假设下的双指标排序研究，主持，在研

中国博士后科学基金第74批面上项目，可中断环境下工件具有可分配工期的排序问题研究，主持，在研

奖励

河南省教育厅优秀科技论文奖一等奖（2023），第一作者

其他

SCI期刊《Journal of Scheduling》编委

中国运筹学会数学规划分会青年理事

论文

代表论文如下：

[1]Chen, R.B., Yuan, J.J., Zhao, Q.L., Ng, C.T., Cheng, T.C.E. (2023). Bicriterion Pareto-scheduling of equal-length jobs on a single machine related to the total weighted late work. Naval Research Logistics,70,537–557.

[2]Chen, R.B., Gao, Y., Geng, Z.C., Yuan, J.J. (2023). Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work. International Journal of Production Research,61, 7630-7648.

[3]Chen, R.B., Geng, Z.C., Lu, L.F., Yuan, J.J., Zhang, Y. (2022). Pareto-scheduling of two competing agents with their own equal processing times. European Journal of Operational Research,301, 414-431.

[4]Chen, R.B., He, R.Y., Yuan, J.J. (2022). Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs. Computers \& Industrial Engineering,167, 107969.

[5]Chen, R.B., Yuan, J.J. (2021). Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines. Discrete Applied Mathematics,304, 45-54.

[6]Chen, R.B., Yuan, J.J., Ng, C.T., Cheng, T.C.E. (2021). Bicriteria scheduling to minimize total late work and maximum tardiness with preemption. Computers \& Industrial Engineering, 159, 107525.

[7]Chen, R.B., Yuan, J.J., Ng, C.T.,Cheng, T.C.E. (2021). Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion. European Journal of Operational Research,293, 79-92.