Yong Chen

According to our database, Yong Chen authored at least 41 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

An improved algorithm for parallel machine scheduling under additional resource constraints.

An Zhang, Tan Zhen, Yong Chen, Guangting Chen

Optim. Lett., April, 2023

Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints.

An Zhang, Liang Zhang, Yong Chen, Guangting Chen, Xing Wang

Theor. Comput. Sci., 2023

2022

A local search 4/3-approximation algorithm for the minimum 3-path partition problem.

Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang

J. Comb. Optim., 2022

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

Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang

J. Comb. Optim., 2022

Approximation algorithms for the maximally balanced connected graph tripartition problem.

Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin, Tian Liu, An Zhang

J. Comb. Optim., 2022

2021

Improved hardness and approximation results for single allocation hub location problems.

Xing Wang, Guangting Chen, Yong Chen, Guohui Lin, Yonghao Wang, An Zhang

Theor. Comput. Sci., 2021

Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles.

Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang

Theor. Comput. Sci., 2021

An improved algorithm for a two-stage production scheduling problem with an outsourcing option.

Xiaojuan Jiang, An Zhang, Yong Chen, Guangting Chen, Kangbok Lee

Theor. Comput. Sci., 2021

A (32+ε)-approximation algorithm for scheduling on two parallel machines with job delivery coordination.

Yong Chen, An Zhang, Zhiyi Tan, Ying Xue, Guangting Chen

J. Oper. Res. Soc., 2021

A randomized approximation algorithm for metric triangle packing.

Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang

J. Comb. Optim., 2021

Approximation Algorithms for Maximally Balanced Connected Graph Partition.

Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang

Algorithmica, 2021

Approximation Algorithms for the Directed Path Partition Problems.

Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang

Proceedings of the Frontiers of Algorithmics - International Joint Conference, 2021

Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints.

An Zhang, Liang Zhang, Yong Chen, Guangting Chen, Xing Wang

Proceedings of the Combinatorial Optimization and Applications, 2021

2020

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

Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, Yao Xu, An Zhang

Theor. Comput. Sci., 2020

Open-shop scheduling for unit jobs under precedence constraints.

Yong Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang

Theor. Comput. Sci., 2020

A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem.

Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang

J. Comb. Optim., 2020

Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs.

An Zhang, Yong Chen, Zhi-Zhong Chen, Guohui Lin

Algorithmica, 2020

Improved Hardness and Approximation Results for Single Allocation Hub Location.

Xing Wang, Guangting Chen, Yong Chen, Guohui Lin, Yonghao Wang, An Zhang

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

An improved approximation algorithm for the minimum 3-path partition problem.

Yong Chen, Randy Goebel, Guohui Lin, Bing Su, Yao Xu, An Zhang

J. Comb. Optim., 2019

Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem.

Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang

Algorithmica, 2019

A 21/16-Approximation for the Minimum 3-Path Partition Problem.

Yong Chen, Randy Goebel, Bing Su, Weitian Tong, Yao Xu, An Zhang

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

On the NP-hardness of scheduling with time restrictions.

An Zhang, Yong Chen, Lin Chen, Guangting Chen

Discret. Optim., 2018

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

Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, An Zhang

CoRR, 2018

Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph.

Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Open-Shop Scheduling for Unit Jobs Under Precedence Constraints.

An Zhang, Yong Chen, Randy Goebel, Guohui Lin

Proceedings of the Combinatorial Optimization and Applications, 2018

Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop.

Longcheng Liu, Guanqun Ni, Yong Chen, Randy Goebel, Yue Luo, An Zhang, Guohui Lin

Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017

Better permutations for the single-processor scheduling with time restrictions.

An Zhang, Feilang Ye, Yong Chen, Guangting Chen

Optim. Lett., 2017

Approximate the scheduling of quay cranes with non-crossing constraints.

An Zhang, Wenshuai Zhang, Yong Chen, Guangting Chen, Xufeng Chen

Eur. J. Oper. Res., 2017

A (1.4 + ε)-approximation algorithm for the 2-{Max-Duo} problem.

Yao Xu, Yong Chen, Taibo Luo, Guohui Lin

CoRR, 2017

A local search 2.917-approximation algorithm for duo-preservation string mapping.

Yao Xu, Yong Chen, Taibo Luo, Guohui Lin

CoRR, 2017

A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem.

Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Combinatorial Approximation Algorithms for Spectrum Assignment Problem in Chain and Ring Networks.

Guangting Chen, Lei Zhang, An Zhang, Yong Chen

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Scheduling jobs with equal processing times and a single server on parallel identical machines.

An Zhang, Hongjun Wang, Yong Chen, Guangting Chen

Discret. Appl. Math., 2016

Approximation algorithms for the maximum weight internal spanning tree problem.

Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen

CoRR, 2016

2013

Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination.

Jianming Dong, An Zhang, Yong Chen, Qifan Yang

Theor. Comput. Sci., 2013

A new three-machine shop scheduling: complexity and approximation algorithm.

Jianming Dong, Yong Chen, An Zhang, Qifan Yang

J. Comb. Optim., 2013

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

Yong Chen, An Zhang, Zhiyi Tan

Inf. Sci., 2013

Approximation algorithms for parallel open shop scheduling.

Yong Chen, An Zhang, Guangting Chen, Jianming Dong

Inf. Process. Lett., 2013

2012

Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance.

Longcheng Liu, Yong Chen, Biao Wu, Enyu Yao

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Parallel machines scheduling with machine maintenance for minsum criteria.

Zhiyi Tan, Yong Chen, An Zhang

Eur. J. Oper. Res., 2011

Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time.

Yong Chen, An Zhang, Zhiyi Tan

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011