Rubing Chen

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 12

Top Topics

Top Venues

Comput. Ind. Eng.

Eur. J. Oper. Res.

Discret. Optim.

Publications

Rubing Chen, Xulu Zhang, Jiaxin Wu, Wenqi Fan, Xiao-Yong Wei, Qing Li
Multi-Level Querying using A Knowledge Pyramid. CoRR (2024)
Rubing Chen, Yuan Gao, Zhichao Geng, Jinjiang Yuan
Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work. Int. J. Prod. Res. 61 (22) (2023)
Rubing Chen, Ruyan He, Jinjiang Yuan
Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs. Comput. Ind. Eng. 167 (2022)
Rubing Chen, Zhichao Geng, Lingfa Lu, Jinjiang Yuan, Yuan Zhang
Pareto-scheduling of two competing agents with their own equal processing times. Eur. J. Oper. Res. 301 (2) (2022)
Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion. Eur. J. Oper. Res. 293 (1) (2021)
Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
Bicriteria scheduling to minimize total late work and maximum tardiness with preemption. Comput. Ind. Eng. 159 (2021)
Rubing Chen, Jinjiang Yuan
Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines. Discret. Appl. Math. 304 (2021)
Rubing Chen, Jinjiang Yuan
Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices. 4OR 18 (2) (2020)
Rubing Chen, Jinjiang Yuan, Zhichao Geng
ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost. Appl. Math. Comput. 365 (2020)
Rubing Chen, Jinjiang Yuan, Yuan Gao
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs. J. Sched. 22 (5) (2019)
Rubing Chen, Jinjiang Yuan, Lingfa Lu
Single-machine scheduling with positional due indices and positional deadlines. Discret. Optim. 34 (2019)
Rubing Chen, Jinjiang Yuan
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines. J. Sched. 22 (5) (2019)