Yuzhong Zhang

According to our database1, Yuzhong Zhang authored at least 31 papers between 1999 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Improved price of anarchy for machine scheduling games with coordination mechanisms.
Optimization Letters, 2019

Two-stage medical supply chain scheduling with an assignable common due window and shelf life.
J. Comb. Optim., 2019

An implicit degree condition for k-connected 2-heavy graphs to be hamiltonian.
Inf. Process. Lett., 2018

A linear-time algorithm for clique-coloring problem in circular-arc graphs.
J. Comb. Optim., 2017

The Supplying Chain Scheduling with Outsourcing and Transportation.
APJOR, 2017

Inefficiency analysis of the scheduling game on limited identical machines with activation costs.
Inf. Process. Lett., 2016

Fan-type implicit-heavy subgraphs for hamiltonicity of implicit claw-heavy graphs.
Inf. Process. Lett., 2016

Forbidden subgraph conditions for Hamilton cycles in implicit claw-heavy graphs.
Ars Comb., 2016

Scheduling games on uniform machines with activation cost.
Theor. Comput. Sci., 2015

Online Surface Temperature Measurement of Billets in Secondary Cooling Zone End-Piece Based on Data Fusion.
IEEE Trans. Instrumentation and Measurement, 2014

Two types of bounded traveling-wave solutions of a two-component Camassa-Holm equation.
Applied Mathematics and Computation, 2013

Scheduling of deteriorating jobs with release dates to minimize the maximum lateness.
Theor. Comput. Sci., 2012

The Strategy of the Operational Risk Management: Connotations of it in Commercial Banks of China.
Proceedings of the Fifth International Conference on Business Intelligence and Financial Engineering, 2012

Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs.
Inf. Process. Lett., 2011

Motion Intention Analysis-Based Coordinated Control for Amputee-Prosthesis Interaction.
J. Robotics, 2010

Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

The NP-Hardness of Minimizing the Total Late Work on an Unbounded Batch Machine.
APJOR, 2009

Scheduling with Rejection to Minimize the Makespan.
Proceedings of the Combinatorial Optimization and Applications, 2009

Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine.
Proceedings of the Combinatorial Optimization and Applications, 2009

On-Line Scheduling of Unit Time Jobs with Rejection on Uniform Machines.
J. Systems Science & Complexity, 2008

An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan.
J. Comb. Optim., 2008

Approximation Schemes for Scheduling a Batching Machine with Nonidentical Job Size.
J. Systems Science & Complexity, 2007

Scheduling with Rejection and Non-Identical Job Arrivals.
J. Systems Science & Complexity, 2007

An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan.
Proceedings of the Combinatorial Optimization and Applications, 2007

On-Line Scheduling with Rejection on Identical Parallel Machines.
J. Systems Science & Complexity, 2006

On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times.
Proceedings of the Theory and Applications of Models of Computation, 2006

A PTAS for Scheduling on Agreeable Unrelated Parallel Batch Processing Machines with Dynamic Job Arrivals.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

Minimizing Mean Completion Time in a Batch Processing System.
Algorithmica, 2004

Approximation Algorithms in Batch Processing.
J. Comb. Optim., 2003

Approximation Algorithms in Batch Processing.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Minimizing Mean Response Time in Batch Processing System.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999