Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time. - Yong Chen 002; An Zhang 001; Zhiyi Tan 001 (FAW-AAIM, 2011)

Parallel machines scheduling with machine maintenance for minsum criteria. - Zhiyi Tan 001; Yong Chen 002; An Zhang 001 (Eur. J. Oper. Res., 2011)

Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance. - Longcheng Liu; Yong Chen 002; Biao Wu 004; Enyu Yao (FAW-AAIM, 2012)

Approximation algorithms for parallel open shop scheduling. - Yong Chen 002; An Zhang 001; Guangting Chen; Jianming Dong (Inf. Process. Lett., 2013)

Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time. - Yong Chen 002; An Zhang 001; Zhiyi Tan 001 (Inf. Sci., 2013)

A new three-machine shop scheduling: complexity and approximation algorithm. - Jianming Dong; Yong Chen 002; An Zhang 001; Qifan Yang (J. Comb. Optim., 2013)

Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination. - Jianming Dong; An Zhang 001; Yong Chen 002; Qifan Yang (Theor. Comput. Sci., 2013)

Approximation algorithms for the maximum weight internal spanning tree problem. - Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 001; Yong Chen 002 (CoRR, 2016)

Scheduling jobs with equal processing times and a single server on parallel identical machines. - An Zhang 001; Hongjun Wang; Yong Chen 002; Guangting Chen (Discret. Appl. Math., 2016)

Combinatorial Approximation Algorithms for Spectrum Assignment Problem in Chain and Ring Networks. - Guangting Chen; Lei Zhang; An Zhang 001; Yong Chen 002 (COCOA (1), 2017)

A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem. - Yao Xu; Yong Chen 002; Guohui Lin; Tian Liu 001; Taibo Luo; Peng Zhang 008 (ISAAC, 2017)

A local search 2.917-approximation algorithm for duo-preservation string mapping. - Yao Xu; Yong Chen 002; Taibo Luo; Guohui Lin (CoRR, 2017)

A (1.4 + ε)-approximation algorithm for the 2-{Max-Duo} problem. - Yao Xu; Yong Chen 002; Taibo Luo; Guohui Lin (CoRR, 2017)

Approximate the scheduling of quay cranes with non-crossing constraints. - An Zhang 001; Wenshuai Zhang; Yong Chen 002; Guangting Chen; Xufeng Chen (Eur. J. Oper. Res., 2017)

Better permutations for the single-processor scheduling with time restrictions. - An Zhang 001; Feilang Ye; Yong Chen 002; Guangting Chen (Optim. Lett., 2017)

Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop. - Longcheng Liu; Guanqun Ni; Yong Chen 002; Randy Goebel; Yue Luo; An Zhang 001; Guohui Lin (AAIM, 2018)

Open-Shop Scheduling for Unit Jobs Under Precedence Constraints. - An Zhang 001; Yong Chen 002; Randy Goebel; Guohui Lin (COCOA, 2018)

Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph. - Yinhui Cai; Guangting Chen; Yong Chen 002; Randy Goebel; Guohui Lin; Longcheng Liu; An Zhang 001 (COCOON, 2018)

Approximation algorithms for the three-machine proportionate mixed shop scheduling. - Longcheng Liu; Yong Chen 002; Jianming Dong; Randy Goebel; Guohui Lin; Yue Luo; Guanqun Ni; Bing Su 002; An Zhang 001 (CoRR, 2018)

On the NP-hardness of scheduling with time restrictions. - An Zhang 001; Yong Chen 002; Lin Chen 009; Guangting Chen (Discret. Optim., 2018)

A 21/16-Approximation for the Minimum 3-Path Partition Problem. - Yong Chen 002; Randy Goebel; Bing Su 002; Weitian Tong; Yao Xu; An Zhang 001 (ISAAC, 2019)

Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. - Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 001; Yong Chen 002; Dan Wang (Algorithmica, 2019)

An improved approximation algorithm for the minimum 3-path partition problem. - Yong Chen 002; Randy Goebel; Guohui Lin; Bing Su 002; Yao Xu; An Zhang 001 (J. Comb. Optim., 2019)

Improved Hardness and Approximation Results for Single Allocation Hub Location. - Xing Wang; Guangting Chen; Yong Chen 002; Guohui Lin; Yonghao Wang; An Zhang 001 (AAIM, 2020)

Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs. - An Zhang 001; Yong Chen 002; Zhi-Zhong Chen; Guohui Lin (Algorithmica, 2020)

A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. - Yong Chen 002; Guohui Lin; Tian Liu 001; Taibo Luo; Bing Su 002; Yao Xu; Peng Zhang 008 (J. Comb. Optim., 2020)

Open-shop scheduling for unit jobs under precedence constraints. - Yong Chen 002; Randy Goebel; Guohui Lin; Bing Su 002; An Zhang 001 (Theor. Comput. Sci., 2020)

Approximation algorithms for the three-machine proportionate mixed shop scheduling. - Longcheng Liu; Yong Chen 002; Jianming Dong; Randy Goebel; Guohui Lin; Yue Luo; Guanqun Ni; Bing Su 002; Yao Xu; An Zhang 001 (Theor. Comput. Sci., 2020)

Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints. - An Zhang 001; Liang Zhang; Yong Chen 002; Guangting Chen; Xing Wang (COCOA, 2021)

Approximation Algorithms for the Directed Path Partition Problems. - Yong Chen 002; Zhi-Zhong Chen; Curtis Kennedy; Guohui Lin; Yao Xu; An Zhang 001 (IJTCS-FAW, 2021)

Approximation Algorithms for Maximally Balanced Connected Graph Partition. - Yong Chen 002; Zhi-Zhong Chen; Guohui Lin; Yao Xu; An Zhang 001 (Algorithmica, 2021)

A randomized approximation algorithm for metric triangle packing. - Yong Chen 002; Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 001; An Zhang 001 (J. Comb. Optim., 2021)

A (32+ε)-approximation algorithm for scheduling on two parallel machines with job delivery coordination. - Yong Chen 002; An Zhang 001; Zhiyi Tan 001; Ying Xue; Guangting Chen (J. Oper. Res. Soc., 2021)

An improved algorithm for a two-stage production scheduling problem with an outsourcing option. - Xiaojuan Jiang; An Zhang 001; Yong Chen 002; Guangting Chen; Kangbok Lee (Theor. Comput. Sci., 2021)

Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. - Qiaojun Shu; Yong Chen 002; Shuguang Han; Guohui Lin; Eiji Miyano; An Zhang 001 (Theor. Comput. Sci., 2021)

Improved hardness and approximation results for single allocation hub location problems. - Xing Wang; Guangting Chen; Yong Chen 002; Guohui Lin; Yonghao Wang; An Zhang 001 (Theor. Comput. Sci., 2021)

Approximation algorithms for the maximally balanced connected graph tripartition problem. - Guangting Chen; Yong Chen 002; Zhi-Zhong Chen; Guohui Lin; Tian Liu 001; An Zhang 001 (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 002; Yinhui Cai; Longcheng Liu; Guangting Chen; Randy Goebel; Guohui Lin; Bing Su 002; An Zhang 001 (J. Comb. Optim., 2022)

A local search 4/3-approximation algorithm for the minimum 3-path partition problem. - Yong Chen 002; Randy Goebel; Guohui Lin; Longcheng Liu; Bing Su 002; Weitian Tong; Yao Xu; An Zhang 001 (J. Comb. Optim., 2022)

Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints. - An Zhang 001; Liang Zhang; Yong Chen 002; Guangting Chen; Xing Wang (Theor. Comput. Sci., 2023)

An improved algorithm for parallel machine scheduling under additional resource constraints. - An Zhang 001; Tan Zhen; Yong Chen 002; Guangting Chen (Optim. Lett., 2023)

Scheduling double-track gantry cranes to minimize the overall loading/ unloading time. - Jie Wang; Guangting Chen; Xinle Xuan; An Zhang 001; Yong Chen 002; Yuehuan Wang; Hecheng Zhang (Asia Pac. J. Oper. Res., 2023)

Competitive Algorithms for Online Traveling Salesman Problem on a Semi-line. - Qian Liu; An Zhang 001; Kai Wang; Yong Chen 002; Guangting Chen (COCOA (1), 2024)

On the Inapproximability of Two-machine Open Shop Scheduling with Exact Delays. - Shunzhang Lu; An Zhang 001; Mengyuan Hu; Yong Chen 002; Guangting Chen (COCOA (1), 2024)

Approximating the directed path partition problem. - Yong Chen 002; Zhi-Zhong Chen; Curtis Kennedy; Guohui Lin; Yao Xu; An Zhang 001 (Inf. Comput., 2024)

Approximation Algorithms for Non-sequential Star Packing Problems. - Mengyuan Hu; An Zhang 001; Yong Chen 002; Mingyang Gong; Guohui Lin (WALCOM, 2025)

On the pure fixed charge transportation problem. - Pengfei Zhu; Guangting Chen; Yong Chen 002; An Zhang 001 (Discret. Optim., 2025)

Approximation algorithms for the k+-star packing problem. - Zhihua Huang; An Zhang 001; Mingqi Gao 007; Jiayi Sun; Yong Chen 002 (Oper. Res. Lett., 2025)

Better approximating SONET k-edge partition for small capacity k. - Junhui Ye; Huihuang Jiang; Guangting Chen; Yong Chen 002; Guohui Lin; An Zhang 001 (J. Comb. Optim., 2025)