☰

Hairong Zhao, Ph.D.

Affiliations: 
2005 New Jersey Institute of Technology, Newark, NJ, United States 
Area:
Computer Science
Google:
"Hairong Zhao"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor
Artur Czumaj grad student 2005 NJIT
 (Algorithms and complexity analyses for some combinatorial optimization problems.)

Children

Sign in to add trainee

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Huo Y, Zhao H. (2018) Two machine scheduling subject to arbitrary machine availability constraint Omega-International Journal of Management Science. 76: 128-136
Huo Y, Zhao H. (2015) Total completion time minimization on multiple machines subject to machine availability and makespan constraints European Journal of Operational Research. 243: 547-554
Huo Y, Reznichenko B, Zhao H. (2014) Minimizing total weighted completion time with an unexpected machine unavailable interval Journal of Scheduling. 17: 161-172
Fu B, Huo Y, Zhao H. (2012) Coordinated scheduling of production and delivery with production window and delivery capacity constraints Theoretical Computer Science. 422: 39-51
Huo Y, Zhao H. (2011) Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints Theoretical Computer Science. 412: 1081-1091
Fu B, Huo Y, Zhao H. (2011) Approximation schemes for parallel machine scheduling with availability constraints Discrete Applied Mathematics. 159: 1555-1565
Fu B, Huo Y, Zhao H. (2010) Approximation schemes for scheduling with availability constraints Lecture Notes in Computer Science. 6213: 77-88
Fu B, Huo Y, Zhao H. (2009) Makespan Minimization With Machine Availability Constraints Discrete Mathematics, Algorithms and Applications. 1: 141-151
Fu B, Huo Y, Zhao H. (2009) Exponential inapproximability and FPTAS for scheduling with availability constraints Theoretical Computer Science. 410: 2663-2674
Huo Y, Li H, Zhao H. (2009) Minimizing total completion time in two-machine flow shops with exact delays Computers & Operations Research. 36: 2018-2030
See more...