Yong Chen
Affiliations:- Hangzhou Dianzi University, Department of Mathematics, China
- Zhejiang University, Department of Mathematics, Hangzhou, China (former)
According to our database1,
Yong Chen
authored at least 43 papers
between 2011 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
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
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
J. Comb. Optim., 2021
Algorithmica, 2021
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
Theor. Comput. Sci., 2020
Theor. Comput. Sci., 2020
J. Comb. Optim., 2020
Algorithmica, 2020
Proceedings of the Algorithmic Aspects in Information and Management, 2020
2019
J. Comb. Optim., 2019
Algorithmica, 2019
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019
2018
CoRR, 2018
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018
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
Optim. Lett., 2017
Eur. J. Oper. Res., 2017
CoRR, 2017
Proceedings of the 28th International Symposium on Algorithms and Computation, 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
CoRR, 2016
2013
Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination.
Theor. Comput. Sci., 2013
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
Inf. Process. Lett., 2013
2012
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012
2011
Eur. 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