Rubing Chen

According to our database, Rubing Chen authored at least 25 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

A bi-agent single-processor scheduling to minimize the sum of maximum lateness with release dates.

Danyu Bai, Ying Li, Hanyu Xue, Jie Yang, Rubing Chen, Chin-Chia Wu, Hu Qin

J. Oper. Res. Soc., April, 2026

MarkovScale: Towards Optimal Sequential Scaling at Inference Time.

Youkang Wang, Jian Wang, Rubing Chen, Tianyi Zeng, Xiao-Yong Wei, Qing Li

CoRR, February, 2026

To Retrieve or To Think? An Agentic Approach for Context Evolution.

Rubing Chen, Jian Wang, Wenjie Li, Xiao-Yong Wei, Qing Li

CoRR, January, 2026

Competing multi-agent scheduling of equal-length jobs on a single machine or uniform parallel machines.

Rubing Chen, Shi-Sheng Li, Jinjiang Yuan, Qiulan Zhao

Eur. J. Oper. Res., 2026

OptScale: Probabilistic Optimality for Inference-time Scaling.

Youkang Wang, Jian Wang, Rubing Chen, Xiao-Yong Wei

Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025

OptPO: Optimal Rollout Allocation for Test-time Policy Optimization.

Youkang Wang, Jian Wang, Rubing Chen, Tianyi Zeng, Xiao-Yong Wei, Qing Li

CoRR, December, 2025

Bicriterion parallel-machine scheduling of equal-length jobs to minimize total tardiness and number of tardy jobs.

Jing Zhang, Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng

J. Comb. Optim., October, 2025

Rethinking Domain-Specific LLM Benchmark Construction: A Comprehensiveness-Compactness Approach.

Rubing Chen, Jiaxin Wu, Jian Wang, Xulu Zhang, Wenqi Fan, Chenghua Lin, Xiao-Yong Wei, Qing Li

CoRR, August, 2025

Probabilistic Optimality for Inference-time Scaling.

Youkang Wang, Jian Wang, Rubing Chen, Xiao-Yong Wei, Qing Li

CoRR, June, 2025

MolGround: A Benchmark for Molecular Grounding.

Jiaxin Wu, Ting Zhang, Rubing Chen, Wengyu Zhang, Chen Jason Zhang, Xiaoyong Wei, Qing Li

CoRR, March, 2025

Cross-Lingual Keyword Extraction for Pesticide Terminology in Brazilian Portuguese and English.

José Victor De Souza, Hazem Amamou, Rubing Chen, Elmira Salari, Reto Gubelmann, Christina Niklaus, Talita Serpa, Marcela Marques de Freitas Lima, Paula Tavares Pinto, Shruti Rajendra Kshirsagar, Alan Davoust, Siegfried Handschuh, Anderson Raymundo Avila

J. Braz. Comput. Soc., 2025

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, T. C. E. Cheng

Eur. J. Oper. Res., 2025

Benchmarking for Domain-Specific LLMs: A Case Study on Academia and Beyond.

Rubing Chen, Jiaxin Wu, Jian Wang, Xulu Zhang, Wenqi Fan, Chenghua Lin, Xiaoyong Wei, Li Qing

Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2025, 2025

2024

Multi-Level Querying using A Knowledge Pyramid.

Rubing Chen, Xulu Zhang, Jiaxin Wu, Wenqi Fan, Xiao-Yong Wei, Qing Li

CoRR, 2024

2023

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., November, 2023

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

Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs.

Rubing Chen, Ruyan He, Jinjiang Yuan

Comput. Ind. Eng., 2022

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, T. C. E. Cheng

Eur. J. Oper. Res., 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

Bicriteria scheduling to minimize total late work and maximum tardiness with preemption.

Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng

Comput. Ind. Eng., 2021

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

Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices.

Rubing Chen, Jinjiang Yuan

4OR, 2020

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

Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines.

Rubing Chen, Jinjiang Yuan

J. Sched., 2019

Single-machine scheduling with positional due indices and positional deadlines.

Rubing Chen, Jinjiang Yuan, Lingfa Lu

Discret. Optim., 2019