An Zhang

Orcid: 0000-0002-2622-5158

Affiliations:
  • Hangzhou Dianzi University, Hangzhou, China


According to our database1, An Zhang authored at least 49 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Approximating the directed path partition problem.
Inf. Comput., 2024

2023
Scheduling double-track gantry cranes to minimize the overall loading/ unloading time.
Asia Pac. J. Oper. Res., October, 2023

An improved algorithm for parallel machine scheduling under additional resource constraints.
Optim. Lett., April, 2023

Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints.
Theor. Comput. Sci., 2023

2022
A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling.
J. Comb. Optim., 2022

A local search 4/3-approximation algorithm for the minimum 3-path partition problem.
J. Comb. Optim., 2022

Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph.
J. Comb. Optim., 2022

Approximation algorithms for the maximally balanced connected graph tripartition problem.
J. Comb. Optim., 2022

2021
Improved hardness and approximation results for single allocation hub location problems.
Theor. Comput. Sci., 2021

Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles.
Theor. Comput. Sci., 2021

An improved algorithm for a two-stage production scheduling problem with an outsourcing option.
Theor. Comput. Sci., 2021

A (32+ε)-approximation algorithm for scheduling on two parallel machines with job delivery coordination.
J. Oper. Res. Soc., 2021

A randomized approximation algorithm for metric triangle packing.
J. Comb. Optim., 2021

Approximation Algorithms for Maximally Balanced Connected Graph Partition.
Algorithmica, 2021

Approximation Algorithms for the Directed Path Partition Problems.
Proceedings of the Frontiers of Algorithmics - International Joint Conference, 2021

Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Approximation algorithms for the three-machine proportionate mixed shop scheduling.
Theor. Comput. Sci., 2020

Open-shop scheduling for unit jobs under precedence constraints.
Theor. Comput. Sci., 2020

Machine scheduling with soft precedence constraints.
Eur. J. Oper. Res., 2020

Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs.
Algorithmica, 2020

Improved Hardness and Approximation Results for Single Allocation Hub Location.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
An improved approximation algorithm for the minimum 3-path partition problem.
J. Comb. Optim., 2019

A 21/16-Approximation for the Minimum 3-Path Partition Problem.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018
On the NP-hardness of scheduling with time restrictions.
Discret. Optim., 2018

Approximation algorithms for the three-machine proportionate mixed shop scheduling.
CoRR, 2018

Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Open-Shop Scheduling for Unit Jobs Under Precedence Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2018

Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop.
Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017
Better permutations for the single-processor scheduling with time restrictions.
Optim. Lett., 2017

Total completion time minimization in online hierarchical scheduling of unit-size jobs.
J. Comb. Optim., 2017

Approximate the scheduling of quay cranes with non-crossing constraints.
Eur. J. Oper. Res., 2017

Combinatorial Approximation Algorithms for Spectrum Assignment Problem in Chain and Ring Networks.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Scheduling jobs with equal processing times and a single server on parallel identical machines.
Discret. Appl. Math., 2016

2015
On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints.
Oper. Res. Lett., 2015

Optimal online algorithms on two hierarchical machines with tightly-grouped processing times.
J. Comb. Optim., 2015

An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop.
Inf. Process. Lett., 2015

2013
Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination.
Theor. Comput. Sci., 2013

A new three-machine shop scheduling: complexity and approximation algorithm.
J. Comb. Optim., 2013

Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time.
Inf. Sci., 2013

Approximation algorithms for parallel open shop scheduling.
Inf. Process. Lett., 2013

2012
Optimal Online Algorithms on Two Hierarchical Machines with Resource Augmentation.
Discret. Math. Algorithms Appl., 2012

2011
Online hierarchical scheduling: An approach using mathematical programming.
Theor. Comput. Sci., 2011

Parallel machines scheduling with machine maintenance for minsum criteria.
Eur. J. Oper. Res., 2011

Online and Semi-Online Scheduling on capacitated Two-Parallel Machines.
Asia Pac. J. Oper. Res., 2011

Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
A note on hierarchical scheduling on two uniform machines.
J. Comb. Optim., 2010

2009
Online parallel machines scheduling with two hierarchies.
Theor. Comput. Sci., 2009

A Mathematical Programming Approach for Online Hierarchical Scheduling.
Proceedings of the Combinatorial Optimization and Applications, 2009

2008
Online coupon consumption problem.
J. Comb. Optim., 2008


  Loading...