Single-machine scheduling with positional due indices and positional deadlines. - Rubing Chen; Jinjiang Yuan; Lingfa Lu (Discret. Optim., 2019)

Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines. - Rubing Chen; Jinjiang Yuan (J. Sched., 2019)

The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs. - Rubing Chen; Jinjiang Yuan; Yuan Gao (J. Sched., 2019)

Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices. - Rubing Chen; Jinjiang Yuan (4OR, 2020)

ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost. - Rubing Chen; Jinjiang Yuan; Zhichao Geng (Appl. Math. Comput., 2020)

Bicriteria scheduling to minimize total late work and maximum tardiness with preemption. - Rubing Chen; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Comput. Ind. Eng., 2021)

Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines. - Rubing Chen; Jinjiang Yuan (Discret. Appl. Math., 2021)

Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion. - Rubing Chen; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Eur. J. Oper. Res., 2021)

Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs. - Rubing Chen; Ruyan He; Jinjiang Yuan (Comput. Ind. Eng., 2022)

Pareto-scheduling of two competing agents with their own equal processing times. - Rubing Chen; Zhichao Geng; Lingfa Lu; Jinjiang Yuan; Yuan Zhang (Eur. J. Oper. Res., 2022)

Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work. - Rubing Chen; Yuan Gao; Zhichao Geng; Jinjiang Yuan (Int. J. Prod. Res., 2023)

Multi-Level Querying using A Knowledge Pyramid. - Rubing Chen; Xulu Zhang; Jiaxin Wu 001; Wenqi Fan; Xiao-Yong Wei; Qing Li 001 (CoRR, 2024)

Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work. - Rubing Chen; Xinyu Dong; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Eur. J. Oper. Res., 2025)

MolGround: A Benchmark for Molecular Grounding. - Jiaxin Wu 001; Ting Zhang; Rubing Chen; Wengyu Zhang; Chen Jason Zhang; Xiaoyong Wei; Qing Li 001 (CoRR, 2025)

Probabilistic Optimality for Inference-time Scaling. - Youkang Wang; Jian Wang 054; Rubing Chen; Xiao-Yong Wei; Qing Li 001 (CoRR, 2025)

Rethinking Domain-Specific LLM Benchmark Construction: A Comprehensiveness-Compactness Approach. - Rubing Chen; Jiaxin Wu 001; Jian Wang; Xulu Zhang; Wenqi Fan; Chenghua Lin; Xiao-Yong Wei; Qing Li (CoRR, 2025)