The following pages link to An Zhang (Q262219):
Displaying 50 items.
- Sharp Hardy-Littlewood-Sobolev inequalities on the octonionic Heisenberg group (Q262220) (← links)
- Scheduling jobs with equal processing times and a single server on parallel identical machines (Q313819) (← links)
- Optimal functional inequalities for fractional operators on the sphere and applications (Q329884) (← 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)
- Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629) (← links)
- Sharp Hardy-Littlewood-Sobolev inequalities on a class of H-type groups (Q513800) (← links)
- Better permutations for the single-processor scheduling with time restrictions (Q523167) (← 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)
- Online parallel machines scheduling with two hierarchies (Q837151) (← links)
- Sharp Hardy-Littlewood-Sobolev inequalities on quaternionic Heisenberg groups (Q898376) (← links)
- Online coupon consumption problem (Q941830) (← links)
- Restriction theorems on Métiver groups associated to joint functional calculus (Q1624215) (← 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)
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← 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)
- 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)
- A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling (Q2168763) (← links)
- Machine scheduling with soft precedence constraints (Q2282538) (← links)
- Approximation algorithms for the three-machine proportionate mixed shop scheduling (Q2283006) (← links)
- A new rule reduction and training method for extended belief rule base based on DBSCAN algorithm (Q2300441) (← 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)
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times (Q2343998) (← links)
- Total completion time minimization in online hierarchical scheduling of unit-size jobs (Q2359792) (← links)
- An improved approximation algorithm for the minimum 3-path partition problem (Q2424798) (← links)
- An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop (Q2512819) (← links)
- Remainder terms for several inequalities on some groups of Heisenberg-type (Q2629801) (← 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)
- OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION (Q2905313) (← links)
- (Q2983631) (← links)
- (Q2993721) (← 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)
- Optimal Online Algorithms on Two Hierarchical Machines with Resource Augmentation (Q3087989) (← links)
- (Q3413272) (← links)
