Welcome to My Home Page

Hairong Zhao
Department of Mathematics, Computer Science & Statistics
Purdue University Calumet
2200 169th Street, Hammond, IN 46323
E-mail: hairong@purduecal.edu
Office: CLO 366 Phone: 219-989-3181


Teaching Research Interest Publications Education Links



Spring 2015: Please access the courses via Blackboard Learn
CS 33200: Algorithms TR 9:30am- 10:50am CLO351
CS 12300 (online) Programing I: Java
CS 30900: Discrete Math TR 3:30pm-4:50pm, CLO137
Courses I taught before

Research Interest

Design and Analysis of Algorithms, Approximation Algorithms, Sequencing and Scheduling, Combinatorial Optimization, Computational Complexity, Computational Geometry, Real-time Scheduling, Operating Systems.

Back to Top



Journal Papers

Conference Papers

Invited Talks, presentations

  • "Approximation Schemes for Parallel Machine Scheduling with Availability Constraints," POMS2012
  • "Bicriteria Scheduling Concerned with Makespan and Total Completion Time Subject to Machine Availability Constraints," POMS2012.
  • "Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints," INFORMS 2011
  • Makespan Minimization with Machine Availability Constraints, COCOA, Huangshan, China, June, 2009.
  • Minimizing Total Completion Time in Two-Machine Flowshops with Exact Delays, INFORMS Annual Meeting, Washington DC, Nov. 2008.
  • Minimizing Total Completion Time in Two-Machine Flowshops with Exact Delays, Aug. COCOA, New Foundland, CA, 2008.
  • Minimizing Makespan in Two-Machine Flowshops with Exact Delays, INFORMS Annual Meeting, Nov. 2006.
  • Scheduling Algorithms for Master-slave Systems, MISTA, Aug. 2005.
  • Minimizing Total Completion Time in Master-slave Scheduling Systems, Graduate Student Seminar, New Jersey Institute of Technology, Nov. 2004.
  • Minimizing Mean Flowtime and Makespan on Master-Slave Systems, INFORMS Annual Meeting, Oct. 2004.
  • Fault tolerant Spanners and Their Applications, DIMACS/CS Seminar: Theoretical Computer Science.
  • Approximation Schemes for Minimum 2-Edge-Connected and Biconnected Subgraphs in Planar Graphs, the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 2004.
  • Complexity and Heuristics of Some Master-slave Scheduling Problems, Graduate Student Seminar, New Jersey Institute of Technology, Dec. 2003.
  • Fault-Tolerant Geometric Spanners, DIMACS Workshop on Computational Geometry, Nov. 2002


Algorithms and Complexity Analyses for Some Combinatorial Optimization Problems.

Technical Reports

J.Y-T. Leung, and H. Zhao, Real-Time Scheduling Analysis. Technical Report NJIT/WOW 01/C/AW/NJIT Amendment 1, October, 2003.

Back to Top



09/2000--05/2005 Department of Computer Science, New Jersey Institute of Technology, U.S., Ph.D. of Computer Science

09/1994--04/1997 National Key Lab of Switching Technology and Telecommunication Network, Beijing University of Posts and Telecommunications(BUPT), Beijing, P.R.China, Master of Engineering

09/1990--07/1994 Department of Computer Science and Engineering, Taiyuan University of Technology, P.R.China, Bachelor of Computer Engineering

Back to Top  tree

Some Useful Links

Interesting things about China
bullet China's Scenery Pictures
bullet Chinese History
bullet Learning Chinese
Back to Top


Comments and Suggestions

 mailPlease send me mail if you have any comments and suggestions.

Back to Top