# Joseph Y.-T. Leung

According to our database

Collaborative distances:

^{1}, Joseph Y.-T. Leung authored at least 147 papers between 1977 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

A meta-heuristic for minimizing total weighted flow time on parallel batch machines.

Computers & Industrial Engineering, 2018

Integrated bacteria foraging algorithm for cellular manufacturing in supply chain considering facility transfer and production planning.

Appl. Soft Comput., 2018

2017

Two-agent scheduling of time-dependent jobs.

J. Comb. Optim., 2017

Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights.

Int. J. Systems Science, 2017

Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities.

Future Generation Comp. Syst., 2017

Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes.

European Journal of Operational Research, 2017

Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine.

European Journal of Operational Research, 2017

Fast approximation algorithms for uniform machine scheduling with processing set restrictions.

European Journal of Operational Research, 2017

Integrated scheduling on a batch machine to minimize production, inventory and distribution costs.

European Journal of Operational Research, 2017

Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times.

Computers & OR, 2017

An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times.

Computers & Industrial Engineering, 2017

Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines.

Appl. Soft Comput., 2017

2016

An improved binary search algorithm for the Multiple-Choice Knapsack Problem.

RAIRO - Operations Research, 2016

Integrated production and delivery with single machine and multiple vehicles.

Expert Syst. Appl., 2016

Scheduling a single machine with parallel batching to minimize makespan and total rejection cost.

Discrete Applied Mathematics, 2016

Multitasking via alternate and shared processing: Algorithms and complexity.

Discrete Applied Mathematics, 2016

Worker assignment and production planning with learning and forgetting in manufacturing cells by hybrid bacteria foraging algorithm.

Computers & Industrial Engineering, 2016

An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families.

Appl. Soft Comput., 2016

Improved algorithms for single machine scheduling with release dates and rejections.

4OR, 2016

2015

Integrated production and delivery on parallel batching machines.

European Journal of Operational Research, 2015

A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes.

European Journal of Operational Research, 2015

Integrated scheduling of production and distribution to minimize total cost using an improved ant colony optimization method.

Computers & Industrial Engineering, 2015

2014

Two dimensional load balancing.

Oper. Res. Lett., 2014

Fast approximation algorithms for bi-criteria scheduling with machine assignment costs.

European Journal of Operational Research, 2014

An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes.

Computers & OR, 2014

An agent-based intelligent algorithm for uniform machine scheduling to minimize total completion time.

Appl. Soft Comput., 2014

2013

Integrated production and distribution with fixed delivery departure dates.

Oper. Res. Lett., 2013

Minimizing maximum lateness of jobs in inventory constrained scheduling.

JORS, 2013

Makespan minimization in online scheduling with machine eligibility.

Annals OR, 2013

2012

Berth allocation with time-dependent physical limitations on vessels.

European Journal of Operational Research, 2012

Coordination mechanisms for parallel machine scheduling.

European Journal of Operational Research, 2012

2011

Exploring the Interplay between Computation and Communication in Distributed Real-Time Scheduling.

IEEE Trans. Computers, 2011

Scheduling jobs with equal processing times subject to machine eligibility constraints.

J. Scheduling, 2011

Minimizing makespan in an ordered flow shop with machine-dependent processing times.

J. Comb. Optim., 2011

Coordination mechanisms with hybrid local policies.

Discrete Optimization, 2011

2010

Fast approximation algorithms for job scheduling with processing set restrictions.

Theor. Comput. Sci., 2010

Complexity of a scheduling problem with controllable processing times.

Oper. Res. Lett., 2010

A note on makespan minimization in proportionate flow shops.

Inf. Process. Lett., 2010

Competitive Two-Agent Scheduling and Its Applications.

Operations Research, 2010

Scheduling two agents with controllable processing times.

European Journal of Operational Research, 2010

Parallel machine scheduling with nested processing set restrictions.

European Journal of Operational Research, 2010

Flow shops with machine maintenance: Ordered and proportionate cases.

European Journal of Operational Research, 2010

Complexity of single machine scheduling subject to nonnegative inventory constraints.

European Journal of Operational Research, 2010

Makespan minimization in online scheduling with machine eligibility.

4OR, 2010

2009

Online scheduling on two uniform machines subject to eligibility constraints.

Theor. Comput. Sci., 2009

A note on graph balancing problems with restrictions.

Inf. Process. Lett., 2009

A note on "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs".

Inf. Process. Lett., 2009

Approximation algorithms for multi-agent scheduling to minimize total weighted completion time.

Inf. Process. Lett., 2009

Preemptive Scheduling Algorithms with Nested Processing Set restriction.

Int. J. Found. Comput. Sci., 2009

A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions.

Discrete Optimization, 2009

Integrated Production and Delivery Scheduling with Disjoint Windows.

Proceedings of the Combinatorial Optimization and Applications, 2009

2008

Online scheduling of equal-processing-time task systems.

Theor. Comput. Sci., 2008

Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times.

European Journal of Operational Research, 2008

Preemptive multiprocessor order scheduling to minimize total weighted flowtime.

European Journal of Operational Research, 2008

An asymptotic approximation scheme for the concave cost bin packing problem.

European Journal of Operational Research, 2008

Scheduling problems in master-slave model.

Annals OR, 2008

Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time.

Annals OR, 2008

Testing Interval Trees for Real-Time Scheduling Systems.

Proceedings of the Fourteenth IEEE Internationl Conference on Embedded and Real-Time Computing Systems and Applications, 2008

Integrating Communication Cost into the Utility Accrual Model for the Resource Allocation in Distributed Real-Time Systems.

Proceedings of the Fourteenth IEEE Internationl Conference on Embedded and Real-Time Computing Systems and Applications, 2008

2007

Imprecise Computation Model.

Proceedings of the Handbook of Real-Time and Embedded Systems., 2007

Imprecise Computation Model.

Proceedings of the Handbook of Real-Time and Embedded Systems., 2007

Approximation Algorithms for Imprecise Computation Tasks with 0/1 Constraint.

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Introduction and Overview.

Proceedings of the Handbook of Real-Time and Embedded Systems., 2007

Variable-Sized Bin Packing and Bin Covering.

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Variants of Classical One-Dimensional Bin Packing.

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Complexity of two dual criteria scheduling problems.

Oper. Res. Lett., 2007

Scheduling imprecise computation tasks on uniform processors.

Inf. Process. Lett., 2007

Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines.

Inf. Process. Lett., 2007

Scheduling Two-Machine Flow shops with Exact Delays.

Int. J. Found. Comput. Sci., 2007

Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness.

European Journal of Operational Research, 2007

Scheduling orders for multiple product types to minimize total weighted completion time.

Discrete Applied Mathematics, 2007

2006

Minimizing Sum of Completion Times and Makespan in Master-Slave Systems.

IEEE Trans. Computers, 2006

Minimizing mean flow time for UET tasks.

ACM Trans. Algorithms, 2006

Minimizing total completion time on uniform machines with deadline constraints.

ACM Trans. Algorithms, 2006

Two Machine Scheduling under Disruptions with Transportation Considerations.

J. Scheduling, 2006

Scheduling orders for multiple product types with due date related objectives.

European Journal of Operational Research, 2006

2005

Online Scheduling of Precedence Constrained Tasks.

SIAM J. Comput., 2005

Order Scheduling in an Environment with Dedicated Resources in Parallel.

J. Scheduling, 2005

Minimizing total completion time for UET tasks with release time and outtree precedence constraints.

Math. Meth. of OR, 2005

Minimizing mean flowtime and makespan on master-slave systems.

J. Parallel Distrib. Comput., 2005

Open shops with jobs overlap - revisited.

European Journal of Operational Research, 2005

2004

Minimizing TotalWeighted Error for Imprecise Computation Tasks and Related Problems.

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Some Basic Scheduling Algorithms.

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

A Tutorial on Complexity.

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Introduction and Notation.

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Improved Competitive Algorithms For Two-Processor Real-Time Systems.

Int. J. Found. Comput. Sci., 2004

A Dual Criteria Preemptive Scheduling Problem For Minimax Error Of Imprecise Computation Tasks.

Int. J. Found. Comput. Sci., 2004

Minimizing Mean Flowtime on Master-Slave Machines.

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

2003

Minimizing Total Completion Time on Parallel Machines with Deadline Constraints.

SIAM J. Comput., 2003

Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.

Oper. Res. Lett., 2003

The Ordered Open-End Bin-Packing Problem.

Operations Research, 2003

Heuristics for Generalized Task System.

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003

1999

Tree Precedence in Scheduling: The Strong-Weak Distinction.

Inf. Process. Lett., 1999

1998

Minimizing Mean Flow Time with Error Constraint.

Algorithmica, 1998

1997

Scheduling Imprecise Computation Tasks with 0/1-constraint.

Discrete Applied Mathematics, 1997

1996

Probabilistic analysis of a bin covering algorithm.

Oper. Res. Lett., 1996

Generalized Task System for Parallel Computation.

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1996

1995

Routing Messages with Release Time and Deadline Constraint.

J. Parallel Distrib. Comput., 1995

Tighter Bounds on a Heuristic for a Partition Problem.

Inf. Process. Lett., 1995

Probabilistic Analysis of k-Dimensional Packing Algorithms.

Inf. Process. Lett., 1995

On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem.

INFORMS Journal on Computing, 1995

Some properties of nonnegative integral matrices.

Ars Comb., 1995

1994

On Multidimensional Packet Routing for Meshes with Buses.

J. Parallel Distrib. Comput., 1994

Minimizing Maximum Weighted Error for Imprecise Computation Tasks.

J. Algorithms, 1994

Heuristic for Minimizing the Number of Late Jobs on Two Processors.

Int. J. Found. Comput. Sci., 1994

Minimizing the Weighted Number of Tardy Task Units.

Discrete Applied Mathematics, 1994

1993

Minimizing the Number of Late Tasks with Error Constraint

Inf. Comput., September, 1993

Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops.

J. Algorithms, 1993

Complexity of Scheduling Tasks with Time-Dependent Execution Times.

Inf. Process. Lett., 1993

1992

Some Results on Liu's Conjecture.

SIAM J. Discrete Math., 1992

A Comparison Theorem for Permanents and a Proof of a Conjecture on (t, m)-Families.

J. Comb. Theory, Ser. A, 1992

1991

Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time

Inf. Comput., June, 1991

Packet routing on square meshes with row and column buses.

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

1990

Minimizing Mean Flow Time with Release Time Constraint.

Theor. Comput. Sci., 1990

Minimizing Total Tardiness on One Machine is NP-Hard.

Math. Oper. Res., 1990

Packing Squares into a Square.

J. Parallel Distrib. Comput., 1990

Preemptive Scheduling to Minimize Mean Weighted Flow Time.

Inf. Process. Lett., 1990

Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time.

Operations Research, 1990

Minimizing Total Tardiness on a Single Machine with Precedence Constraints.

INFORMS Journal on Computing, 1990

Minimizing the Number of Late Tasks with Error Constraint.

Proceedings of the Real-Time Systems Symposium, 1990

On-Line Routing of Real-Time Messages.

Proceedings of the Real-Time Systems Symposium, 1990

1989

Complexity of Scheduling Parallel Task Systems.

SIAM J. Discrete Math., 1989

Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length.

SIAM J. Discrete Math., 1989

Minimizing Schedule Length Subject to Minimum Flow Time.

SIAM J. Comput., 1989

Preemptive Scheduling with Release Times and Deadlines.

Real-Time Systems, 1989

Bin Packing with Restricted Piece Sizes.

Inf. Process. Lett., 1989

A New Algorithm for Scheduling Periodic Real-Time Tasks.

Algorithmica, 1989

Minimizing Mean Flow Time with Error Constraint.

Proceedings of the Real-Time Systems Symposium, 1989

1988

Scheduling Tree-Structured Tasks with Restricted Execution Times.

Inf. Process. Lett., 1988

On-Line Scheduling of Real-Time Tasks.

Proceedings of the 9th IEEE Real-Time Systems Symposium (RTSS '88), 1988

Minimizing Mean Flow Time with Release Time and Deadline Constraints.

Proceedings of the 9th IEEE Real-Time Systems Symposium (RTSS '88), 1988

1985

On the Complexity of Deadlock Recovery.

Proceedings of the STACS 85, 1985

1984

On the 2-Dimensional Channel Assignment Problem.

IEEE Trans. Computers, 1984

On Some Variants of the Bandwidth Minimization Problem.

SIAM J. Comput., 1984

Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs.

J. Algorithms, 1984

On a Dual Version of the One-Dimensional Bin Packing Problem.

J. Algorithms, 1984

1982

On the complexity of fixed-priority scheduling of periodic, real-time tasks.

Perform. Eval., 1982

Efficient algorithms for interval graphs and circular-arc graphs.

Networks, 1982

On Scheduling Independent Tasks with Restricted Execution Times.

Operations Research, 1982

1981

Record Allocation for Minimizing Seek Delay.

Theor. Comput. Sci., 1981

1980

A Note on Preemptive Scheduling of Periodic, Real-Time Tasks.

Inf. Process. Lett., 1980

1979

On Minimum Cost Recovery from System Deadlock.

IEEE Trans. Computers, 1979

An Optimal Solution for the Channel-Assignment Problem.

IEEE Trans. Computers, 1979

Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation.

SIAM J. Comput., 1979

Bounds on List Scheduling of UET Tasks with Restricted Resource Constraints.

Inf. Process. Lett., 1979

1978

Bin Packing: Maximizing the Number of Pieces Packed.

Acta Inf., 1978

1977

Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation

Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977