Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Yong Chen - MaRDI portal

Yong Chen

From MaRDI portal
(Redirected from Person:421520)
Person:313817

Available identifiers

zbMath Open chen.yong.3MaRDI QIDQ313817

List of research outcomes





PublicationDate of PublicationType
Asynchronous control for nonlinear switched stochastic delayed systems with weighted mode-dependent average dwell time2024-12-03Paper
Scheduling double-track gantry cranes to minimize the overall loading/unloading time2024-05-23Paper
Approximating the directed path partition problem2024-03-27Paper
Approximation algorithms and a hardness result for the three-machine proportionate mixed shop2023-10-16Paper
Approximation algorithms for the directed path partition problems2023-08-10Paper
An improved algorithm for parallel machine scheduling under additional resource constraints2023-03-24Paper
A 21/16-Approximation for the Minimum 3-Path Partition Problem2023-02-03Paper
Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints2023-01-04Paper
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles2022-12-22Paper
A local search 4/3-approximation algorithm for the minimum 3-path partition problem2022-10-31Paper
Approximation algorithms for the maximally balanced connected graph tripartition problem2022-10-04Paper
Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints2022-06-29Paper
The Berry-Ess\'{e}en Upper Bounds of Vasicek Model Estimators2022-05-29Paper
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph2022-04-13Paper
Approximation algorithms for maximally balanced connected graph partition2022-01-18Paper
The limit of mesoscopic one-way fluxes in a nonequilibrium chemical reaction with complex mechanism2021-11-14Paper
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles2021-08-11Paper
Improved hardness and approximation results for single allocation hub location2021-07-05Paper
An improved algorithm for a two-stage production scheduling problem with an outsourcing option2021-06-23Paper
A randomized approximation algorithm for metric triangle packing2021-05-11Paper
A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem2021-05-03Paper
Improved hardness and approximation results for single allocation hub location problems2021-04-08Paper
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem2020-11-25Paper
https://portal.mardi4nfdi.de/entity/Q51284592020-10-27Paper
Improved approximation algorithms for path vertex covers in regular graphs2020-10-12Paper
A randomized approximation algorithm for metric triangle packing2020-05-13Paper
Approximation algorithms for maximally balanced connected graph partition2020-05-13Paper
Approximation algorithms for the three-machine proportionate mixed shop scheduling2019-12-27Paper
Open-shop scheduling for unit jobs under precedence constraints2019-12-27Paper
Approximation algorithms for the maximum weight internal spanning tree problem2019-10-17Paper
A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem2019-10-11Paper
Open-shop scheduling for unit jobs under precedence constraints2019-10-11Paper
Approximation algorithms for vertex happiness2019-10-04Paper
Online scheduling with unit processing times and processing set restrictions2019-10-04Paper
An improved approximation algorithm for the minimum 3-path partition problem2019-06-25Paper
https://portal.mardi4nfdi.de/entity/Q46904592018-10-22Paper
Approximation algorithms for two-machine flow-shop scheduling with a conflict graph2018-10-04Paper
On the NP-hardness of scheduling with time restrictions2018-08-17Paper
Approximate the scheduling of quay cranes with non-crossing constraints2018-05-25Paper
Combinatorial approximation algorithms for spectrum assignment problem in chain and ring networks2018-02-26Paper
Approximation algorithms for the maximum weight internal spanning tree problem2017-10-23Paper
https://portal.mardi4nfdi.de/entity/Q52826672017-07-14Paper
https://portal.mardi4nfdi.de/entity/Q29836312017-05-17Paper
Better permutations for the single-processor scheduling with time restrictions2017-04-20Paper
Scheduling jobs with equal processing times and a single server on parallel identical machines2016-09-12Paper
https://portal.mardi4nfdi.de/entity/Q34669102016-01-25Paper
Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time2015-09-24Paper
Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage2014-06-30Paper
https://portal.mardi4nfdi.de/entity/Q49808002014-06-30Paper
Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination2013-12-17Paper
A new three-machine shop scheduling: complexity and approximation algorithm2013-12-09Paper
Approximation algorithms for parallel open shop scheduling2013-03-20Paper
Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance2012-07-16Paper
Parallel machines scheduling with machine maintenance for minsum criteria2012-05-14Paper
Single machine scheduling with semi-resumable machine availability constraints2012-01-27Paper
Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time2011-06-03Paper

Research outcomes over time

This page was built for person: Yong Chen