Rubing Chen
Affiliations:- Zhengzhou University, Zhengzhou, Henan, China
According to our database1,
Rubing Chen
authored at least 11 papers
between 2019 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work.
Int. J. Prod. Res., November, 2023
2022
Eur. J. Oper. Res., 2022
Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs.
Comput. Ind. Eng., 2022
2021
Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion.
Eur. J. Oper. Res., 2021
Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines.
Discret. Appl. Math., 2021
Bicriteria scheduling to minimize total late work and maximum tardiness with preemption.
Comput. Ind. Eng., 2021
2020
ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost.
Appl. Math. Comput., 2020
Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices.
4OR, 2020
2019
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs.
J. Sched., 2019
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines.
J. Sched., 2019
Discret. Optim., 2019