default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRubing Chen
Person information
- affiliation: Zhengzhou University, Zhengzhou, Henan, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i1]Rubing Chen, Xulu Zhang, Jiaxin Wu, Wenqi Fan, Xiao-Yong Wei, Qing Li:
Multi-Level Querying using A Knowledge Pyramid. CoRR abs/2407.21276 (2024)- 2023
- [j11]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): 7630-7648 (2023) - 2022
- [j10]Rubing Chen, Ruyan He, Jinjiang Yuan:
Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs. Comput. Ind. Eng. 167: 107969 (2022) - [j9]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): 414-431 (2022) - 2021
- [j8]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: 107525 (2021) - [j7]Rubing Chen, Jinjiang Yuan:
Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines. Discret. Appl. Math. 304: 45-54 (2021) - [j6]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): 79-92 (2021) - 2020
- [j5]Rubing Chen, Jinjiang Yuan:
Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices. 4OR 18(2): 177-196 (2020) - [j4]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)
2010 – 2019
- 2019
- [j3]Rubing Chen, Jinjiang Yuan, Lingfa Lu:
Single-machine scheduling with positional due indices and positional deadlines. Discret. Optim. 34 (2019) - [j2]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): 581-593 (2019) - [j1]Rubing Chen, Jinjiang Yuan:
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines. J. Sched. 22(5): 595-601 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 20:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
