Joseph Y.-T. Leung

160 papers A* 1A 6B 2C 1Misc 3Journal 134Unranked 1
YearRankTypeTitle / Venue / Authors
2019 J jnl
An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times.
Eng. Appl. Artif. Intell.
José Elias C. Arroyo, Joseph Y.-T. Leung, Ricardo Gonçalves Tavares
2019 J jnl
Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities.
Appl. Soft Comput.
Zhao-hong Jia, Jianhai Yan, Joseph Y.-T. Leung, Kai Li, Huaping Chen
2019 J jnl
Corrigendum to "Integrated production and transportation on parallel batch machines to minimize total weighted delivery time" [Computers and Operations Research Volume 102, pages 39-51].
Comput. Oper. Res.
Zhao-hong Jia, Xue-Xue Zhuo, Joseph Y.-T. Leung, Kai Li
2019 J jnl
Integrated optimization of material supplying, manufacturing, and product distribution: Models and fast algorithms.
Eur. J. Oper. Res.
Bayi Cheng, Joseph Y.-T. Leung, Kai Li, Shanlin Yang
2019 J jnl
Integrated production and transportation on parallel batch machines to minimize total weighted delivery time.
Comput. Oper. Res.
Zhao-hong Jia, Xue-Xue Zhuo, Joseph Y.-T. Leung, Kai Li
2018 J jnl
A meta-heuristic for minimizing total weighted flow time on parallel batch machines.
Comput. Ind. Eng.
Zhao-hong Jia, Han Zhang, Wen-tao Long, Joseph Y.-T. Leung, Kai Li, Wei Li
2018 J jnl
Integrated bacteria foraging algorithm for cellular manufacturing in supply chain considering facility transfer and production planning.
Appl. Soft Comput.
Chunfeng Liu, Jufeng Wang, Joseph Y.-T. Leung
2017 J jnl
A multi-objective model for multi-project scheduling and multi-skilled staff assignment for IT product development considering competency evolution.
Int. J. Prod. Res.
Rong Chen, Changyong Liang, Dongxiao Gu, Joseph Y.-T. Leung
2017 J jnl
An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times.
Comput. Ind. Eng.
José Elías C. Arroyo, Joseph Y.-T. Leung
2017 J jnl
Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines.
Appl. Soft Comput.
Zhao-hong Jia, Yu-lan Zhang, Joseph Y.-T. Leung, Kai Li
2017 J jnl
Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine.
Eur. J. Oper. Res.
Lixin Tang, Xiaoli Zhao, Jiyin Liu, Joseph Y.-T. Leung
2017 J jnl
Fast approximation algorithms for uniform machine scheduling with processing set restrictions.
Eur. J. Oper. Res.
Joseph Y.-T. Leung, C. T. Ng
2017 J jnl
Integrated scheduling on a batch machine to minimize production, inventory and distribution costs.
Eur. J. Oper. Res.
Bayi Cheng, Joseph Y.-T. Leung, Kai Li
2017 J jnl
Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities.
Future Gener. Comput. Syst.
Zhao-hong Jia, Xiaohao Li, Joseph Y.-T. Leung
2017 J jnl
Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights.
Int. J. Syst. Sci.
Zhao-hong Jia, Ming-li Pei, Joseph Y.-T. Leung
2017 J jnl
Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times.
Comput. Oper. Res.
José Elías C. Arroyo, Joseph Y.-T. Leung
2017 J jnl
Two-agent scheduling of time-dependent jobs.
J. Comb. Optim.
Cheng He, Joseph Y.-T. Leung
2017 J jnl
Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes.
Eur. J. Oper. Res.
Jun-Qiang Wang, Guo-Qiang Fan, Yingqian Zhang, Cheng-Wu Zhang, Joseph Y.-T. Leung
2016 J jnl
An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families.
Appl. Soft Comput.
Zhao-hong Jia, Chao Wang, Joseph Y.-T. Leung
2016 J jnl
An improved binary search algorithm for the Multiple-Choice Knapsack Problem.
RAIRO Oper. Res.
Cheng He, Joseph Y.-T. Leung, Kangbok Lee, Michael L. Pinedo
2016 J jnl
Improved algorithms for single machine scheduling with release dates and rejections.
4OR
Cheng He, Joseph Y.-T. Leung, Kangbok Lee, Michael L. Pinedo
2016 J jnl
Integrated production and delivery with single machine and multiple vehicles.
Expert Syst. Appl.
Kai Li, Chao Zhou, Joseph Y.-T. Leung, Ying Ma
2016 J jnl
Multitasking via alternate and shared processing: Algorithms and complexity.
Discret. Appl. Math.
Nicholas G. Hall, Joseph Y.-T. Leung, Chung-Lun Li
2016 J jnl
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost.
Discret. Appl. Math.
Cheng He, Joseph Y.-T. Leung, Kangbok Lee, Michael L. Pinedo
2016 J jnl
Worker assignment and production planning with learning and forgetting in manufacturing cells by hybrid bacteria foraging algorithm.
Comput. Ind. Eng.
Chunfeng Liu, Jufeng Wang, Joseph Y.-T. Leung
2015 J jnl
A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes.
Eur. J. Oper. Res.
Zhao-hong Jia, Joseph Y.-T. Leung
2015 J jnl
Integrated production and delivery on parallel batching machines.
Eur. J. Oper. Res.
Kai Li, Zhao-hong Jia, Joseph Y.-T. Leung
2015 J jnl
Integrated scheduling of production and distribution to minimize total cost using an improved ant colony optimization method.
Comput. Ind. Eng.
Bayi Cheng, Joseph Y.-T. Leung, Kai Li
2014 J jnl
An agent-based intelligent algorithm for uniform machine scheduling to minimize total completion time.
Appl. Soft Comput.
Kai Li, Joseph Y.-T. Leung, Bayi Cheng
2014 J jnl
An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes.
Comput. Oper. Res.
Zhao-hong Jia, Joseph Y.-T. Leung
2014 J jnl
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs.
Eur. J. Oper. Res.
Kangbok Lee, Joseph Y.-T. Leung, Zhao-hong Jia, Wenhua Li, Michael L. Pinedo, Bertrand M. T. Lin
2014 J jnl
Two dimensional load balancing.
Oper. Res. Lett.
Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo
2013 J jnl
Integrated production and distribution with fixed delivery departure dates.
Oper. Res. Lett.
Joseph Y.-T. Leung, Zhi-Long Chen
2013 J jnl
Makespan minimization in online scheduling with machine eligibility.
Ann. Oper. Res.
Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo
2013 J jnl
Minimizing maximum lateness of jobs in inventory constrained scheduling.
J. Oper. Res. Soc.
Dirk Briskorn, Joseph Y.-T. Leung
2012 J jnl
Berth allocation with time-dependent physical limitations on vessels.
Eur. J. Oper. Res.
Dongsheng Xu, Chung-Lun Li, Joseph Y.-T. Leung
2012 J jnl
Coordination mechanisms for parallel machine scheduling.
Eur. J. Oper. Res.
Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo
2011 J jnl
Coordination mechanisms with hybrid local policies.
Discret. Optim.
Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo
2011 J jnl
Exploring the Interplay between Computation and Communication in Distributed Real-Time Scheduling.
IEEE Trans. Computers
Xinfa Hu, Guoliang Xing, Joseph Y.-T. Leung
2011 J jnl
Minimizing makespan in an ordered flow shop with machine-dependent processing times.
J. Comb. Optim.
Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo
2011 J jnl
Scheduling jobs with equal processing times subject to machine eligibility constraints.
J. Sched.
Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo
2010 J jnl
A note on makespan minimization in proportionate flow shops.
Inf. Process. Lett.
Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo
2010 J jnl
Competitive Two-Agent Scheduling and Its Applications.
Oper. Res.
Joseph Y.-T. Leung, Michael L. Pinedo, Guohua Wan
2010 J jnl
Complexity of a scheduling problem with controllable processing times.
Oper. Res. Lett.
Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo
2010 J jnl
Complexity of single machine scheduling subject to nonnegative inventory constraints.
Eur. J. Oper. Res.
Dirk Briskorn, Byung-Cheon Choi, Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo
2010 J jnl
Fast approximation algorithms for job scheduling with processing set restrictions.
Theor. Comput. Sci.
Yumei Huo, Joseph Y.-T. Leung
2010 J jnl
Flow shops with machine maintenance: Ordered and proportionate cases.
Eur. J. Oper. Res.
Byung-Cheon Choi, Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo
2010 J jnl
Integrated production and delivery scheduling with disjoint windows.
Discret. Appl. Math.
Yumei Huo, Joseph Y.-T. Leung, Xin Wang
2010 J jnl
Makespan minimization in online scheduling with machine eligibility.
4OR
Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo
2010 J jnl
Parallel machine scheduling with nested processing set restrictions.
Eur. J. Oper. Res.
Yumei Huo, Joseph Y.-T. Leung
2010 J jnl
Scheduling two agents with controllable processing times.
Eur. J. Oper. Res.
Guohua Wan, Sudheer R. Vakati, Joseph Y.-T. Leung, Michael L. Pinedo
2009 J jnl
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions.
Discret. Optim.
Yumei Huo, Joseph Y.-T. Leung, Xin Wang
2009 J jnl
A note on "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs".
Inf. Process. Lett.
Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo
2009 J jnl
A note on graph balancing problems with restrictions.
Inf. Process. Lett.
Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo
2009 J jnl
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time.
Inf. Process. Lett.
Kangbok Lee, Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo
2009 C conf
Integrated Production and Delivery Scheduling with Disjoint Windows.
COCOA
Yumei Huo, Joseph Y.-T. Leung, Xin Wang
2009 J jnl
Online scheduling on two uniform machines subject to eligibility constraints.
Theor. Comput. Sci.
Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo
2009 J jnl
Preemptive Scheduling Algorithms with Nested Processing Set restriction.
Int. J. Found. Comput. Sci.
Yumei Huo, Joseph Y.-T. Leung, Xin Wang
2008 J jnl
An asymptotic approximation scheme for the concave cost bin packing problem.
Eur. J. Oper. Res.
Joseph Y.-T. Leung, Chung-Lun Li
2008 B conf
Integrating Communication Cost into the Utility Accrual Model for the Resource Allocation in Distributed Real-Time Systems.
RTCSA
Xinfa Hu, Joseph Y.-T. Leung
2008 J jnl
Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times.
Eur. J. Oper. Res.
Joseph Y.-T. Leung, C. T. Ng, T. C. Edwin Cheng
2008 J jnl
Online scheduling of equal-processing-time task systems.
Theor. Comput. Sci.
Yumei Huo, Joseph Y.-T. Leung, Xin Wang
2008 J jnl
Preemptive multiprocessor order scheduling to minimize total weighted flowtime.
Eur. J. Oper. Res.
Joseph Y.-T. Leung, Chung-Yee Lee, Chung W. Ng, Gilbert H. Young
2008 J jnl
Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time.
Ann. Oper. Res.
Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo
2008 J jnl
Scheduling problems in master-slave model.
Ann. Oper. Res.
Joseph Y.-T. Leung, Hairong Zhao
2008 B conf
Testing Interval Trees for Real-Time Scheduling Systems.
RTCSA
Xinfa Hu, Joseph Y.-T. Leung
2007 — ch.
Approximation Algorithms for Imprecise Computation Tasks with 0/1 Constraint.
Handbook of Approximation Algorithms and Metaheuristics
Joseph Y.-T. Leung
2007 J jnl
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness.
Eur. J. Oper. Res.
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao
2007 J jnl
Complexity of two dual criteria scheduling problems.
Oper. Res. Lett.
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao
2007 — book
Handbook of Real-Time and Embedded Systems.
Sang Hyuk Son, Insup Lee, Joseph Y.-T. Leung
2007 — ch.
Imprecise Computation Model.
Handbook of Real-Time and Embedded Systems
Joseph Y.-T. Leung
2007 — ch.
Imprecise Computation Model.
Handbook of Real-Time and Embedded Systems
Joseph Y.-T. Leung
2007 — ch.
Introduction and Overview.
Handbook of Real-Time and Embedded Systems
Insup Lee, Joseph Y.-T. Leung, Sang Hyuk Son
2007 J jnl
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines.
Inf. Process. Lett.
Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo, Jiawei Zhang
2007 J jnl
Scheduling Two-Machine Flow shops with Exact Delays.
Int. J. Found. Comput. Sci.
Joseph Y.-T. Leung, Haibing Li, Hairong Zhao
2007 J jnl
Scheduling imprecise computation tasks on uniform processors.
Inf. Process. Lett.
Guohua Wan, Joseph Y.-T. Leung, Michael L. Pinedo
2007 J jnl
Scheduling orders for multiple product types to minimize total weighted completion time.
Discret. Appl. Math.
Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo
2007 — ch.
Variable-Sized Bin Packing and Bin Covering.
Handbook of Approximation Algorithms and Metaheuristics
Edward G. Coffman Jr., Joseph Y.-T. Leung, János Csirik
2007 — ch.
Variants of Classical One-Dimensional Bin Packing.
Handbook of Approximation Algorithms and Metaheuristics
Edward G. Coffman Jr., Joseph Y.-T. Leung, János Csirik
2006 J jnl
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems.
IEEE Trans. Computers
Joseph Y.-T. Leung, Hairong Zhao
2006 J jnl
Minimizing mean flow time for UET tasks.
ACM Trans. Algorithms
Yumei Huo, Joseph Y.-T. Leung
2006 J jnl
Minimizing total completion time on uniform machines with deadline constraints.
ACM Trans. Algorithms
Teofilo F. Gonzalez, Joseph Y.-T. Leung, Michael L. Pinedo
2006 J jnl
Scheduling orders for multiple product types with due date related objectives.
Eur. J. Oper. Res.
Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo
2006 J jnl
Two Machine Scheduling under Disruptions with Transportation Considerations.
J. Sched.
Chung-Yee Lee, Joseph Y.-T. Leung, Gang Yu
2005 J jnl
Minimizing mean flowtime and makespan on master-slave systems.
J. Parallel Distributed Comput.
Joseph Y.-T. Leung, Hairong Zhao
2005 J jnl
Minimizing total completion time for UET tasks with release time and outtree precedence constraints.
Math. Methods Oper. Res.
Yumei Huo, Joseph Y.-T. Leung
2005 J jnl
Online Scheduling of Precedence Constrained Tasks.
SIAM J. Comput.
Yumei Huo, Joseph Y.-T. Leung
2005 J jnl
Open shops with jobs overlap - revisited.
Eur. J. Oper. Res.
Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo, Chelliah Sriskandarajah
2005 J jnl
Order Scheduling in an Environment with Dedicated Resources in Parallel.
J. Sched.
Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo
2004 J jnl
A Dual Criteria Preemptive Scheduling Problem For Minimax Error Of Imprecise Computation Tasks.
Int. J. Found. Comput. Sci.
Kevin I.-J. Ho, Joseph Y.-T. Leung
2004 — ch.
A Tutorial on Complexity.
Handbook of Scheduling
Joseph Y.-T. Leung
2004 — book
Handbook of Scheduling - Algorithms, Models, and Performance Analysis.
Joseph Y.-T. Leung
2004 J jnl
Improved Competitive Algorithms For Two-Processor Real-Time Systems.
Int. J. Found. Comput. Sci.
Joseph Y.-T. Leung
2004 — ch.
Introduction and Notation.
Handbook of Scheduling
Joseph Y.-T. Leung
2004 Misc conf
Minimizing Mean Flowtime on Master-Slave Machines.
PDPTA
Joseph Y.-T. Leung, Hairong Zhao
2004 — ch.
Minimizing TotalWeighted Error for Imprecise Computation Tasks and Related Problems.
Handbook of Scheduling
Joseph Y.-T. Leung
2004 — ch.
Some Basic Scheduling Algorithms.
Handbook of Scheduling
Joseph Y.-T. Leung
2003 J jnl
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.
Oper. Res. Lett.
James M. Calvin, Joseph Y.-T. Leung
2003 Misc conf
Heuristics for Generalized Task System.
PDPTA
Chung W. Ng, Joseph Y.-T. Leung, Gilbert H. Young
2003 J jnl
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints.
SIAM J. Comput.
Joseph Y.-T. Leung, Michael L. Pinedo
2003 J jnl
The Ordered Open-End Bin-Packing Problem.
Oper. Res.
Jian Yang, Joseph Y.-T. Leung
1999 J jnl
Tree Precedence in Scheduling: The Strong-Weak Distinction.
Inf. Process. Lett.
Moshe Dror, Wieslaw Kubiak, Joseph Y.-T. Leung
1998 J jnl
Minimizing Mean Flow Time with Error Constraint.
Algorithmica
Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young
1997 J jnl
Scheduling Imprecise Computation Tasks with 0/1-constraint.
Discret. Appl. Math.
Kevin I.-J. Ho, Joseph Y.-T. Leung, W.-D. Wei
1996 Misc conf
Generalized Task System for Parallel Computation.
PDPTA
Gilbert H. Young, Joseph Y.-T. Leung, Xue-Jie Zhang
1996 J jnl
On-Line Routing of Real-Time Messages.
J. Parallel Distributed Comput.
Joseph Y.-T. Leung, Tommy W. Tam, Gilbert H. Young
1996 J jnl
Probabilistic analysis of a bin covering algorithm.
Oper. Res. Lett.
Sunan Han, Dawei Hong, Joseph Y.-T. Leung
1995 J jnl
On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem.
INFORMS J. Comput.
Sunan Han, Dawei Hong, Joseph Y.-T. Leung
1995 J jnl
Probabilistic Analysis of k-Dimensional Packing Algorithms.
Inf. Process. Lett.
Dawei Hong, Joseph Y.-T. Leung
1995 J jnl
Routing Messages with Release Time and Deadline Constraint.
J. Parallel Distributed Comput.
Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young
1995 J jnl
Some properties of nonnegative integral matrices.
Ars Comb.
Joseph Y.-T. Leung, W.-D. Wei
1995 J jnl
Tighter Bounds on a Heuristic for a Partition Problem.
Inf. Process. Lett.
Joseph Y.-T. Leung, W.-D. Wei
1994 J jnl
Heuristic for Minimizing the Number of Late Jobs on Two Processors.
Int. J. Found. Comput. Sci.
Joseph Y.-T. Leung, Vincent K. M. Yu
1994 J jnl
Minimizing Maximum Weighted Error for Imprecise Computation Tasks.
J. Algorithms
Kevin I.-J. Ho, Joseph Y.-T. Leung, W.-D. Wei
1994 J jnl
Minimizing the Weighted Number of Tardy Task Units.
Discret. Appl. Math.
Joseph Y.-T. Leung, Vincent K. M. Yu, W.-D. Wei
1994 J jnl
On Multidimensional Packet Routing for Meshes with Buses.
J. Parallel Distributed Comput.
Joseph Y.-T. Leung, Sunil M. Shende
1993 J jnl
Complexity of Scheduling Tasks with Time-Dependent Execution Times.
Inf. Process. Lett.
Kevin I.-J. Ho, Joseph Y.-T. Leung, W.-D. Wei
1993 J jnl
Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops.
J. Algorithms
Jianzhong Du, Joseph Y.-T. Leung
1993 J jnl
Minimizing Mean Flow Time with Release Time and Deadline Constraints.
J. Algorithms
Jianzhong Du, Joseph Y.-T. Leung
1993 J jnl
Minimizing the Number of Late Tasks with Error Constraint
Inf. Comput.
Joseph Y.-T. Leung, C. S. Wong
1992 J jnl
A Comparison Theorem for Permanents and a Proof of a Conjecture on (t, m)-Families.
J. Comb. Theory A
Joseph Y.-T. Leung, W.-D. Wei
1992 J jnl
On-Line Scheduling of Real-Time Tasks.
IEEE Trans. Computers
Kwang Soo Hong, Joseph Y.-T. Leung
1992 J jnl
Some Results on Liu's Conjecture.
SIAM J. Discret. Math.
Kwang Soo Hong, Joseph Y.-T. Leung
1991 J jnl
Minimizing the number of late jobs on unrelated machines.
Oper. Res. Lett.
Jianzhong Du, Joseph Y.-T. Leung
1991 — conf
Packet routing on square meshes with row and column buses.
SPDP
Joseph Y.-T. Leung, Sunil M. Shende
1991 J jnl
Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time
Inf. Comput.
Jianzhong Du, Joseph Y.-T. Leung, Gilbert H. Young
1990 J jnl
Minimizing Mean Flow Time with Release Time Constraint.
Theor. Comput. Sci.
Jianzhong Du, Joseph Y.-T. Leung, Gilbert H. Young
1990 J jnl
Minimizing Total Tardiness on One Machine is NP-Hard.
Math. Oper. Res.
Jianzhong Du, Joseph Y.-T. Leung
1990 J jnl
Minimizing Total Tardiness on a Single Machine with Precedence Constraints.
INFORMS J. Comput.
Joseph Y.-T. Leung, Gilbert H. Young
1990 A conf
Minimizing the Number of Late Tasks with Error Constraint.
RTSS
Joseph Y.-T. Leung, C. S. Wong
1990 A conf
On-Line Routing of Real-Time Messages.
RTSS
Joseph Y.-T. Leung, Tommy W. Tam, Gilbert H. Young
1990 J jnl
Packing Squares into a Square.
J. Parallel Distributed Comput.
Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young, Francis Y. L. Chin
1990 J jnl
Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time.
Oper. Res.
Lee A. Herrbach, Joseph Y.-T. Leung
1990 J jnl
Preemptive Scheduling to Minimize Mean Weighted Flow Time.
Inf. Process. Lett.
Joseph Y.-T. Leung, Gilbert H. Young
1989 J jnl
A New Algorithm for Scheduling Periodic Real-Time Tasks.
Algorithmica
Joseph Y.-T. Leung
1989 J jnl
Bin Packing with Restricted Piece Sizes.
Inf. Process. Lett.
Joseph Y.-T. Leung
1989 J jnl
Complexity of Scheduling Parallel Task Systems.
SIAM J. Discret. Math.
Jianzhong Du, Joseph Y.-T. Leung
1989 A conf
Minimizing Mean Flow Time with Error Constraint.
RTSS
Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Wong
1989 J jnl
Minimizing Schedule Length Subject to Minimum Flow Time.
SIAM J. Comput.
Joseph Y.-T. Leung, Gilbert H. Young
1989 J jnl
Preemptive Scheduling with Release Times and Deadlines.
Real Time Syst.
Kwang Soo Hong, Joseph Y.-T. Leung
1989 J jnl
Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length.
SIAM J. Discret. Math.
Jianzhong Du, Joseph Y.-T. Leung
1988 A conf
Minimizing Mean Flow Time with Release Time and Deadline Constraints.
RTSS
Jianzhong Du, Joseph Y.-T. Leung
1988 A conf
On-Line Scheduling of Real-Time Tasks.
RTSS
Kwang Soo Hong, Joseph Y.-T. Leung
1988 J jnl
Scheduling Tree-Structured Tasks with Restricted Execution Times.
Inf. Process. Lett.
Jianzhong Du, Joseph Y.-T. Leung
1985 A conf
On the Complexity of Deadlock Recovery.
STACS
Joseph Y.-T. Leung, Burkhard Monien
1984 J jnl
Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs.
J. Algorithms
Joseph Y.-T. Leung
1984 J jnl
On Some Variants of the Bandwidth Minimization Problem.
SIAM J. Comput.
Joseph Y.-T. Leung, Oliver Vornberger, James D. Witthoff
1984 J jnl
On a Dual Version of the One-Dimensional Bin Packing Problem.
J. Algorithms
Susan F. Assmann, David S. Johnson, Daniel J. Kleitman, Joseph Y.-T. Leung
1984 J jnl
On the 2-Dimensional Channel Assignment Problem.
IEEE Trans. Computers
D. T. Lee, Joseph Y.-T. Leung
1982 J jnl
Efficient algorithms for interval graphs and circular-arc graphs.
Networks
Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung
1982 J jnl
On Scheduling Independent Tasks with Restricted Execution Times.
Oper. Res.
Joseph Y.-T. Leung
1982 J jnl
On the complexity of fixed-priority scheduling of periodic, real-time tasks.
Perform. Evaluation
Joseph Y.-T. Leung, Jennifer Whitehead
1981 J jnl
Record Allocation for Minimizing Seek Delay.
Theor. Comput. Sci.
Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung, J. W. Pruitt, C. K. Wong
1980 J jnl
A Note on Preemptive Scheduling of Periodic, Real-Time Tasks.
Inf. Process. Lett.
Joseph Y.-T. Leung, M. L. Merrill
1979 J jnl
An Optimal Solution for the Channel-Assignment Problem.
IEEE Trans. Computers
Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung
1979 J jnl
Bounds on List Scheduling of UET Tasks with Restricted Resource Constraints.
Inf. Process. Lett.
Joseph Y.-T. Leung
1979 J jnl
Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation.
SIAM J. Comput.
Edward G. Coffman Jr., Joseph Y.-T. Leung
1979 J jnl
On Minimum Cost Recovery from System Deadlock.
IEEE Trans. Computers
Joseph Y.-T. Leung, Edmund K. Lai
1978 J jnl
Bin Packing: Maximizing the Number of Pieces Packed.
Acta Informatica
Edward G. Coffman Jr., Joseph Y.-T. Leung, D. W. Ting
1977 A* conf
Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
FOCS
Edward G. Coffman Jr., Joseph Y.-T. Leung