Leung Joseph Y.-T.

Joseph Y.-T. Leung

Information about the author Joseph Y.-T. Leung will soon be added to the site.
Found 24 papers in total
Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
2008
We are interested in the problem of scheduling orders for different product types in a...
Scheduling problems in master–slave model
Scheduling problems in master–slave model
2008
We consider scheduling problems in the master–slave model, which was introduced...
Bi-criteria scheduling problems: number of tardy jobs and maximum weighted tardiness
Bi-criteria scheduling problems: number of tardy jobs and maximum weighted tardiness
2007
Consider a single machine and a set of n jobs that are available for processing at...
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
2007
We consider the scheduling of orders in an environment with m uniform machines in...
Two machine scheduling under disruptions with transportation considerations
Two machine scheduling under disruptions with transportation considerations
2006
Effective logistics scheduling requires synchronization of manufacturing and delivery...
Order scheduling in an environment with dedicated resources in parallel
Order scheduling in an environment with dedicated resources in parallel
2005
We consider m machines in parallel with each machine capable of producing one specific...
Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
2006
We consider the problem of scheduling orders on identical machines in parallel. Each...
A generalization of the weighted set covering problem
A generalization of the weighted set covering problem
2005
We study a generalization of the weighted set covering problem where every element...
Scheduling orders for multiple product types with due date related objectives
Scheduling orders for multiple product types with due date related objectives
2006
We consider m machines in parallel with each machine capable of producing one specific...
Open shops with jobs overlap – revisited
Open shops with jobs overlap – revisited
2005
In this communication we consider a two machine open shop in which a job requires...
A note on scheduling parallel machines subject to breakdown and repair
A note on scheduling parallel machines subject to breakdown and repair
2004
In this paper we consider n jobs and a number of machines in parallel. The machines...
The ordered open-end bin-packing problem
The ordered open-end bin-packing problem
2003
We study a variant of the classical bin-packing problem, the ordered open-end...
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem
2003
We consider the average-case performance of a well-known approximation algorithm for...
A note on an open-end bin packing problem
A note on an open-end bin packing problem
2001
We consider a variant of the classical one-dimensional bin packing problem, which we...
A dual criteria sequencing problem with earliness and tardiness penalties
A dual criteria sequencing problem with earliness and tardiness penalties
2002
We consider the problem of sequencing n jobs on a single machine, with each job having...
On the asymptotic optimality of multiprocessor scheduling heuristics for the makespan minimization problem
On the asymptotic optimality of multiprocessor scheduling heuristics for the makespan minimization problem
1995
The asymptotic performance of heuristic algorithms for the multiprocessor scheduling...
Minimizing the weighted number of tardy task units
Minimizing the weighted number of tardy task units
1994
The problem of minimizing the weighted number of tardy task units on a single...
Minimizing the number of late jobs on unrelated machines
Minimizing the number of late jobs on unrelated machines
1991
The authors consider the problem of preemptively scheduling a set of independent jobs...
Preemptive scheduling of equal length jobs on two machines to minimize mean flow time
Preemptive scheduling of equal length jobs on two machines to minimize mean flow time
1990
The authors give an O(n log n) time algorithm to preemptively schedule n equal-length...
Minimizing total tardiness on one machine is NP-hard
Minimizing total tardiness on one machine is NP-hard
1990
The problem of minimizing the total tardiness for a set of independent jobs on one...
Bin packing with restricted piece sizes
Bin packing with restricted piece sizes
1989
Coffman et al. have recently shown that a large number of bin-packing problems can be...
Minimizing schedule length subject to minimum flow time
Minimizing schedule length subject to minimum flow time
1989
The problem of scheduling n independent tasks on m ≥1 identical processors, with...
Scheduling tree-structured tasks on two processors to minimize schedule length
Scheduling tree-structured tasks on two processors to minimize schedule length
1989
Consider a set of n tasks with a tree-structured precedence relation and execution...
A new algorithm for scheduling periodic, real-time tasks
A new algorithm for scheduling periodic, real-time tasks
1989
The paper considers the problem of preemptively scheduling a set of periodic,...
Papers per page: