dblp.uni-trier.dewww.uni-trier.de

Joseph Y.-T. Leung Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
86EEYumei Huo, Joseph Y.-T. Leung, Xin Wang: Integrated Production and Delivery Scheduling with Disjoint Windows. COCOA 2009: 471-482
85EEKangbok Lee, Joseph Y.-T. Leung, Michael Pinedo: A note on "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs". Inf. Process. Lett. 109(12): 608-610 (2009)
84EEKangbok Lee, Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. Inf. Process. Lett. 109(16): 913-917 (2009)
83EEKangbok Lee, Joseph Y.-T. Leung, Michael Pinedo: Online scheduling on two uniform machines subject to eligibility constraints. Theor. Comput. Sci. 410(38-40): 3975-3981 (2009)
2008
82EEXinfa 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
81EEXinfa Hu, Joseph Y.-T. Leung: Testing Interval Trees for Real-Time Scheduling Systems. RTCSA 2008: 327-336
80EEJoseph 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)
79EEJoseph Y.-T. Leung, Hairong Zhao: Scheduling problems in master-slave model. Annals OR 159(1): 215-231 (2008)
78EEJoseph 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)
77EEJoseph 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)
76EEJoseph 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)
75EEYumei 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
74EEJoseph 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)
73EEYumei 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)
72EEJoseph 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)
71EEGuohua Wan, Joseph Y.-T. Leung, Michael Pinedo: Scheduling imprecise computation tasks on uniform processors. Inf. Process. Lett. 104(2): 45-52 (2007)
70EEJoseph 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)
69EEYumei Huo, Joseph Y.-T. Leung, Hairong Zhao: Complexity of two dual criteria scheduling problems. Oper. Res. Lett. 35(2): 211-220 (2007)
2006
68EETeofilo 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)
67EEYumei Huo, Joseph Y.-T. Leung: Minimizing mean flow time for UET tasks. ACM Transactions on Algorithms 2(2): 244-262 (2006)
66EEJoseph 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)
65EEJoseph Y.-T. Leung, Hairong Zhao: Minimizing Sum of Completion Times and Makespan in Master-Slave Systems. IEEE Trans. Computers 55(8): 985-999 (2006)
64EEChung-Yee Lee, Joseph Y.-T. Leung, Gang Yu: Two Machine Scheduling under Disruptions with Transportation Considerations. J. Scheduling 9(1): 35-48 (2006)
2005
63EEJoseph 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)
62EEJoseph Y.-T. Leung, Hairong Zhao: Minimizing mean flowtime and makespan on master-slave systems. J. Parallel Distrib. Comput. 65(7): 843-856 (2005)
61EEJoseph Y.-T. Leung, Haibing Li, Michael Pinedo: Order Scheduling in an Environment with Dedicated Resources in Parallel. J. Scheduling 8(5): 355-386 (2005)
60EEYumei Huo, Joseph Y.-T. Leung: Online Scheduling of Precedence Constrained Tasks. SIAM J. Comput. 34(3): 743-762 (2005)
2004
59 Joseph Y.-T. Leung, Hairong Zhao: Minimizing Mean Flowtime on Master-Slave Machines. PDPTA 2004: 939-945
58EEKevin 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)
57EEJoseph Y.-T. Leung: Improved Competitive Algorithms For Two-Processor Real-Time Systems. Int. J. Found. Comput. Sci. 15(5): 733-751 (2004)
2003
56 Chung W. Ng, Joseph Y.-T. Leung, Gilbert H. Young: Heuristics for Generalized Task System. PDPTA 2003: 1447-1453
55EEJames 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)
54EEJian Yang, Joseph Y.-T. Leung: The Ordered Open-End Bin-Packing Problem. Operations Research 51(5): 759-770 (2003)
53EEJoseph Y.-T. Leung, Michael Pinedo: Minimizing Total Completion Time on Parallel Machines with Deadline Constraints. SIAM J. Comput. 32(5): 1370-1388 (2003)
1999
52EEMoshe 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
51 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
50EEKevin 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
49 Gilbert H. Young, Joseph Y.-T. Leung, Xue-Jie Zhang: Generalized Task System for Parallel Computation. PDPTA 1996: 241-244
48 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
47EESunan Han, Dawei Hong, Joseph Y.-T. Leung: On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem. INFORMS Journal on Computing 7(2): 201-204 (1995)
46EEDawei Hong, Joseph Y.-T. Leung: Probabilistic Analysis of k-Dimensional Packing Algorithms. Inf. Process. Lett. 55(1): 17-24 (1995)
45EEJoseph Y.-T. Leung, W.-D. Wei: Tighter Bounds on a Heuristic for a Partition Problem. Inf. Process. Lett. 56(1): 51-57 (1995)
44EEJoseph 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
43EEJoseph 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)
42 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)
41 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)
40 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
39 Joseph Y.-T. Leung, C. S. Wong: Minimizing the Number of Late Tasks with Error Constraint Inf. Comput. 106(1): 83-108 (1993)
38 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)
37 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)
36 Jianzhong Du, Joseph Y.-T. Leung: Minimizing Mean Flow Time with Release Time and Deadline Constraints. J. Algorithms 14(1): 45-68 (1993)
1992
35 Kwang Soo Hong, Joseph Y.-T. Leung: On-Line Scheduling of Real-Time Tasks. IEEE Trans. Computers 41(10): 1326-1331 (1992)
34 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)
33 Kwang Soo Hong, Joseph Y.-T. Leung: Some Results on Liu's Conjecture. SIAM J. Discrete Math. 5(4): 500-523 (1992)
1991
32EEJoseph Y.-T. Leung, Sunil M. Shende: Packet routing on square meshes with row and column buses. SPDP 1991: 834-837
31 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
30 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
29 Joseph Y.-T. Leung, C. S. Wong: Minimizing the Number of Late Tasks with Error Constraint. IEEE Real-Time Systems Symposium 1990: 32-40
28EEJoseph Y.-T. Leung, Gilbert H. Young: Minimizing Total Tardiness on a Single Machine with Precedence Constraints. INFORMS Journal on Computing 2(4): 346-352 (1990)
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)
21EEJoseph 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
13EEJoseph 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

Coauthor Index

1S. F. Assmann [10]
2James M. Calvin [55]
3T. C. Edwin Cheng [78]
4Francis Y. L. Chin (Francis Yuk-Lun Chin) [26]
5Byung-Cheon Choi [84]
6Edward G. Coffman Jr. [1] [2] [3]
7Moshe Dror [52]
8Jianzhong Du [14] [16] [17] [18] [25] [31] [36] [37]
9Teofilo F. Gonzalez [68]
10U. I. Gupta [6] [8]
11Sunan Han [47]
12Kevin I.-J. Ho [38] [41] [50] [58]
13Dawei Hong [46] [47]
14Kwang Soo Hong [15] [20] [33] [35]
15Xinfa Hu [81] [82]
16Yumei Huo [60] [67] [69] [73] [75] [86]
17David S. Johnson [10]
18Daniel J. Kleitman [10]
19Wieslaw Kubiak [52]
20Edmund K. Lai [5]
21Chung-Yee Lee [64] [77]
22D. T. Lee (Der-Tsai Lee) [6] [8] [12]
23Kangbok Lee [83] [84] [85]
24Chung-Lun Li [76]
25Haibing Li [61] [63] [66] [70] [72] [74] [80]
26M. L. Merrill [7]
27Burkhard Monien [13]
28C. T. Ng [78]
29Chung W. Ng [56] [77]
30Michael Pinedo [53] [61] [63] [66] [68] [71] [72] [74] [80] [83] [85]
31Michael L. Pinedo [84]
32J. W. Pruitt [8]
33Sunil M. Shende [32] [40]
34Chelliah Sriskandarajah [63]
35Tommy W. Tam [24] [26] [30] [44] [48] [51]
36D. W. Ting [2]
37Oliver Vornberger [9]
38Guohua Wan [71]
39Xin Wang [75] [86]
40W.-D. Wei [34] [38] [41] [43] [45] [50]
41James D. Witthoff [9]
42C. S. Wong [24] [26] [29] [39] [44] [51]
43Chak-Kuen Wong (C. K. Wong) [8]
44G. H. Wong [24]
45Jian Yang [54]
46Gilbert H. Young [19] [25] [26] [27] [28] [30] [31] [44] [48] [49] [51] [56] [77]
47Gang Yu [64]
48Vincent K. M. Yu [42] [43]
49Jiawei Zhang [72]
50Xue-Jie Zhang [49]
51Hairong Zhao [59] [62] [65] [69] [70] [73] [79]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)