姓名：陈如冰

职务/职称：研究员

研究领域：排序论

邮箱：chenrb@zzu.edu.cn

简要经历

2009.09-2013.07 郑州大学 数学与应用数学 学士

2013.09-2016.07 郑州大学 运筹学与控制论 硕士

2016.09-2020.07 郑州大学 运筹学与控制论 博士

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

主要项目

主持国家自然科学基金委面上项目1项，国家自然科学基金委青年基金项目1项，中国博士后科学基金面上项目1项

其他

SCI期刊《Journal of Scheduling》编委

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

中国运筹学会排序分会青年理事

代表论文

[1] Chen, R.B., Li, S.S., Yuan, J.J., Zhao, Q.L., (2026) .  Competing multi-agent scheduling of equal-length jobs on a single machine or uniform parallel machines. European Journal of Operational Research, 333, 701-712.

[2] Chen, R.B., Dong, X.Y., Cheng, T.C.E., Ng, C.T. (2025). Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work. European Journal of Operational Research, 322, 467-479.

[3] Chen, R.B., Cheng T.C.E., Ng C.T., Wang, J.Q., Wei, H.J., Yuan,J.J. (2024). Rescheduling to trade off between global disruption of original jobs with flexibility and scheduling cost of new jobs. Omega,128, 103114.

[4] 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.

[5] 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.

[6] 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.

[7] 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.

[8] 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.

[9] 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.

[10] 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.