| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Dongsheng Xu, Chung-Lun Li, Joseph Y.-T. Leung |
Berth allocation with time-dependent physical limitations on vessels.  |
European Journal of Operational Research  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo |
Coordination mechanisms for parallel machine scheduling. |
European Journal of Operational Research |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo |
Minimizing makespan in an ordered flow shop with machine-dependent processing times. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo |
Coordination mechanisms with hybrid local policies. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Xinfa Hu, Guoliang Xing, Joseph Y.-T. Leung |
Exploring the Interplay between Computation and Communication in Distributed Real-Time Scheduling. |
IEEE Trans. Computers |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo |
Scheduling jobs with equal processing times subject to machine eligibility constraints. |
J. Scheduling |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo |
Complexity of a scheduling problem with controllable processing times. |
Oper. Res. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo |
A note on makespan minimization in proportionate flow shops. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yumei Huo, Joseph Y.-T. Leung |
Fast approximation algorithms for job scheduling with processing set restrictions. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Michael Pinedo, Guohua Wan |
Competitive Two-Agent Scheduling and Its Applications. |
Operations Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Byung-Cheon Choi, Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo |
Flow shops with machine maintenance: Ordered and proportionate cases. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yumei Huo, Joseph Y.-T. Leung |
Parallel machine scheduling with nested processing set restrictions. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Guohua Wan, Sudheer R. Vakati, Joseph Y.-T. Leung, Michael Pinedo |
Scheduling two agents with controllable processing times. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dirk Briskorn, Byung-Cheon Choi, Kangbok Lee, Joseph Y.-T. Leung, Michael Pinedo |
Complexity of single machine scheduling subject to nonnegative inventory constraints. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo |
Makespan minimization in online scheduling with machine eligibility. |
4OR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yumei Huo, Joseph Y.-T. Leung, Xin Wang |
Integrated production and delivery scheduling with disjoint windows. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yumei Huo, Joseph Y.-T. Leung, Xin Wang |
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions. |
Discrete Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo |
A note on graph balancing problems with restrictions. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kangbok 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kangbok 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kangbok Lee, Joseph Y.-T. Leung, Michael Pinedo |
Online scheduling on two uniform machines subject to eligibility constraints. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yumei Huo, Joseph Y.-T. Leung, Xin Wang |
Preemptive Scheduling Algorithms with Nested Processing Set restriction. |
Int. J. Found. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yumei Huo, Joseph Y.-T. Leung, Xin Wang |
Integrated Production and Delivery Scheduling with Disjoint Windows. |
COCOA |
2009 |
DBLP DOI BibTeX RDF |
Perishable goods, Parallel and identical machines, NP-hard and strong NP-hard, Fully polynomial time approximation schemes, Single machine |
| 1 | Yumei Huo, Joseph Y.-T. Leung, Xin Wang |
Online scheduling of equal-processing-time task systems. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Chung-Lun Li |
An asymptotic approximation scheme for the concave cost bin packing problem. |
European Journal of Operational Research |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Hairong Zhao |
Scheduling problems in master-slave model. |
Annals OR |
2008 |
DBLP DOI BibTeX RDF |
Master slave model, Approximation algorithms, NP-hard, Makespan, Total completion time |
| 1 | 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 |
2008 |
DBLP DOI BibTeX RDF |
Order scheduling, Total weighted completion time, Approximation algorithms, NP-hard |
| 1 | Xinfa Hu, Joseph Y.-T. Leung |
Testing Interval Trees for Real-Time Scheduling Systems. |
RTCSA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao |
Complexity of two dual criteria scheduling problems. |
Oper. Res. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Guohua Wan, Joseph Y.-T. Leung, Michael Pinedo |
Scheduling imprecise computation tasks on uniform processors. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Haibing Li, Hairong Zhao |
Scheduling Two-Machine Flow shops with Exact Delays. |
Int. J. Found. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Haibing Li, Michael Pinedo |
Scheduling orders for multiple product types to minimize total weighted completion time. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Haibing Li, Michael Pinedo |
Scheduling orders for multiple product types with due date related objectives. |
European Journal of Operational Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Hairong Zhao |
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems. |
IEEE Trans. Computers |
2006 |
DBLP DOI BibTeX RDF |
Sequence and scheduling, approximation algorithms, linear programming, makespan |
| 1 | Chung-Yee Lee, Joseph Y.-T. Leung, Gang Yu |
Two Machine Scheduling under Disruptions with Transportation Considerations. |
J. Scheduling |
2006 |
DBLP DOI BibTeX RDF |
transportation, machine scheduling, disruption |
| 1 | Teofilo F. Gonzalez, Joseph Y.-T. Leung, Michael Pinedo |
Minimizing total completion time on uniform machines with deadline constraints. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
Mean flow time, uniform machines, polynomial-time algorithms, deadline constraints |
| 1 | Yumei Huo, Joseph Y.-T. Leung |
Minimizing mean flow time for UET tasks. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
intrees, mean flow time, Scheduling, approximation algorithms, precedence constraints |
| 1 | Joseph Y.-T. Leung, Haibing Li, Michael Pinedo, Chelliah Sriskandarajah |
Open shops with jobs overlap - revisited. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Haibing Li, Michael Pinedo |
Order Scheduling in an Environment with Dedicated Resources in Parallel. |
J. Scheduling |
2005 |
DBLP DOI BibTeX RDF |
order scheduling, approximation, NP-hard, Tabu Search, total completion time |
| 1 | Joseph Y.-T. Leung, Hairong Zhao |
Minimizing mean flowtime and makespan on master-slave systems. |
J. Parallel Distrib. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yumei Huo, Joseph Y.-T. Leung |
Online Scheduling of Precedence Constrained Tasks. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung |
Improved Competitive Algorithms For Two-Processor Real-Time Systems. |
Int. J. Found. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Hairong Zhao |
Minimizing Mean Flowtime on Master-Slave Machines. |
PDPTA |
2004 |
DBLP BibTeX RDF |
|
| 1 | James M. Calvin, Joseph Y.-T. Leung |
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. |
Oper. Res. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jian Yang, Joseph Y.-T. Leung |
The Ordered Open-End Bin-Packing Problem. |
Operations Research |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Michael Pinedo |
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Chung W. Ng, Joseph Y.-T. Leung, Gilbert H. Young |
Heuristics for Generalized Task System. |
PDPTA |
2003 |
DBLP BibTeX RDF |
|
| 1 | Moshe Dror, Wieslaw Kubiak, Joseph Y.-T. Leung |
Tree Precedence in Scheduling: The Strong-Weak Distinction. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young |
Minimizing Mean Flow Time with Error Constraint. |
Algorithmica |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin I.-J. Ho, Joseph Y.-T. Leung, W.-D. Wei |
Scheduling Imprecise Computation Tasks with 0/1-constraint. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Tommy W. Tam, Gilbert H. Young |
On-Line Routing of Real-Time Messages. |
J. Parallel Distrib. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilbert H. Young, Joseph Y.-T. Leung, Xue-Jie Zhang |
Generalized Task System for Parallel Computation. |
PDPTA |
1996 |
DBLP BibTeX RDF |
|
| 1 | Dawei Hong, Joseph Y.-T. Leung |
Probabilistic Analysis of k-Dimensional Packing Algorithms. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, W.-D. Wei |
Tighter Bounds on a Heuristic for a Partition Problem. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunan Han, Dawei Hong, Joseph Y.-T. Leung |
On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem. |
INFORMS Journal on Computing |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Vincent K. M. Yu |
Heuristic for Minimizing the Number of Late Jobs on Two Processors. |
Int. J. Found. Comput. Sci. |
1994 |
DBLP BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Sunil M. Shende |
On Multidimensional Packet Routing for Meshes with Buses. |
J. Parallel Distrib. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin I.-J. Ho, Joseph Y.-T. Leung, W.-D. Wei |
Minimizing Maximum Weighted Error for Imprecise Computation Tasks. |
J. Algorithms |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Vincent K. M. Yu, W.-D. Wei |
Minimizing the Weighted Number of Tardy Task Units. |
Discrete Applied Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin I.-J. Ho, Joseph Y.-T. Leung, W.-D. Wei |
Complexity of Scheduling Tasks with Time-Dependent Execution Times. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, C. S. Wong |
Minimizing the Number of Late Tasks with Error Constraint |
Inf. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianzhong Du, Joseph Y.-T. Leung |
Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops. |
J. Algorithms |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianzhong Du, Joseph Y.-T. Leung |
Minimizing Mean Flow Time with Release Time and Deadline Constraints. |
J. Algorithms |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1992 |
DBLP BibTeX RDF |
|
| 1 | Kwang Soo Hong, Joseph Y.-T. Leung |
On-Line Scheduling of Real-Time Tasks. |
IEEE Trans. Computers |
1992 |
DBLP DOI BibTeX RDF |
scheduling, real-time systems, multiprocessing systems, online scheduling, real-time tasks |
| 1 | Kwang Soo Hong, Joseph Y.-T. Leung |
Some Results on Liu's Conjecture. |
SIAM J. Discrete Math. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianzhong Du, Joseph Y.-T. Leung, Gilbert H. Young |
Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time |
Inf. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Sunil M. Shende |
Packet routing on square meshes with row and column buses. |
SPDP |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Gilbert H. Young |
Preemptive Scheduling to Minimize Mean Weighted Flow Time. |
Inf. Process. Lett. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianzhong Du, Joseph Y.-T. Leung, Gilbert H. Young |
Minimizing Mean Flow Time with Release Time Constraint. |
Theor. Comput. Sci. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Gilbert H. Young |
Minimizing Total Tardiness on a Single Machine with Precedence Constraints. |
INFORMS Journal on Computing |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, C. S. Wong |
Minimizing the Number of Late Tasks with Error Constraint. |
IEEE Real-Time Systems Symposium |
1990 |
DBLP BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Tommy W. Tam, Gilbert H. Young |
On-Line Routing of Real-Time Messages. |
IEEE Real-Time Systems Symposium |
1990 |
DBLP BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung |
Bin Packing with Restricted Piece Sizes. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung |
A New Algorithm for Scheduling Periodic Real-Time Tasks. |
Algorithmica |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Kwang Soo Hong, Joseph Y.-T. Leung |
Preemptive Scheduling with Release Times and Deadlines. |
Real-Time Systems |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianzhong Du, Joseph Y.-T. Leung |
Complexity of Scheduling Parallel Task Systems. |
SIAM J. Discrete Math. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianzhong Du, Joseph Y.-T. Leung |
Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length. |
SIAM J. Discrete Math. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Gilbert H. Young |
Minimizing Schedule Length Subject to Minimum Flow Time. |
SIAM J. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Jianzhong Du, Joseph Y.-T. Leung |
Scheduling Tree-Structured Tasks with Restricted Execution Times. |
Inf. Process. Lett. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Kwang Soo Hong, Joseph Y.-T. Leung |
On-Line Scheduling of Real-Time Tasks. |
IEEE Real-Time Systems Symposium |
1988 |
DBLP BibTeX RDF |
|
| 1 | Jianzhong Du, Joseph Y.-T. Leung |
Minimizing Mean Flow Time with Release Time and Deadline Constraints. |
IEEE Real-Time Systems Symposium |
1988 |
DBLP BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Burkhard Monien |
On the Complexity of Deadlock Recovery. |
STACS |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | D. T. Lee, Joseph Y.-T. Leung |
On the 2-Dimensional Channel Assignment Problem. |
IEEE Trans. Computers |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung |
Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs. |
J. Algorithms |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Oliver Vornberger, James D. Witthoff |
On Some Variants of the Bandwidth Minimization Problem. |
SIAM J. Comput. |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, Jennifer Whitehead |
On the complexity of fixed-priority scheduling of periodic, real-time tasks. |
Perform. Eval. |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung, M. L. Merrill |
A Note on Preemptive Scheduling of Periodic, Real-Time Tasks. |
Inf. Process. Lett. |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Y.-T. Leung |
Bounds on List Scheduling of UET Tasks with Restricted Resource Constraints. |
Inf. Process. Lett. |
1979 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")