default search action
Yong He 0014
Person information
- affiliation: Zhejiang University, Department of Mathematics, State Key Lab of CAD & CG, Hangzhou, China
Other persons with the same name
- Yong He — disambiguation page
- Yong He 0001
— Zhejiang University, College of Biosystems Engineering and Food Science, Hangzhou, China
- Yong He 0002
- Yong He 0003
- Yong He 0004
- Yong He 0005
- Yong He 0006
- Yong He 0007 — Sichuan Research Institute for Ecosystem Restoration & Geohazard Prevention, Chengdu, China
- Yong He 0008
- Yong He 0009
- Yong He 0010
- Yong He 0011
- Yong He 0012
- Yong He 0013 — Carnegie Mellon University, Pittsburgh, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j23]C. T. Ng
Two semi-online scheduling problems on two uniform machines. Theor. Comput. Sci. 410(8-10): 776-792 (2009) - 2007
- [j22]Yiwei Jiang, Yong He:
Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information. Acta Informatica 44(7-8): 571-590 (2007) - [j21]Yong He, Shuguang Han, Yiwei Jiang:
Online Algorithms for Scheduling with Machine Activation Cost. Asia Pac. J. Oper. Res. 24(2): 263-277 (2007) - [j20]Min Ji
Single-machine scheduling with periodic maintenance to minimize makespan. Comput. Oper. Res. 34(6): 1764-1770 (2007) - [j19]Min Ji
A simple linear time algorithm for scheduling with step-improving processing times. Comput. Oper. Res. 34(8): 2396-2402 (2007) - [j18]Min Ji
Batch delivery scheduling with batch delivery cost on a single machine. Eur. J. Oper. Res. 176(2): 745-755 (2007) - [j17]Yong He, Qi Wei, T. C. E. Cheng:
Single-machine scheduling with trade-off between number of tardy jobs and compression cost. J. Sched. 10(4-5): 303-310 (2007) - [j16]Zhiyi Tan
Semi-online scheduling problems on two identical machines with inexact partial information. Theor. Comput. Sci. 377(1-3): 110-125 (2007) - 2006
- [j15]Yiwei Jiang, Yong He:
Optimal Preemptive Semi-Online Algorithm for Scheduling Tightly-Grouped Jobs on Two Uniform Machines. Asia Pac. J. Oper. Res. 23(1): 77-88 (2006) - [j14]Yiwei Jiang, Yong He:
Semi-Online Algorithms for Scheduling with Machine Cost. J. Comput. Sci. Technol. 21(6): 984-988 (2006) - [j13]T. C. Edwin Cheng
Scheduling with step-improving processing times. Oper. Res. Lett. 34(1): 37-40 (2006) - [j12]Min Ji
Scheduling linear deteriorating jobs with an availability constraint on a single machine. Theor. Comput. Sci. 362(1-3): 115-126 (2006) - 2005
- [j11]Yiwei Jiang, Yong He:
Preemptive online algorithms for scheduling with machine cost. Acta Informatica 41(6): 315-340 (2005) - [j10]Zhiyi Tan
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data. Inf. Comput. 196(1): 57-70 (2005) - [j9]Yiwei Jiang, Zhiyi Tan
Preemptive Machine Covering on Parallel Machines. J. Comb. Optim. 10(4): 345-363 (2005) - [j8]Yong He, Yiwei Jiang:
Optimal semi-online preemptive algorithms for machine covering on two uniform machines. Theor. Comput. Sci. 339(2-3): 293-314 (2005) - [c4]Zhiyi Tan
Linear Time Algorithms for Parallel Machine Scheduling. AAIM 2005: 172-182 - [c3]Zhiyi Tan
Semi-online Problems on Identical Machines with Inexact Partial Information. COCOON 2005: 297-307 - [c2]Yong He, Yiwei Jiang:
Preemptive Semi-online Scheduling on Parallel Machines with Inexact Partial Information. ISAAC 2005: 422-432 - 2004
- [j7]Yong He, Yiwei Jiang:
Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines. Acta Informatica 40(5): 367-383 (2004) - [j6]Zhiyi Tan
Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system. Sci. China Ser. F Inf. Sci. 47(2): 161-169 (2004) - [j5]Yong He, Yiwei Jiang:
Preemptive Semi-Online Scheduling with Tightly-Grouped Processing Times. J. Comput. Sci. Technol. 19(6): 733-739 (2004) - 2002
- [j4]Zhiyi Tan
Optimal online algorithm for scheduling on two identical machines with machine availability constraints. Inf. Process. Lett. 83(6): 323-329 (2002) - [j3]Yong He, Zhiyi Tan
Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time. J. Comb. Optim. 6(2): 199-206 (2002) - [j2]Zhiyi Tan
Semi-on-line problems on two identical machines with combined partial information. Oper. Res. Lett. 30(6): 408-414 (2002) - 2001
- [j1]Zhiyi Tan
Semi-on-line scheduling with ordinal data on two uniform machines. Oper. Res. Lett. 28(5): 221-231 (2001) - 2000
- [c1]Zhiyi Tan
Ordinal On-Line Scheduling on Two Uniform Machines. COCOON 2000: 232-241
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-12-23 20:29 CET 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: