The following pages link to Wenhua Li (Q296689):
Displayed 49 items.
- Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690) (← links)
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead (Q413308) (← links)
- Standardization of interval symbolic data based on the empirical descriptive statistics (Q425662) (← links)
- A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints (Q714856) (← links)
- Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan (Q721932) (← links)
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective: A correction (Q880571) (← links)
- An improved cyclostationary feature detection based on the selection of optimal parameter in cognitive radios (Q894079) (← links)
- A fast algorithm for the \(n\)-D discrete cosine transform (Q1129829) (← links)
- Parallel machine scheduling of machine-dependent jobs with unit-length. (Q1426708) (← links)
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines (Q1637343) (← links)
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199) (← links)
- The medical laboratory scheduling for weighted flow-time (Q1740398) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164) (← links)
- Online scheduling on a single machine with linear deteriorating processing times and delivery times (Q2082204) (← links)
- Online scheduling of incompatible unit-length job families with lookahead (Q2250449) (← links)
- Stability and synchronization control of inertial neural networks with mixed delays (Q2284806) (← links)
- Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
- A note on special optimal batching structures to minimize total weighted completion time (Q2426655) (← links)
- Reputation-based collaborative spectrum sensing scheme in cognitive radio networks (Q2440172) (← links)
- Reinvestigation of evolutionary many-objective optimization: focus on the Pareto knee front (Q2663476) (← links)
- (Q2886471) (← links)
- (Q2916934) (← links)
- (Q2924306) (← links)
- A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES (Q2931730) (← links)
- (Q2987617) (← links)
- (Q2993685) (← links)
- (Q3109615) (← links)
- (Q3171167) (← links)
- (Q3194322) (← links)
- RESCHEDULING WITH RELEASE DATES TO MINIMIZE TOTAL SEQUENCE DISRUPTION UNDER A LIMIT ON THE MAKESPAN (Q3502863) (← links)
- (Q3513402) (← links)
- (Q3610323) (← links)
- (Q3993834) (← links)
- Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (Q4561187) (← links)
- (Q4901572) (← links)
- (Q4980804) (← links)
- (Q5098019) (← links)
- (Q5100619) (← links)
- (Q5115392) (← links)
- Dissipativity and synchronization control of fractional‐order memristive neural networks with reaction‐diffusion terms (Q5214970) (← links)
- Fixed‐time output‐feedback consensus tracking control for second‐order multiagent systems (Q5241748) (← links)
- Algorithms for Two Kinds of Parallel Batch Scheduling with Batching Costs (Q5400297) (← links)
- (Q5432835) (← links)
- (Q5456016) (← links)
- (Q5476703) (← links)
- Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval (Q6053500) (← links)
- Study for a lab-made Moiré pattern-based thread counter (Q6105786) (← links)
- Approximation algorithms for batch scheduling with processing set restrictions (Q6124768) (← links)