The following pages link to Yong Chen (Q313817):
Displaying 39 items.
- Scheduling jobs with equal processing times and a single server on parallel identical machines (Q313819) (← links)
- A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← links)
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination (Q387811) (← links)
- (Q421520) (redirect page) (← links)
- Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
- (Q497628) (redirect page) (← links)
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629) (← links)
- Better permutations for the single-processor scheduling with time restrictions (Q523167) (← links)
- Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← links)
- On the NP-hardness of scheduling with time restrictions (Q1662160) (← links)
- Combinatorial approximation algorithms for spectrum assignment problem in chain and ring networks (Q1699773) (← links)
- Approximate the scheduling of quay cranes with non-crossing constraints (Q1751714) (← links)
- Approximation algorithms for two-machine flow-shop scheduling with a conflict graph (Q1790974) (← links)
- Approximation algorithms for parallel open shop scheduling (Q1943639) (← links)
- Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
- A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem (Q2023131) (← links)
- An improved algorithm for a two-stage production scheduling problem with an outsourcing option (Q2034787) (← links)
- Improved hardness and approximation results for single allocation hub location (Q2039648) (← links)
- Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← links)
- A local search 4/3-approximation algorithm for the minimum 3-path partition problem (Q2091113) (← links)
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2149860) (← links)
- Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage (Q2248262) (← links)
- Approximation algorithms for the three-machine proportionate mixed shop scheduling (Q2283006) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- Online scheduling with unit processing times and processing set restrictions (Q2326081) (← links)
- A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem (Q2327083) (← links)
- An improved approximation algorithm for the minimum 3-path partition problem (Q2424798) (← links)
- Improved hardness and approximation results for single allocation hub location problems (Q2661760) (← links)
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2680859) (← links)
- An improved algorithm for parallel machine scheduling under additional resource constraints (Q2693796) (← links)
- Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance (Q2897979) (← links)
- (Q2983631) (← links)
- Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time (Q3004670) (← links)
- (Q5128459) (← links)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem (Q5136287) (← links)
- (Q5282667) (← links)
- A 21/16-Approximation for the Minimum 3-Path Partition Problem (Q5875609) (← links)
- Approximating the directed path partition problem (Q6204168) (← links)
