The following pages link to Joseph Y.-T. Leung (Q210310):
Displaying 50 items.
- Two dimensional load balancing (Q1785303) (← links)
- Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. (Q1811628) (← links)
- Scheduling chain-structured tasks to minimize makespan and mean flow time (Q1814098) (← links)
- Bin packing with restricted piece sizes (Q1825652) (← links)
- Probabilistic analysis of a bin covering algorithm (Q1919189) (← links)
- Coordination mechanisms for parallel machine scheduling (Q1926738) (← links)
- A note on makespan minimization in proportionate flow shops (Q1944041) (← links)
- Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines (Q2379955) (← links)
- Scheduling imprecise computation tasks on uniform processors (Q2379995) (← links)
- Two-agent scheduling of time-dependent jobs (Q2410089) (← links)
- Minimizing total completion time for UET tasks with release time and outtree precedence constraints (Q2433242) (← links)
- Integrated production and distribution with fixed delivery departure dates (Q2450622) (← links)
- Preemptive multiprocessor order scheduling to minimize total weighted flowtime (Q2482817) (← links)
- Scheduling orders for multiple product types with due date related objectives (Q2569034) (← links)
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times (Q2628197) (← links)
- Complexity of two dual criteria scheduling problems (Q2643797) (← links)
- Parallel machine scheduling with nested processing set restrictions (Q2655610) (← links)
- Minimizing total completion time on uniform machines with deadline constraints (Q2944508) (← links)
- Minimizing mean flow time for UET tasks (Q2944515) (← links)
- An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365) (← links)
- On Minimum Cost Recovery from System Deadlock (Q3049811) (← links)
- Competitive Two-Agent Scheduling and Its Applications (Q3100480) (← links)
- Minimizing the total weighted delivery time in container transportation scheduling (Q3120557) (← links)
- Minimizing Total Tardiness on One Machine is NP-Hard (Q3200872) (← links)
- Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time (Q3202129) (← links)
- Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation (Q3208073) (← links)
- On a dual version of the one-dimensional bin packing problem (Q3219761) (← links)
- Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs (Q3333069) (← links)
- On Some Variants of the Bandwidth Minimization Problem (Q3335004) (← links)
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS (Q3434279) (← links)
- Scheduling parallel machines with inclusive processing set restrictions (Q3518727) (← links)
- Scheduling multiple products on parallel machines with setup costs (Q3627937) (← links)
- Integrated Production and Delivery Scheduling with Disjoint Windows (Q3637094) (← links)
- The Ordered Open-End Bin-Packing Problem (Q3637387) (← links)
- PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION (Q3655542) (← links)
- (Q3741051) (← links)
- (Q3783557) (← links)
- Minimizing Schedule Length Subject to Minimum Flow Time (Q3826351) (← links)
- Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length (Q3826356) (← links)
- Complexity of Scheduling Parallel Task Systems (Q3832306) (← links)
- On Scheduling Independent Tasks with Restricted Execution Times (Q3939585) (← links)
- On the complexity of fixed-priority scheduling of periodic, real-time tasks (Q3960458) (← links)
- Minimizing Total Tardiness on a Single Machine with Precedence Constraints (Q4025912) (← links)
- Some Results on Liu’s Conjecture (Q4030190) (← links)
- Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops (Q4033755) (← links)
- Minimizing Mean Flow Time With Release Time and Deadline Constraints (Q4033756) (← links)
- An efficient algorithm for allocating paged, drum-like storage (Q4158467) (← links)
- (Q4182227) (← links)
- (Q4351085) (← links)
- Split-delivery routeing heuristics in livestock feed distribution (Q4367022) (← links)
