The following pages link to Zhiyi Tan (Q207397):
Displaying 50 items.
- Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis (Q389954) (← links)
- Privacy-preserving vertically partitioned linear program with nonnegativity constraints (Q395838) (← links)
- Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
- New upper and lower bounds for online scheduling with machine cost (Q429648) (← links)
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629) (← links)
- Tighter bounds of the First Fit algorithm for the bin-packing problem (Q602685) (← links)
- A note on hierarchical scheduling on two uniform machines (Q604878) (← links)
- Online hierarchical scheduling: an approach using mathematical programming (Q621843) (← links)
- Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← links)
- On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← links)
- Inefficiency of equilibria for the machine covering game on uniform machines (Q715052) (← links)
- Scheduling to minimize the maximum total completion time per machine (Q726222) (← links)
- Online parallel machines scheduling with two hierarchies (Q837151) (← links)
- Linear time algorithms for parallel machine scheduling (Q856829) (← links)
- Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system (Q866072) (← links)
- Optimal semi-online algorithms for machine covering (Q870840) (← links)
- On the machine scheduling problem with job delivery coordination (Q884029) (← links)
- Semi-online scheduling problems on two identical machines with inexact partial information (Q884466) (← links)
- Inefficiency of equilibria for scheduling game with machine activation costs (Q897948) (← links)
- Online scheduling with reassignment (Q935241) (← links)
- Online coupon consumption problem (Q941830) (← links)
- Bounds on delay start LPT algorithm for scheduling on two identical machines in the \(l_p\) norm (Q1008788) (← links)
- Semi-online machine covering for two uniform machines (Q1034625) (← links)
- Ordinal on-line scheduling for maximizing the minimum machine completion time (Q1598882) (← links)
- Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times (Q1609082) (← links)
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847) (← links)
- Coordination mechanisms for scheduling games with proportional deterioration (Q1694911) (← links)
- Minimizing total completion time of batch scheduling with nonidentical job sizes (Q1699779) (← links)
- Lower bound for 3-batched bin packing (Q1751161) (← links)
- Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979) (← links)
- Pseudo lower bounds for online parallel machine scheduling (Q1785411) (← links)
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints. (Q1853092) (← links)
- Semi-on-line problems on two identical machines with combined partial information (Q1870021) (← links)
- \(\kappa\)-partitioning problems for maximizing the minimum load (Q1879573) (← links)
- Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
- Scheduling game with machine modification in the random setting (Q2180155) (← links)
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
- Online scheduling with unit processing times and processing set restrictions (Q2326081) (← links)
- A note on the lower bound for the price of anarchy of scheduling games on unrelated machines (Q2345623) (← links)
- A new approach for bicriteria partitioning problem (Q2355323) (← links)
- In memoriam: Yong He (1969--2005) (Q2385474) (← links)
- Inefficiency of Nash equilibria with parallel processing policy (Q2444737) (← links)
- Preemptive machine covering on parallel machines (Q2583174) (← links)
- (Q2766832) (← links)
- ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES (Q2998841) (← links)
- Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time (Q3004670) (← links)
- (Q3147950) (← links)
- The PoA of Scheduling Game with Machine Activation Costs (Q3188847) (← links)
- (Q3373350) (← links)
- (Q3373621) (← links)
