The following pages link to Zhaohui Liu (Q210316):
Displaying 50 items.
- Optimal deterministic algorithms for some variants of online quota traveling salesman problem (Q296870) (← links)
- Semi-online scheduling with bounded job sizes on two uniform machines (Q338376) (← links)
- A theoretical development for the total tardiness problem and its application in branch and bound algorithms (Q339575) (← links)
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- Existence of solutions for the critical elliptic system with inverse square potentials (Q350754) (← links)
- Heuristics for parallel machine scheduling with batch delivery consideration (Q380563) (← links)
- Semi-online scheduling problems on two uniform machines under a grade of service provision (Q388114) (← links)
- Routing open shop and flow shop scheduling problems (Q421573) (← links)
- Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle (Q428867) (← links)
- Accountable authority key policy attribute-based encryption (Q439851) (← links)
- An improved approximation algorithm for the clustered traveling salesman problem (Q456175) (← links)
- Semi-online scheduling with known partial information about job sizes on two identical machines (Q551204) (← links)
- Semi-online scheduling with known maximum job size on two uniform machines (Q613661) (← links)
- The influence of sub-grid scale motions on particle collision in homogeneous isotropic turbulence (Q724447) (← links)
- Online scheduling with reassignment on two uniform machines (Q982662) (← links)
- Vehicle routing problems on a line-shaped network with release time constraints (Q1015302) (← links)
- NHPP models with Markov switching for software reliability (Q1023746) (← links)
- \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints (Q1029003) (← links)
- Minimizing the number of late jobs under the group technology assumption (Q1304380) (← links)
- Approximability of two-machine no-wait flowshop scheduling with availability constraints. (Q1413925) (← links)
- Scheduling one batch processor subject to job release dates (Q1582073) (← links)
- Scheduling with job release dates, delivery times and preemption penalties (Q1603554) (← links)
- Scheduling groups of unit length jobs on two identical parallel machines. (Q1606911) (← links)
- Eulerian and Lagrangian stagnation plane behavior of moderate Reynolds number round opposed-jets flow (Q1646964) (← links)
- Shapley value for parallel machine sequencing situation without initial order (Q1665679) (← links)
- On scheduling an unbounded batch machine (Q1870002) (← links)
- Approximating the multiple-depot multiple-terminal Hamiltonian path problem (Q2010925) (← links)
- An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints (Q2014051) (← links)
- An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies (Q2014427) (← links)
- An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem (Q2059872) (← links)
- The price of fairness for a two-agent scheduling game minimizing total completion time (Q2082220) (← links)
- Approximation algorithms for the \(k\)-depots Hamiltonian path problem (Q2128771) (← links)
- A simple and efficient parallel immersed boundary-lattice Boltzmann method for fully resolved simulations of incompressible settling suspensions (Q2129505) (← links)
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity (Q2156303) (← links)
- Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints (Q2169436) (← links)
- A boundary thickening-based direct forcing immersed boundary method for fully resolved simulation of particle-laden flows (Q2221353) (← links)
- A unified stochastic particle Bhatnagar-Gross-Krook method for multiscale gas flows (Q2222669) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- Online scheduling with equal processing times and machine eligibility constraints (Q2257291) (← links)
- New LP relaxations for minimum cycle/path/tree cover problems (Q2283007) (← links)
- Distance constrained vehicle routing problem to minimize the total cost (Q2300077) (← links)
- Online fractional hierarchical scheduling on uniformly related machines (Q2333135) (← links)
- A note on approximation algorithms of the clustered traveling salesman problem (Q2398506) (← links)
- Better inapproximability bounds and approximation algorithms for MIN-MAX tree/cycle/path cover problems (Q2412434) (← links)
- Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
- Minimizing total completion time subject to job release dates and preemption penalties (Q2464427) (← links)
- Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine (Q2576877) (← links)
- Approximation algorithms for multi-vehicle stacker crane problems (Q2687683) (← links)
- (Q3052581) (← links)
- Single-vehicle scheduling problems with release and service times on a line (Q3082601) (← links)
