default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHairong Zhao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Bin Fu, Yumei Huo, Hairong Zhao:
Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity. Theor. Comput. Sci. 961: 113937 (2023)- [i4]Bin Fu, Yumei Huo, Hairong Zhao:
Sublinear Approximation Schemes for Scheduling Precedence Graphs of Bounded Depth. CoRR abs/2302.00133 (2023) - 2022
- [j17]Bin Fu, Yumei Huo, Hairong Zhao:
Streaming algorithms for multitasking scheduling with shared processing. Discret. Appl. Math. 320: 346-355 (2022) - [i3]Bin Fu, Yumei Huo, Hairong Zhao:
Multitasking Scheduling with Shared Processing. CoRR abs/2204.01859 (2022) - [i2]Bin Fu, Yumei Huo, Hairong Zhao:
Streaming Algorithms for Multitasking Scheduling with Shared Processing. CoRR abs/2204.01970 (2022) - [i1]Bin Fu, Yumei Huo, Hairong Zhao:
Streaming Approximation Scheme for Minimizing Total Completion Time on Parallel Machines Subject to Varying Processing Capacity. CoRR abs/2204.01976 (2022)
2010 – 2019
- 2018
- [j16]Nicholas G. Hall, Yumei Huo, Benjamin Li, Michael L. Pinedo, Hairong Zhao:
In memoriam: Dr. Joseph Leung. J. Sched. 21(6): 579-580 (2018) - 2016
- [c16]Lingxiang Li, Haibing Li, Hairong Zhao:
Minimizing the Number of Late Multi-Task Jobs on Identical Machines in Parallel. FedCSIS 2016: 577-584 - [c15]Hairong Zhao, Yumei Huo:
Minimizing Total Completion Time in Flowshop with Availability Constraint on the First Machine. FedCSIS 2016: 627-635 - 2015
- [j15]Yumei Huo, Hairong Zhao:
Total completion time minimization on multiple machines subject to machine availability and makespan constraints. Eur. J. Oper. Res. 243(2): 547-554 (2015) - [c14]Duo Helen Wei, Shuihui Yang, Sen Zhang, Hairong Zhao:
Evaluation of an auto-generated data structures and algorithms visualization approach at tri-state colleges. CTS 2015: 183-189 - 2014
- [j14]Yumei Huo, Boris Reznichenko, Hairong Zhao:
Minimizing total weighted completion time with an unexpected machine unavailable interval. J. Sched. 17(2): 161-172 (2014) - 2013
- [c13]Yumei Huo, Hairong Zhao:
Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints. FAW-AAIM 2013: 325-338 - 2012
- [j13]Bin Fu, Yumei Huo, Hairong Zhao:
Coordinated scheduling of production and delivery with production window and delivery capacity constraints. Theor. Comput. Sci. 422: 39-51 (2012) - [c12]Hairong Zhao, Wuneng Zhou, Yan Gao:
Energy Efficient and Cluster Based Routing Protocol for WSN. CIS 2012: 107-111 - [c11]Yumei Huo, Boris Reznichenko, Hairong Zhao:
Minimizing Total Weighted Completion Time with Unexpected Machine Unavailability. COCOA 2012: 291-300 - 2011
- [j12]Bin Fu, Yumei Huo, Hairong Zhao:
Approximation schemes for parallel machine scheduling with availability constraints. Discret. Appl. Math. 159(15): 1555-1565 (2011) - [j11]Yumei Huo, Hairong Zhao:
Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints. Theor. Comput. Sci. 412(12-14): 1081-1091 (2011) - 2010
- [c10]Bin Fu, Yumei Huo, Hairong Zhao:
Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints. AAIM 2010: 141-149 - [c9]Bin Fu, Yumei Huo, Hairong Zhao:
Approximation Schemes for Scheduling with Availability Constraints. FAW 2010: 77-88
2000 – 2009
- 2009
- [j10]Yumei Huo, Haibing Li, Hairong Zhao:
Minimizing total completion time in two-machine flow shops with exact delays. Comput. Oper. Res. 36(6): 2018-2030 (2009) - [j9]Bin Fu, Yumei Huo, Hairong Zhao:
Makespan Minimization with Machine Availability Constraints. Discret. Math. Algorithms Appl. 1(2): 141-152 (2009) - [j8]Bin Fu, Yumei Huo, Hairong Zhao:
Exponential inapproximability and FPTAS for scheduling with availability constraints. Theor. Comput. Sci. 410(27-29): 2663-2674 (2009) - [c8]Bin Fu, Yumei Huo, Hairong Zhao:
Makespan Minimization with Machine Availability Constraints. COCOA 2009: 430-437 - 2008
- [j7]Joseph Y.-T. Leung, Hairong Zhao:
Scheduling problems in master-slave model. Ann. Oper. Res. 159(1): 215-231 (2008) - [c7]Yumei Huo, Haibing Li, Hairong Zhao:
Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays. COCOA 2008: 427-437 - 2007
- [j6]Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao:
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness. Eur. J. Oper. Res. 177(1): 116-134 (2007) - [j5]Joseph Y.-T. Leung, Haibing Li, Hairong Zhao:
Scheduling Two-Machine Flow shops with Exact Delays. Int. J. Found. Comput. Sci. 18(2): 341-359 (2007) - [j4]Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao:
Complexity of two dual criteria scheduling problems. Oper. Res. Lett. 35(2): 211-220 (2007) - [c6]Haibing Li, Hairong Zhao:
Scheduling Coupled-Tasks on a Single Machine. CISched 2007: 137-142 - 2006
- [j3]Joseph Y.-T. Leung, Hairong Zhao:
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems. IEEE Trans. Computers 55(8): 985-999 (2006) - 2005
- [j2]Joseph Y.-T. Leung, Hairong Zhao:
Minimizing mean flowtime and makespan on master-slave systems. J. Parallel Distributed Comput. 65(7): 843-856 (2005) - [c5]André Berger
, Artur Czumaj, Michelangelo Grigni, Hairong Zhao:
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. ESA 2005: 472-483 - 2004
- [j1]Artur Czumaj, Hairong Zhao:
Fault-Tolerant Geometric Spanners. Discret. Comput. Geom. 32(2): 207-230 (2004) - [c4]Joseph Y.-T. Leung, Hairong Zhao:
Minimizing Mean Flowtime on Master-Slave Machines. PDPTA 2004: 939-945 - [c3]Artur Czumaj, Michelangelo Grigni, Papa A. Sissokho, Hairong Zhao:
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. SODA 2004: 496-505 - 2003
- [c2]Artur Czumaj, Hairong Zhao:
Fault-tolerant geometric spanners. SCG 2003: 1-10 - 2002
- [c1]Artur Czumaj, Andrzej Lingas, Hairong Zhao:
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. ICALP 2002: 973-984
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:19 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:
