The following pages link to Yong Chen (Q313817):
Displaying 14 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)
- (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)
