The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joseph Y.-T. Leung: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  70. Integrating Communication Cost into the Utility Accrual Model for the Resource Allocation in Distributed Real-Time Systems. [Citation Graph (, )][DBLP]


  71. Testing Interval Trees for Real-Time Scheduling Systems. [Citation Graph (, )][DBLP]


  72. Packet routing on square meshes with row and column buses. [Citation Graph (, )][DBLP]


  73. Integrated Production and Delivery Scheduling with Disjoint Windows. [Citation Graph (, )][DBLP]


  74. Integrated production and delivery scheduling with disjoint windows. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002