| 2008 |
|---|
| 78 | EE | Xinfa Hu,
Joseph Y.-T. Leung:
Integrating Communication Cost into the Utility Accrual Model for the Resource Allocation in Distributed Real-Time Systems.
RTCSA 2008: 217-226 |
| 77 | EE | Xinfa Hu,
Joseph Y.-T. Leung:
Testing Interval Trees for Real-Time Scheduling Systems.
RTCSA 2008: 327-336 |
| 76 | EE | Joseph Y.-T. Leung,
Haibing Li,
Michael Pinedo:
Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time.
Annals OR 159(1): 107-123 (2008) |
| 75 | EE | Joseph Y.-T. Leung,
Hairong Zhao:
Scheduling problems in master-slave model.
Annals OR 159(1): 215-231 (2008) |
| 74 | EE | Joseph Y.-T. Leung,
C. T. Ng,
T. C. Edwin Cheng:
Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times.
European Journal of Operational Research 187(3): 1090-1099 (2008) |
| 73 | EE | Joseph Y.-T. Leung,
Chung-Yee Lee,
Chung W. Ng,
Gilbert H. Young:
Preemptive multiprocessor order scheduling to minimize total weighted flowtime.
European Journal of Operational Research 190(1): 40-51 (2008) |
| 72 | EE | Joseph Y.-T. Leung,
Chung-Lun Li:
An asymptotic approximation scheme for the concave cost bin packing problem.
European Journal of Operational Research 191(2): 582-586 (2008) |
| 71 | EE | Yumei Huo,
Joseph Y.-T. Leung,
Xin Wang:
Online scheduling of equal-processing-time task systems.
Theor. Comput. Sci. 401(1-3): 85-95 (2008) |
| 2007 |
|---|
| 70 | EE | Joseph Y.-T. Leung,
Haibing Li,
Michael Pinedo:
Scheduling orders for multiple product types to minimize total weighted completion time.
Discrete Applied Mathematics 155(8): 945-970 (2007) |
| 69 | EE | Yumei Huo,
Joseph Y.-T. Leung,
Hairong Zhao:
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness.
European Journal of Operational Research 177(1): 116-134 (2007) |
| 68 | EE | Joseph Y.-T. Leung,
Haibing Li,
Michael Pinedo,
Jiawei Zhang:
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines.
Inf. Process. Lett. 103(3): 119-129 (2007) |
| 67 | EE | Guohua Wan,
Joseph Y.-T. Leung,
Michael Pinedo:
Scheduling imprecise computation tasks on uniform processors.
Inf. Process. Lett. 104(2): 45-52 (2007) |
| 66 | EE | Joseph Y.-T. Leung,
Haibing Li,
Hairong Zhao:
Scheduling Two-Machine Flow shops with Exact Delays.
Int. J. Found. Comput. Sci. 18(2): 341-359 (2007) |
| 65 | EE | Yumei Huo,
Joseph Y.-T. Leung,
Hairong Zhao:
Complexity of two dual criteria scheduling problems.
Oper. Res. Lett. 35(2): 211-220 (2007) |
| 2006 |
|---|
| 64 | EE | Teofilo F. Gonzalez,
Joseph Y.-T. Leung,
Michael Pinedo:
Minimizing total completion time on uniform machines with deadline constraints.
ACM Transactions on Algorithms 2(1): 95-115 (2006) |
| 63 | EE | Yumei Huo,
Joseph Y.-T. Leung:
Minimizing mean flow time for UET tasks.
ACM Transactions on Algorithms 2(2): 244-262 (2006) |
| 62 | EE | Joseph Y.-T. Leung,
Haibing Li,
Michael Pinedo:
Scheduling orders for multiple product types with due date related objectives.
European Journal of Operational Research 168(2): 370-389 (2006) |
| 61 | EE | Joseph Y.-T. Leung,
Hairong Zhao:
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems.
IEEE Trans. Computers 55(8): 985-999 (2006) |
| 60 | EE | Chung-Yee Lee,
Joseph Y.-T. Leung,
Gang Yu:
Two Machine Scheduling under Disruptions with Transportation Considerations.
J. Scheduling 9(1): 35-48 (2006) |
| 2005 |
|---|
| 59 | EE | Joseph Y.-T. Leung,
Haibing Li,
Michael Pinedo,
Chelliah Sriskandarajah:
Open shops with jobs overlap - revisited.
European Journal of Operational Research 163(2): 569-571 (2005) |
| 58 | EE | Joseph Y.-T. Leung,
Hairong Zhao:
Minimizing mean flowtime and makespan on master-slave systems.
J. Parallel Distrib. Comput. 65(7): 843-856 (2005) |
| 57 | EE | Joseph Y.-T. Leung,
Haibing Li,
Michael Pinedo:
Order Scheduling in an Environment with Dedicated Resources in Parallel.
J. Scheduling 8(5): 355-386 (2005) |
| 56 | EE | Yumei Huo,
Joseph Y.-T. Leung:
Online Scheduling of Precedence Constrained Tasks.
SIAM J. Comput. 34(3): 743-762 (2005) |
| 2004 |
|---|
| 55 | | Joseph Y.-T. Leung,
Hairong Zhao:
Minimizing Mean Flowtime on Master-Slave Machines.
PDPTA 2004: 939-945 |
| 54 | EE | Kevin I.-J. Ho,
Joseph Y.-T. Leung:
A Dual Criteria Preemptive Scheduling Problem For Minimax Error Of Imprecise Computation Tasks.
Int. J. Found. Comput. Sci. 15(5): 717-731 (2004) |
| 53 | EE | Joseph Y.-T. Leung:
Improved Competitive Algorithms For Two-Processor Real-Time Systems.
Int. J. Found. Comput. Sci. 15(5): 733-751 (2004) |
| 2003 |
|---|
| 52 | | Chung W. Ng,
Joseph Y.-T. Leung,
Gilbert H. Young:
Heuristics for Generalized Task System.
PDPTA 2003: 1447-1453 |
| 51 | EE | James M. Calvin,
Joseph Y.-T. Leung:
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.
Oper. Res. Lett. 31(3): 202-210 (2003) |
| 50 | EE | Joseph Y.-T. Leung,
Michael Pinedo:
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints.
SIAM J. Comput. 32(5): 1370-1388 (2003) |
| 1999 |
|---|
| 49 | EE | Moshe Dror,
Wieslaw Kubiak,
Joseph Y.-T. Leung:
Tree Precedence in Scheduling: The Strong-Weak Distinction.
Inf. Process. Lett. 71(3-4): 127-134 (1999) |
| 1998 |
|---|
| 48 | | Joseph Y.-T. Leung,
Tommy W. Tam,
C. S. Wong,
Gilbert H. Young:
Minimizing Mean Flow Time with Error Constraint.
Algorithmica 20(1): 101-118 (1998) |
| 1997 |
|---|
| 47 | EE | Kevin I.-J. Ho,
Joseph Y.-T. Leung,
W.-D. Wei:
Scheduling Imprecise Computation Tasks with 0/1-constraint.
Discrete Applied Mathematics 78(1-3): 117-132 (1997) |
| 1996 |
|---|
| 46 | | Gilbert H. Young,
Joseph Y.-T. Leung,
Xue-Jie Zhang:
Generalized Task System for Parallel Computation.
PDPTA 1996: 241-244 |
| 45 | | Joseph Y.-T. Leung,
Tommy W. Tam,
Gilbert H. Young:
On-Line Routing of Real-Time Messages.
J. Parallel Distrib. Comput. 34(2): 211-217 (1996) |
| 1995 |
|---|
| 44 | EE | Dawei Hong,
Joseph Y.-T. Leung:
Probabilistic Analysis of k-Dimensional Packing Algorithms.
Inf. Process. Lett. 55(1): 17-24 (1995) |
| 43 | EE | Joseph Y.-T. Leung,
W.-D. Wei:
Tighter Bounds on a Heuristic for a Partition Problem.
Inf. Process. Lett. 56(1): 51-57 (1995) |
| 42 | EE | Joseph Y.-T. Leung,
Tommy W. Tam,
C. S. Wong,
Gilbert H. Young:
Routing Messages with Release Time and Deadline Constraint.
J. Parallel Distrib. Comput. 31(1): 65-76 (1995) |
| 1994 |
|---|
| 41 | EE | Joseph Y.-T. Leung,
Vincent K. M. Yu,
W.-D. Wei:
Minimizing the Weighted Number of Tardy Task Units.
Discrete Applied Mathematics 51(3): 307-316 (1994) |
| 40 | | Joseph Y.-T. Leung,
Vincent K. M. Yu:
Heuristic for Minimizing the Number of Late Jobs on Two Processors.
Int. J. Found. Comput. Sci. 5(3/4): 262-279 (1994) |
| 39 | | Kevin I.-J. Ho,
Joseph Y.-T. Leung,
W.-D. Wei:
Minimizing Maximum Weighted Error for Imprecise Computation Tasks.
J. Algorithms 16(3): 431-452 (1994) |
| 38 | | Joseph Y.-T. Leung,
Sunil M. Shende:
On Multidimensional Packet Routing for Meshes with Buses.
J. Parallel Distrib. Comput. 20(2): 187-197 (1994) |
| 1993 |
|---|
| 37 | | Joseph Y.-T. Leung,
C. S. Wong:
Minimizing the Number of Late Tasks with Error Constraint
Inf. Comput. 106(1): 83-108 (1993) |
| 36 | | Kevin I.-J. Ho,
Joseph Y.-T. Leung,
W.-D. Wei:
Complexity of Scheduling Tasks with Time-Dependent Execution Times.
Inf. Process. Lett. 48(6): 315-320 (1993) |
| 35 | | Jianzhong Du,
Joseph Y.-T. Leung:
Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops.
J. Algorithms 14(1): 24-44 (1993) |
| 34 | | Jianzhong Du,
Joseph Y.-T. Leung:
Minimizing Mean Flow Time with Release Time and Deadline Constraints.
J. Algorithms 14(1): 45-68 (1993) |
| 1992 |
|---|
| 33 | | Kwang Soo Hong,
Joseph Y.-T. Leung:
On-Line Scheduling of Real-Time Tasks.
IEEE Trans. Computers 41(10): 1326-1331 (1992) |
| 32 | | Joseph Y.-T. Leung,
W.-D. Wei:
A Comparison Theorem for Permanents and a Proof of a Conjecture on (t, m)-Families.
J. Comb. Theory, Ser. A 61(1): 98-112 (1992) |
| 31 | | Kwang Soo Hong,
Joseph Y.-T. Leung:
Some Results on Liu's Conjecture.
SIAM J. Discrete Math. 5(4): 500-523 (1992) |
| 1991 |
|---|
| 30 | | Jianzhong Du,
Joseph Y.-T. Leung,
Gilbert H. Young:
Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time
Inf. Comput. 92(2): 219-236 (1991) |
| 1990 |
|---|
| 29 | | Joseph Y.-T. Leung,
Tommy W. Tam,
Gilbert H. Young:
On-Line Routing of Real-Time Messages.
IEEE Real-Time Systems Symposium 1990: 126-135 |
| 28 | | Joseph Y.-T. Leung,
C. S. Wong:
Minimizing the Number of Late Tasks with Error Constraint.
IEEE Real-Time Systems Symposium 1990: 32-40 |
| 27 | | Joseph Y.-T. Leung,
Gilbert H. Young:
Preemptive Scheduling to Minimize Mean Weighted Flow Time.
Inf. Process. Lett. 34(1): 47-50 (1990) |
| 26 | | Joseph Y.-T. Leung,
Tommy W. Tam,
C. S. Wong,
Gilbert H. Young,
Francis Y. L. Chin:
Packing Squares into a Square.
J. Parallel Distrib. Comput. 10(3): 271-275 (1990) |
| 25 | | Jianzhong Du,
Joseph Y.-T. Leung,
Gilbert H. Young:
Minimizing Mean Flow Time with Release Time Constraint.
Theor. Comput. Sci. 75(3): 347-355 (1990) |
| 1989 |
|---|
| 24 | | Joseph Y.-T. Leung,
Tommy W. Tam,
C. S. Wong,
G. H. Wong:
Minimizing Mean Flow Time with Error Constraint.
IEEE Real-Time Systems Symposium 1989: 2-11 |
| 23 | | Joseph Y.-T. Leung:
A New Algorithm for Scheduling Periodic Real-Time Tasks.
Algorithmica 4(2): 209-219 (1989) |
| 22 | | Joseph Y.-T. Leung:
Bin Packing with Restricted Piece Sizes.
Inf. Process. Lett. 31(3): 145-149 (1989) |
| 21 | EE | Joseph Y.-T. Leung:
Bin packing with restricted piece sizes.
Inf. Process. Lett. 32(3): 145-149 (1989) |
| 20 | | Kwang Soo Hong,
Joseph Y.-T. Leung:
Preemptive Scheduling with Release Times and Deadlines.
Real-Time Systems 1(3): 265-281 (1989) |
| 19 | | Joseph Y.-T. Leung,
Gilbert H. Young:
Minimizing Schedule Length Subject to Minimum Flow Time.
SIAM J. Comput. 18(2): 314-326 (1989) |
| 18 | | Jianzhong Du,
Joseph Y.-T. Leung:
Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length.
SIAM J. Discrete Math. 2(2): 176-196 (1989) |
| 17 | | Jianzhong Du,
Joseph Y.-T. Leung:
Complexity of Scheduling Parallel Task Systems.
SIAM J. Discrete Math. 2(4): 473-487 (1989) |
| 1988 |
|---|
| 16 | | Jianzhong Du,
Joseph Y.-T. Leung:
Minimizing Mean Flow Time with Release Time and Deadline Constraints.
IEEE Real-Time Systems Symposium 1988: 24-32 |
| 15 | | Kwang Soo Hong,
Joseph Y.-T. Leung:
On-Line Scheduling of Real-Time Tasks.
IEEE Real-Time Systems Symposium 1988: 244-250 |
| 14 | | Jianzhong Du,
Joseph Y.-T. Leung:
Scheduling Tree-Structured Tasks with Restricted Execution Times.
Inf. Process. Lett. 28(4): 183-188 (1988) |
| 1985 |
|---|
| 13 | | Joseph Y.-T. Leung,
Burkhard Monien:
On the Complexity of Deadlock Recovery.
STACS 1985: 208-218 |
| 1984 |
|---|
| 12 | | D. T. Lee,
Joseph Y.-T. Leung:
On the 2-Dimensional Channel Assignment Problem.
IEEE Trans. Computers 33(1): 2-6 (1984) |
| 11 | | Joseph Y.-T. Leung:
Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs.
J. Algorithms 5(1): 22-35 (1984) |
| 10 | | S. F. Assmann,
David S. Johnson,
Daniel J. Kleitman,
Joseph Y.-T. Leung:
On a Dual Version of the One-Dimensional Bin Packing Problem.
J. Algorithms 5(4): 502-525 (1984) |
| 9 | | Joseph Y.-T. Leung,
Oliver Vornberger,
James D. Witthoff:
On Some Variants of the Bandwidth Minimization Problem.
SIAM J. Comput. 13(3): 650-667 (1984) |
| 1981 |
|---|
| 8 | | U. I. Gupta,
D. T. Lee,
Joseph Y.-T. Leung,
J. W. Pruitt,
C. K. Wong:
Record Allocation for Minimizing Seek Delay.
Theor. Comput. Sci. 16: 307-319 (1981) |
| 1980 |
|---|
| 7 | | Joseph Y.-T. Leung,
M. L. Merrill:
A Note on Preemptive Scheduling of Periodic, Real-Time Tasks.
Inf. Process. Lett. 11(3): 115-118 (1980) |
| 1979 |
|---|
| 6 | | U. I. Gupta,
D. T. Lee,
Joseph Y.-T. Leung:
An Optimal Solution for the Channel-Assignment Problem.
IEEE Trans. Computers 28(11): 807-810 (1979) |
| 5 | | Joseph Y.-T. Leung,
Edmund K. Lai:
On Minimum Cost Recovery from System Deadlock.
IEEE Trans. Computers 28(9): 671-677 (1979) |
| 4 | | Joseph Y.-T. Leung:
Bounds on List Scheduling of UET Tasks with Restricted Resource Constraints.
Inf. Process. Lett. 9(4): 167-170 (1979) |
| 3 | | Edward G. Coffman Jr.,
Joseph Y.-T. Leung:
Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation.
SIAM J. Comput. 8(2): 202-217 (1979) |
| 1978 |
|---|
| 2 | | Edward G. Coffman Jr.,
Joseph Y.-T. Leung,
D. W. Ting:
Bin Packing: Maximizing the Number of Pieces Packed.
Acta Inf. 9: 263-271 (1978) |
| 1977 |
|---|
| 1 | | Edward G. Coffman Jr.,
Joseph Y.-T. Leung:
Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
FOCS 1977: 214-221 |
