Publications

  • Li L., Li, H., and Zhao, H., “Minimizing the Number of Late Multi-Task Jobs on Identical Machines in Parallel”, Proceedings of 9th International Workshop on Computational Optimization, 587-594, Gdansk, Poland, September 11-14, 2016.
  • Huo, Y. and H. Zhao, “Minimizing Total Completion Time in Flow shop with Availability Constraints,” 9th International Workshop on Computational Optimization (WCO’16), Proceedings of the Federated Conference on Computer Science and Information Systems, 637-645, 2016.
  • Y. Huo and H. Zhao, “Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints,” The Seventh International Frontiers of Algorithmics Workshop and The Ninth International Conference on Algorithmic Aspects of Information and Management (FAW-AAIM 2013).
  • Y. Huo, B. Reznichenko and H. Zhao, “Minimizing Total Weighted Completion Time with Unexpected Machine Unavailability,” The 6rd Annual International Conference on Combinatorial Optimization and Applications (COCOA’12), Lecture Notes In Computer Science, Vol. 7402: 291-300, 2012.
  • B. Fu, Y. Huo and H. Zhao, “Approximation Schemes for Scheduling with Availability Constraints,” In the Proceedings of the Fourth International Frontiers of Algorithmics Workshop (FAW 2010), Lecture Notes in Computer Science, Lecture Notes in Computer Science, Vol. 6213: 77-88.
  • B. Fu, H. Huo and H. Zhao, “Coordinated Scheduling of Production and Delivery with Production Windows and Delivery Capacity Constraints,” The 6th International Conference on Algorithmic Aspects in Information and Management (AAIM’10), Lecture Notes In Computer Science, Vol. 6124: 141-149, 2010.
  • B. Fu, H. Huo and H. Zhao, “Makespan minimization with machine availability constraints”, The 3rd Annual International Conference on Combinatorial Optimization and Applications (COCOA’09), Lecture Notes in Computer Science, Vol. 5573: 430-437, 2009.
  • Y. Huo, H. Li and H. Zhao, “Minimizing Total Completion Time in Two-Machine Flow Shops With Exact Delays”, The 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA’08), Lecture Notes in Computer Science, Vol. 5165: 427-437, 2008.
  • H. Li and H. Zhao, Scheduling Coupled-Tasks on a Single Machine, Proceedings of IEEE Symposium on Computational Intelligence in Scheduling (CISched), pages 137-142, 2007.
  • A. Berger, A. CzumajM. Grigni and H. Zhao, Approximate Minimum 2-Connected Subgraphs in Weighted Planar Graphs, In Proceedings of the 13th Annual European Symposium on Algorithms (ESA’05),pages 472 – 483, Mallorca, Spain, October 3 – 6, 2005. Volume 3669 of Lecture Notes in Computer Science edited by G. S. Brodal and S. Leonardi, Springer-Verlag, 2005.
  • J. Y-T. Leung and H. Zhao, Scheduling Algorithms for Master-slave Systems, Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory & Applications (MISTA 2005), pages 501-513, 2005.
  • J. Y-T. Leung and H. Zhao, Minimizing Mean Flowtime on Master-Slave Machines, Proceedings of the 2004 International Conference on Parallel and Distributed Processing Techniques and Applications, Vol. II, pp. 939-945, Las Vegas, Nevada, 2004.
  • A. CzumajM. GrigniP. A. Sissokho, and H. Zhao, Approximation Schemes for Minimum 2-edge-connected and Biconnected Subgraphs in Planar Graphs, Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’04), New Orleans, LA, January 11 – 13, 2004. SIAM, Philadelphia, PA, 2004.
  • A. Czumaj and H. Zhao, Fault-Tolerant Geometric Spanners. Proceedings of the 19th ACM Symposium on Computational Geometry (SoCG’03), pages 1 – 10, San Diego, CA, June 8 – 10, 2003.
  • A. CzumajA. Lingas, and H. Zhao, Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP’02), pages 973-984, Malaga, Spain, July 8 – 13, 2002.
  • Scheduling of Continuous Slab Casters, INFORMS 2017, Houston, October 22-25 2017.
  • Polynomial Time Algorithms For Two Machines Bi-criteria Scheduling Subject to Arbitrary Machine Availability Constraints, INFORMS (Institute for Operations Research and the Management Sciences) International 2016, Hawaii, June 2016.
  • Minimizing Total Completion Time in a Two-Machine Flow shop Subject to Availability Constraints, PUC faculty research day, October 2015.
  • Minimizing Total Completion Time in Flow Shop with Machine Unavailability using Meta-heuristics, INFORMS Annual Meeting, Philadelphia, November 2015
  • Minimizing Total Completion Time in Flowshop with an Unavailable Interval on the First Machine, INFORMS Annual Meeting, San Francisco, November 2014.
  • Minimizing Total Completion Time in a Two-Machine Flow shop Subject to Availability Constraint, POMS (Production and Operations Management Society), Atlanta, May 2014.
  • 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