Bin Packing: Maximizing the Number of Pieces Packed. - Edward G. Coffman Jr.; Joseph Y.-T. Leung; D. W. Ting (Acta Informatica, 1978)

Bounds on List Scheduling of UET Tasks with Restricted Resource Constraints. - Joseph Y.-T. Leung (Inf. Process. Lett., 1979)

Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation. - Edward G. Coffman Jr.; Joseph Y.-T. Leung (SIAM J. Comput., 1979)

An Optimal Solution for the Channel-Assignment Problem. - Udaiprakash I. Gupta; D. T. Lee; Joseph Y.-T. Leung (IEEE Trans. Computers, 1979)

On Minimum Cost Recovery from System Deadlock. - Joseph Y.-T. Leung; Edmund K. Lai (IEEE Trans. Computers, 1979)

A Note on Preemptive Scheduling of Periodic, Real-Time Tasks. - Joseph Y.-T. Leung; M. L. Merrill (Inf. Process. Lett., 1980)

Record Allocation for Minimizing Seek Delay. - Udaiprakash I. Gupta; D. T. Lee; Joseph Y.-T. Leung; J. W. Pruitt; C. K. Wong (Theor. Comput. Sci., 1981)

On Scheduling Independent Tasks with Restricted Execution Times. - Joseph Y.-T. Leung (Oper. Res., 1982)

Efficient algorithms for interval graphs and circular-arc graphs. - Udaiprakash I. Gupta; D. T. Lee; Joseph Y.-T. Leung (Networks, 1982)

On the complexity of fixed-priority scheduling of periodic, real-time tasks. - Joseph Y.-T. Leung; Jennifer Whitehead (Perform. Evaluation, 1982)

On a Dual Version of the One-Dimensional Bin Packing Problem. - Susan F. Assmann; David S. Johnson 001; Daniel J. Kleitman; Joseph Y.-T. Leung (J. Algorithms, 1984)

Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs. - Joseph Y.-T. Leung (J. Algorithms, 1984)

On Some Variants of the Bandwidth Minimization Problem. - Joseph Y.-T. Leung; Oliver Vornberger; James D. Witthoff (SIAM J. Comput., 1984)

On the 2-Dimensional Channel Assignment Problem. - D. T. Lee; Joseph Y.-T. Leung (IEEE Trans. Computers, 1984)

On the Complexity of Deadlock Recovery. - Joseph Y.-T. Leung; Burkhard Monien (STACS, 1985)

Scheduling Tree-Structured Tasks with Restricted Execution Times. - Jianzhong Du; Joseph Y.-T. Leung (Inf. Process. Lett., 1988)

Minimizing Mean Flow Time with Error Constraint. - Joseph Y.-T. Leung; Tommy W. Tam; C. S. Wong; Gilbert H. Wong (RTSS, 1989)

A New Algorithm for Scheduling Periodic Real-Time Tasks. - Joseph Y.-T. Leung (Algorithmica, 1989)

Bin Packing with Restricted Piece Sizes. - Joseph Y.-T. Leung (Inf. Process. Lett., 1989)

Preemptive Scheduling with Release Times and Deadlines. - Kwang Soo Hong; Joseph Y.-T. Leung (Real Time Syst., 1989)

Minimizing Schedule Length Subject to Minimum Flow Time. - Joseph Y.-T. Leung; Gilbert H. Young (SIAM J. Comput., 1989)

Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length. - Jianzhong Du; Joseph Y.-T. Leung (SIAM J. Discret. Math., 1989)

Complexity of Scheduling Parallel Task Systems. - Jianzhong Du; Joseph Y.-T. Leung (SIAM J. Discret. Math., 1989)

Minimizing Total Tardiness on a Single Machine with Precedence Constraints. - Joseph Y.-T. Leung; Gilbert H. Young (INFORMS J. Comput., 1990)

Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time. - Lee A. Herrbach; Joseph Y.-T. Leung (Oper. Res., 1990)

Preemptive Scheduling to Minimize Mean Weighted Flow Time. - Joseph Y.-T. Leung; Gilbert H. Young (Inf. Process. Lett., 1990)

Packing Squares into a Square. - Joseph Y.-T. Leung; Tommy W. Tam; C. S. Wong; Gilbert H. Young; Francis Y. L. Chin (J. Parallel Distributed Comput., 1990)

Minimizing Total Tardiness on One Machine is NP-Hard. - Jianzhong Du; Joseph Y.-T. Leung (Math. Oper. Res., 1990)

Minimizing Mean Flow Time with Release Time Constraint. - Jianzhong Du; Joseph Y.-T. Leung; Gilbert H. Young (Theor. Comput. Sci., 1990)

Packet routing on square meshes with row and column buses. - Joseph Y.-T. Leung; Sunil M. Shende (SPDP, 1991)

Minimizing the number of late jobs on unrelated machines. - Jianzhong Du; Joseph Y.-T. Leung (Oper. Res. Lett., 1991)

Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time - Jianzhong Du; Joseph Y.-T. Leung; Gilbert H. Young (Inf. Comput., 1991)

A Comparison Theorem for Permanents and a Proof of a Conjecture on (t, m)-Families. - Joseph Y.-T. Leung; W.-D. Wei (J. Comb. Theory A, 1992)

Some Results on Liu's Conjecture. - Kwang Soo Hong; Joseph Y.-T. Leung (SIAM J. Discret. Math., 1992)

On-Line Scheduling of Real-Time Tasks. - Kwang Soo Hong; Joseph Y.-T. Leung (IEEE Trans. Computers, 1992)

Complexity of Scheduling Tasks with Time-Dependent Execution Times. - Kevin I.-J. Ho; Joseph Y.-T. Leung; W.-D. Wei (Inf. Process. Lett., 1993)

Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops. - Jianzhong Du; Joseph Y.-T. Leung (J. Algorithms, 1993)

Minimizing Mean Flow Time with Release Time and Deadline Constraints. - Jianzhong Du; Joseph Y.-T. Leung (J. Algorithms, 1993)

Minimizing the Number of Late Tasks with Error Constraint - Joseph Y.-T. Leung; C. S. Wong (Inf. Comput., 1993)

Minimizing the Weighted Number of Tardy Task Units. - Joseph Y.-T. Leung; Vincent K. M. Yu; W.-D. Wei (Discret. Appl. Math., 1994)

Heuristic for Minimizing the Number of Late Jobs on Two Processors. - Joseph Y.-T. Leung; Vincent K. M. Yu (Int. J. Found. Comput. Sci., 1994)

Minimizing Maximum Weighted Error for Imprecise Computation Tasks. - Kevin I.-J. Ho; Joseph Y.-T. Leung; W.-D. Wei (J. Algorithms, 1994)

On Multidimensional Packet Routing for Meshes with Buses. - Joseph Y.-T. Leung; Sunil M. Shende (J. Parallel Distributed Comput., 1994)

Some properties of nonnegative integral matrices. - Joseph Y.-T. Leung; W.-D. Wei (Ars Comb., 1995)

On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem. - Sunan Han; Dawei Hong; Joseph Y.-T. Leung (INFORMS J. Comput., 1995)

Probabilistic Analysis of k-Dimensional Packing Algorithms. - Dawei Hong; Joseph Y.-T. Leung (Inf. Process. Lett., 1995)

Tighter Bounds on a Heuristic for a Partition Problem. - Joseph Y.-T. Leung; W.-D. Wei (Inf. Process. Lett., 1995)

Routing Messages with Release Time and Deadline Constraint. - Joseph Y.-T. Leung; Tommy W. Tam; C. S. Wong; Gilbert H. Young (J. Parallel Distributed Comput., 1995)

Generalized Task System for Parallel Computation. - Gilbert H. Young; Joseph Y.-T. Leung; Xue-Jie Zhang (PDPTA, 1996)

On-Line Routing of Real-Time Messages. - Joseph Y.-T. Leung; Tommy W. Tam; Gilbert H. Young (J. Parallel Distributed Comput., 1996)

Probabilistic analysis of a bin covering algorithm. - Sunan Han; Dawei Hong; Joseph Y.-T. Leung (Oper. Res. Lett., 1996)

Scheduling Imprecise Computation Tasks with 0/1-constraint. - Kevin I.-J. Ho; Joseph Y.-T. Leung; W.-D. Wei (Discret. Appl. Math., 1997)

Minimizing Mean Flow Time with Error Constraint. - Joseph Y.-T. Leung; Tommy W. Tam; C. S. Wong; Gilbert H. Young (Algorithmica, 1998)

Tree Precedence in Scheduling: The Strong-Weak Distinction. - Moshe Dror; Wieslaw Kubiak; Joseph Y.-T. Leung (Inf. Process. Lett., 1999)

Heuristics for Generalized Task System. - Chung W. Ng; Joseph Y.-T. Leung; Gilbert H. Young (PDPTA, 2003)

The Ordered Open-End Bin-Packing Problem. - Jian Yang; Joseph Y.-T. Leung (Oper. Res., 2003)

Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. - James M. Calvin; Joseph Y.-T. Leung (Oper. Res. Lett., 2003)

Minimizing Total Completion Time on Parallel Machines with Deadline Constraints. - Joseph Y.-T. Leung; Michael L. Pinedo (SIAM J. Comput., 2003)

Minimizing Mean Flowtime on Master-Slave Machines. - Joseph Y.-T. Leung; Hairong Zhao (PDPTA, 2004)

A Dual Criteria Preemptive Scheduling Problem For Minimax Error Of Imprecise Computation Tasks. - Kevin I.-J. Ho; Joseph Y.-T. Leung (Int. J. Found. Comput. Sci., 2004)

Improved Competitive Algorithms For Two-Processor Real-Time Systems. - Joseph Y.-T. Leung (Int. J. Found. Comput. Sci., 2004)

Introduction and Notation. - Joseph Y.-T. Leung (Handbook of Scheduling, 2004)

A Tutorial on Complexity. - Joseph Y.-T. Leung (Handbook of Scheduling, 2004)

Some Basic Scheduling Algorithms. - Joseph Y.-T. Leung (Handbook of Scheduling, 2004)

Minimizing TotalWeighted Error for Imprecise Computation Tasks and Related Problems. - Joseph Y.-T. Leung (Handbook of Scheduling, 2004)

Open shops with jobs overlap - revisited. - Joseph Y.-T. Leung; Haibing Li; Michael L. Pinedo; Chelliah Sriskandarajah (Eur. J. Oper. Res., 2005)

Minimizing mean flowtime and makespan on master-slave systems. - Joseph Y.-T. Leung; Hairong Zhao (J. Parallel Distributed Comput., 2005)

Minimizing total completion time for UET tasks with release time and outtree precedence constraints. - Yumei Huo; Joseph Y.-T. Leung (Math. Methods Oper. Res., 2005)

Order Scheduling in an Environment with Dedicated Resources in Parallel. - Joseph Y.-T. Leung; Haibing Li; Michael L. Pinedo (J. Sched., 2005)

Online Scheduling of Precedence Constrained Tasks. - Yumei Huo; Joseph Y.-T. Leung (SIAM J. Comput., 2005)

Scheduling orders for multiple product types with due date related objectives. - Joseph Y.-T. Leung; Haibing Li; Michael L. Pinedo (Eur. J. Oper. Res., 2006)

Two Machine Scheduling under Disruptions with Transportation Considerations. - Chung-Yee Lee; Joseph Y.-T. Leung; Gang Yu 001 (J. Sched., 2006)

Minimizing total completion time on uniform machines with deadline constraints. - Teofilo F. Gonzalez; Joseph Y.-T. Leung; Michael L. Pinedo (ACM Trans. Algorithms, 2006)

Minimizing mean flow time for UET tasks. - Yumei Huo; Joseph Y.-T. Leung (ACM Trans. Algorithms, 2006)

Minimizing Sum of Completion Times and Makespan in Master-Slave Systems. - Joseph Y.-T. Leung; Hairong Zhao (IEEE Trans. Computers, 2006)

Scheduling orders for multiple product types to minimize total weighted completion time. - Joseph Y.-T. Leung; Haibing Li; Michael L. Pinedo (Discret. Appl. Math., 2007)

Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness. - Yumei Huo; Joseph Y.-T. Leung; Hairong Zhao (Eur. J. Oper. Res., 2007)

Scheduling Two-Machine Flow shops with Exact Delays. - Joseph Y.-T. Leung; Haibing Li; Hairong Zhao (Int. J. Found. Comput. Sci., 2007)

Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines. - Joseph Y.-T. Leung; Haibing Li; Michael L. Pinedo; Jiawei Zhang (Inf. Process. Lett., 2007)

Scheduling imprecise computation tasks on uniform processors. - Guohua Wan; Joseph Y.-T. Leung; Michael L. Pinedo (Inf. Process. Lett., 2007)

Complexity of two dual criteria scheduling problems. - Yumei Huo; Joseph Y.-T. Leung; Hairong Zhao (Oper. Res. Lett., 2007)

Variants of Classical One-Dimensional Bin Packing. - Edward G. Coffman Jr.; Joseph Y.-T. Leung; János Csirik (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Variable-Sized Bin Packing and Bin Covering. - Edward G. Coffman Jr.; Joseph Y.-T. Leung; János Csirik (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Introduction and Overview. - Insup Lee 001; Joseph Y.-T. Leung; Sang Hyuk Son (Handbook of Real-Time and Embedded Systems, 2007)

Approximation Algorithms for Imprecise Computation Tasks with 0/1 Constraint. - Joseph Y.-T. Leung (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Imprecise Computation Model. - Joseph Y.-T. Leung (Handbook of Real-Time and Embedded Systems, 2007)

Imprecise Computation Model. - Joseph Y.-T. Leung (Handbook of Real-Time and Embedded Systems, 2007)

Integrating Communication Cost into the Utility Accrual Model for the Resource Allocation in Distributed Real-Time Systems. - Xinfa Hu; Joseph Y.-T. Leung (RTCSA, 2008)

Testing Interval Trees for Real-Time Scheduling Systems. - Xinfa Hu; Joseph Y.-T. Leung (RTCSA, 2008)

Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time. - Joseph Y.-T. Leung; Haibing Li; Michael L. Pinedo (Ann. Oper. Res., 2008)

Scheduling problems in master-slave model. - Joseph Y.-T. Leung; Hairong Zhao (Ann. Oper. Res., 2008)

An asymptotic approximation scheme for the concave cost bin packing problem. - Joseph Y.-T. Leung; Chung-Lun Li (Eur. J. Oper. Res., 2008)

Preemptive multiprocessor order scheduling to minimize total weighted flowtime. - Joseph Y.-T. Leung; Chung-Yee Lee; Chung W. Ng; Gilbert H. Young (Eur. J. Oper. Res., 2008)

Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times. - Joseph Y.-T. Leung; C. T. Ng 001; T. C. Edwin Cheng (Eur. J. Oper. Res., 2008)

Online scheduling of equal-processing-time task systems. - Yumei Huo; Joseph Y.-T. Leung; Xin Wang (Theor. Comput. Sci., 2008)

A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions. - Yumei Huo; Joseph Y.-T. Leung; Xin Wang (Discret. Optim., 2009)

Preemptive Scheduling Algorithms with Nested Processing Set restriction. - Yumei Huo; Joseph Y.-T. Leung; Xin Wang (Int. J. Found. Comput. Sci., 2009)

Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. - Kangbok Lee; Byung-Cheon Choi; Joseph Y.-T. Leung; Michael L. Pinedo (Inf. Process. Lett., 2009)

A note on "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs". - Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo (Inf. Process. Lett., 2009)

A note on graph balancing problems with restrictions. - Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo (Inf. Process. Lett., 2009)

Online scheduling on two uniform machines subject to eligibility constraints. - Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo (Theor. Comput. Sci., 2009)

Makespan minimization in online scheduling with machine eligibility. - Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo (4OR, 2010)

Integrated production and delivery scheduling with disjoint windows. - Yumei Huo; Joseph Y.-T. Leung; Xin Wang (Discret. Appl. Math., 2010)

Complexity of single machine scheduling subject to nonnegative inventory constraints. - Dirk Briskorn; Byung-Cheon Choi; Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo (Eur. J. Oper. Res., 2010)

Flow shops with machine maintenance: Ordered and proportionate cases. - Byung-Cheon Choi; Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo (Eur. J. Oper. Res., 2010)

Parallel machine scheduling with nested processing set restrictions. - Yumei Huo; Joseph Y.-T. Leung (Eur. J. Oper. Res., 2010)

Scheduling two agents with controllable processing times. - Guohua Wan; Sudheer R. Vakati; Joseph Y.-T. Leung; Michael L. Pinedo (Eur. J. Oper. Res., 2010)

Competitive Two-Agent Scheduling and Its Applications. - Joseph Y.-T. Leung; Michael L. Pinedo; Guohua Wan (Oper. Res., 2010)

A note on makespan minimization in proportionate flow shops. - Byung-Cheon Choi; Joseph Y.-T. Leung; Michael L. Pinedo (Inf. Process. Lett., 2010)

Complexity of a scheduling problem with controllable processing times. - Byung-Cheon Choi; Joseph Y.-T. Leung; Michael L. Pinedo (Oper. Res. Lett., 2010)

Fast approximation algorithms for job scheduling with processing set restrictions. - Yumei Huo; Joseph Y.-T. Leung (Theor. Comput. Sci., 2010)

Coordination mechanisms with hybrid local policies. - Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo (Discret. Optim., 2011)

Minimizing makespan in an ordered flow shop with machine-dependent processing times. - Byung-Cheon Choi; Joseph Y.-T. Leung; Michael L. Pinedo (J. Comb. Optim., 2011)

Scheduling jobs with equal processing times subject to machine eligibility constraints. - Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo (J. Sched., 2011)

Exploring the Interplay between Computation and Communication in Distributed Real-Time Scheduling. - Xinfa Hu; Guoliang Xing; Joseph Y.-T. Leung (IEEE Trans. Computers, 2011)

Coordination mechanisms for parallel machine scheduling. - Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo (Eur. J. Oper. Res., 2012)

Berth allocation with time-dependent physical limitations on vessels. - Dongsheng Xu; Chung-Lun Li; Joseph Y.-T. Leung (Eur. J. Oper. Res., 2012)

Minimizing maximum lateness of jobs in inventory constrained scheduling. - Dirk Briskorn; Joseph Y.-T. Leung (J. Oper. Res. Soc., 2013)

Integrated production and distribution with fixed delivery departure dates. - Joseph Y.-T. Leung; Zhi-Long Chen (Oper. Res. Lett., 2013)

An agent-based intelligent algorithm for uniform machine scheduling to minimize total completion time. - Kai Li 019; Joseph Y.-T. Leung; Bayi Cheng (Appl. Soft Comput., 2014)

An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes. - Zhao-Hong Jia; Joseph Y.-T. Leung (Comput. Oper. Res., 2014)

Fast approximation algorithms for bi-criteria scheduling with machine assignment costs. - Kangbok Lee; Joseph Y.-T. Leung; Zhao-Hong Jia; Wenhua Li; Michael L. Pinedo; Bertrand M. T. Lin (Eur. J. Oper. Res., 2014)

Two dimensional load balancing. - Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo (Oper. Res. Lett., 2014)

Integrated scheduling of production and distribution to minimize total cost using an improved ant colony optimization method. - Bayi Cheng; Joseph Y.-T. Leung; Kai Li 019 (Comput. Ind. Eng., 2015)

A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes. - Zhao-Hong Jia; Joseph Y.-T. Leung (Eur. J. Oper. Res., 2015)

Integrated production and delivery on parallel batching machines. - Kai Li 019; Zhao-Hong Jia; Joseph Y.-T. Leung (Eur. J. Oper. Res., 2015)

Improved algorithms for single machine scheduling with release dates and rejections. - Cheng He; Joseph Y.-T. Leung; Kangbok Lee; Michael L. Pinedo (4OR, 2016)

An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families. - Zhao-Hong Jia; Chao Wang; Joseph Y.-T. Leung (Appl. Soft Comput., 2016)

Worker assignment and production planning with learning and forgetting in manufacturing cells by hybrid bacteria foraging algorithm. - Chunfeng Liu 003; Jufeng Wang; Joseph Y.-T. Leung (Comput. Ind. Eng., 2016)

Multitasking via alternate and shared processing: Algorithms and complexity. - Nicholas G. Hall; Joseph Y.-T. Leung; Chung-Lun Li (Discret. Appl. Math., 2016)

Scheduling a single machine with parallel batching to minimize makespan and total rejection cost. - Cheng He; Joseph Y.-T. Leung; Kangbok Lee; Michael L. Pinedo (Discret. Appl. Math., 2016)

Integrated production and delivery with single machine and multiple vehicles. - Kai Li 019; Chao Zhou 008; Joseph Y.-T. Leung; Ying Ma (Expert Syst. Appl., 2016)

An improved binary search algorithm for the Multiple-Choice Knapsack Problem. - Cheng He; Joseph Y.-T. Leung; Kangbok Lee; Michael L. Pinedo (RAIRO Oper. Res., 2016)

Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines. - Zhao-Hong Jia; Yu-lan Zhang; Joseph Y.-T. Leung; Kai Li 019 (Appl. Soft Comput., 2017)

An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. - José Elías C. Arroyo; Joseph Y.-T. Leung (Comput. Ind. Eng., 2017)

Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times. - José Elías C. Arroyo; Joseph Y.-T. Leung (Comput. Oper. Res., 2017)

Integrated scheduling on a batch machine to minimize production, inventory and distribution costs. - Bayi Cheng; Joseph Y.-T. Leung; Kai Li 019 (Eur. J. Oper. Res., 2017)

Fast approximation algorithms for uniform machine scheduling with processing set restrictions. - Joseph Y.-T. Leung; C. T. Ng 001 (Eur. J. Oper. Res., 2017)

Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine. - Lixin Tang; Xiaoli Zhao; Jiyin Liu; Joseph Y.-T. Leung (Eur. J. Oper. Res., 2017)

Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes. - Jun-Qiang Wang; Guo-Qiang Fan; Yingqian Zhang 001; Cheng-Wu Zhang; Joseph Y.-T. Leung (Eur. J. Oper. Res., 2017)

Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities. - Zhao-Hong Jia; Xiaohao Li; Joseph Y.-T. Leung (Future Gener. Comput. Syst., 2017)

A multi-objective model for multi-project scheduling and multi-skilled staff assignment for IT product development considering competency evolution. - Rong Chen; Changyong Liang; Dongxiao Gu; Joseph Y.-T. Leung (Int. J. Prod. Res., 2017)

Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights. - Zhao-Hong Jia; Ming-li Pei; Joseph Y.-T. Leung (Int. J. Syst. Sci., 2017)

Two-agent scheduling of time-dependent jobs. - Cheng He; Joseph Y.-T. Leung (J. Comb. Optim., 2017)

Integrated bacteria foraging algorithm for cellular manufacturing in supply chain considering facility transfer and production planning. - Chunfeng Liu 003; Jufeng Wang; Joseph Y.-T. Leung (Appl. Soft Comput., 2018)

A meta-heuristic for minimizing total weighted flow time on parallel batch machines. - Zhao-Hong Jia; Han Zhang 020; Wen-tao Long; Joseph Y.-T. Leung; Kai Li 019; Wei Li (Comput. Ind. Eng., 2018)

Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities. - Zhao-Hong Jia; Jianhai Yan; Joseph Y.-T. Leung; Kai Li 019; Huaping Chen 001 (Appl. Soft Comput., 2019)

Integrated production and transportation on parallel batch machines to minimize total weighted delivery time. - Zhao-Hong Jia; Xue-Xue Zhuo; Joseph Y.-T. Leung; Kai Li 019 (Comput. Oper. Res., 2019)

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]. - Zhao-Hong Jia; Xue-Xue Zhuo; Joseph Y.-T. Leung; Kai Li 019 (Comput. Oper. Res., 2019)

An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times. - José Elias C. Arroyo; Joseph Y.-T. Leung; Ricardo Gonçalves Tavares (Eng. Appl. Artif. Intell., 2019)

Integrated optimization of material supplying, manufacturing, and product distribution: Models and fast algorithms. - Bayi Cheng; Joseph Y.-T. Leung; Kai Li 019; Shanlin Yang (Eur. J. Oper. Res., 2019)