default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRuyan Fu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j17]Ji Tian, Yan Zhou, Ruyan Fu:
An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown. J. Comb. Optim. 40(1): 170-180 (2020)
2010 – 2019
- 2017
- [j16]Ruyan Fu, Ji Tian, Shisheng Li, Jinjiang Yuan
:
An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities. J. Comb. Optim. 34(4): 1187-1197 (2017) - [j15]Qian Wang, Ji Tian, Ruyan Fu, Xiangjuan Yao:
Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs. Theor. Comput. Sci. 700: 37-44 (2017) - 2016
- [j14]Ji Tian, Qian Wang, Ruyan Fu, Jinjiang Yuan:
Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time. Theor. Comput. Sci. 617: 65-68 (2016) - 2014
- [j13]Ruyan Fu, Ji Tian, Jinjiang Yuan, Ya Li:
Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan. Inf. Process. Lett. 114(4): 179-184 (2014) - 2013
- [j12]Ruyan Fu, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan:
An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan. Oper. Res. Lett. 41(3): 216-219 (2013) - 2011
- [j11]Ji Tian, Ruyan Fu, Jinjiang Yuan:
An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times. Inf. Process. Lett. 111(21-22): 1048-1053 (2011) - [j10]Jinjiang Yuan, Ruyan Fu, C. T. Ng, T. C. Edwin Cheng:
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan. J. Sched. 14(4): 361-369 (2011) - 2010
- [j9]Lin Lin, Yixun Lin, Xianwei Zhou, Ruyan Fu:
Parallel Machine Scheduling with a Simultaneity Constraint and Unit-Length Jobs to minimize the makespan. Asia Pac. J. Oper. Res. 27(6): 669-676 (2010) - [j8]Ruyan Fu, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan. Inf. Process. Lett. 110(11): 444-450 (2010)
2000 – 2009
- 2009
- [j7]Jinjiang Yuan, Shisheng Li, Ji Tian, Ruyan Fu:
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times. J. Comb. Optim. 17(2): 206-213 (2009) - [j6]Ruyan Fu, Ji Tian, Jinjiang Yuan:
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs. J. Sched. 12(1): 91-97 (2009) - [j5]Ji Tian, Ruyan Fu, Jinjiang Yuan:
A best online algorithm for scheduling on two parallel batch machines. Theor. Comput. Sci. 410(21-23): 2291-2294 (2009) - 2008
- [j4]Ruyan Fu, Ji Tian, Jinjiang Yuan, Cheng He:
On-line scheduling on a batch machine to minimize makespan with limited restarts. Oper. Res. Lett. 36(2): 255-258 (2008) - [j3]Ji Tian, Ruyan Fu, Jinjiang Yuan:
A best on-line algorithm for single machine scheduling with small delivery times. Theor. Comput. Sci. 393(1-3): 287-293 (2008) - 2007
- [j2]Ji Tian, Ruyan Fu, Jinjiang Yuan:
On-line scheduling with delivery time on a single batch machine. Theor. Comput. Sci. 374(1-3): 49-57 (2007) - [j1]Ruyan Fu, Ji Tian, Jinjiang Yuan, Yixun Lin:
Online scheduling in a parallel batch processing system to minimize makespan using restarts. Theor. Comput. Sci. 374(1-3): 196-202 (2007)
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-04-24 23:11 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:
