We stand with Ukraine  

Rubing Chen

Affiliations:
  • Zhengzhou University, Zhengzhou, Henan, China


According to our database1, Rubing Chen authored at least 12 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Multi-Level Querying using A Knowledge Pyramid.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Rubing Chen
,
Jinjiang Yuan
Discret. Appl. Math., 2021

Bicriteria scheduling to minimize total late work and maximum tardiness with preemption.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Rubing Chen
,
Jinjiang Yuan
,
Zhichao Geng
Appl. Math. Comput., 2020

Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Rubing Chen
,
Jinjiang Yuan
,
Yuan Gao
J. Sched., 2019

Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines.
[BibTeX]
[DOI]
Rubing Chen
,
Jinjiang Yuan
J. Sched., 2019

Single-machine scheduling with positional due indices and positional deadlines.
[BibTeX]
[DOI]
Rubing Chen
,
Jinjiang Yuan
,
Lingfa Lu
Discret. Optim., 2019


  Loading...