Hairong Zhao

According to our database1, Hairong Zhao authored at least 32 papers between 2002 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity.
Theor. Comput. Sci., June, 2023

Sublinear Approximation Schemes for Scheduling Precedence Graphs of Bounded Depth.
CoRR, 2023

2022
Streaming algorithms for multitasking scheduling with shared processing.
Discret. Appl. Math., 2022

Multitasking Scheduling with Shared Processing.
CoRR, 2022

2018
In memoriam: Dr. Joseph Leung.
J. Sched., 2018

2016
Minimizing Total Completion Time in Flowshop with Availability Constraint on the First Machine.
Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

Minimizing the Number of Late Multi-Task Jobs on Identical Machines in Parallel.
Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

2015
Total completion time minimization on multiple machines subject to machine availability and makespan constraints.
Eur. J. Oper. Res., 2015

Evaluation of an auto-generated data structures and algorithms visualization approach at tri-state colleges.
Proceedings of the 2015 International Conference on Collaboration Technologies and Systems, 2015

2014
Minimizing total weighted completion time with an unexpected machine unavailable interval.
J. Sched., 2014

2013
Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
Coordinated scheduling of production and delivery with production window and delivery capacity constraints.
Theor. Comput. Sci., 2012

Minimizing Total Weighted Completion Time with Unexpected Machine Unavailability.
Proceedings of the Combinatorial Optimization and Applications, 2012

Energy Efficient and Cluster Based Routing Protocol for WSN.
Proceedings of the Eighth International Conference on Computational Intelligence and Security, 2012

2011
Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints.
Theor. Comput. Sci., 2011

Approximation schemes for parallel machine scheduling with availability constraints.
Discret. Appl. Math., 2011

2010
Approximation Schemes for Scheduling with Availability Constraints.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

2009
Exponential inapproximability and FPTAS for scheduling with availability constraints.
Theor. Comput. Sci., 2009

Makespan Minimization with Machine Availability Constraints.
Discret. Math. Algorithms Appl., 2009

Minimizing total completion time in two-machine flow shops with exact delays.
Comput. Oper. Res., 2009

2008
Scheduling problems in master-slave model.
Ann. Oper. Res., 2008

2007
Complexity of two dual criteria scheduling problems.
Oper. Res. Lett., 2007

Scheduling Two-Machine Flow shops with Exact Delays.
Int. J. Found. Comput. Sci., 2007

Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness.
Eur. J. Oper. Res., 2007

Scheduling Coupled-Tasks on a Single Machine.
Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

2006
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems.
IEEE Trans. Computers, 2006

2005
Minimizing mean flowtime and makespan on master-slave systems.
J. Parallel Distributed Comput., 2005

Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs.
Proceedings of the Algorithms, 2005

2004
Fault-Tolerant Geometric Spanners.
Discret. Comput. Geom., 2004

Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Minimizing Mean Flowtime on Master-Slave Machines.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

2002
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002


  Loading...