His primary scientific interests are in Scheduling, Mathematical optimization, Job shop scheduling, Heuristics and Algorithm. He is involved in the study of Scheduling that focuses on Fixed-priority pre-emptive scheduling in particular. His studies in Mathematical optimization integrate themes in fields like Completion time, Upper and lower bounds, Theory of computation and Tardiness.
His Multiprocessor scheduling study in the realm of Job shop scheduling connects with subjects such as Preemption. Joseph Y.-T. Leung combines subjects such as Discrete mathematics, Interval scheduling, Parallel computing, Gang scheduling and Open-shop scheduling with his study of Multiprocessor scheduling. His Heuristics research is multidisciplinary, incorporating perspectives in Berth allocation problem, Product type, Time horizon and Computational complexity theory.
The scientist’s investigation covers issues in Mathematical optimization, Scheduling, Job shop scheduling, Time complexity and Algorithm. His Mathematical optimization study combines topics from a wide range of disciplines, such as Upper and lower bounds and Set. His work on Multiprocessor scheduling as part of general Scheduling study is frequently linked to Preemption, therefore connecting diverse disciplines of science.
His Job shop scheduling study incorporates themes from Competitive analysis and Heuristic. His Time complexity research includes themes of Due date, Imprecise computation and Tardiness. His study in Fair-share scheduling is interdisciplinary in nature, drawing from both Flow shop scheduling and Parallel computing.
His primary areas of study are Mathematical optimization, Scheduling, Job shop scheduling, Scheduling and Heuristics. His Scheduling research incorporates elements of Distributed computing, Minification and Computational complexity theory, Algorithm, Approximation algorithm. The Approximation algorithm study combines topics in areas such as Job scheduler and Batch machine.
His research integrates issues of Upper and lower bounds and Industrial engineering in his study of Job shop scheduling. He performs integrative study on Scheduling and Total cost. His Heuristics study frequently links to related topics such as Real-time computing.
Joseph Y.-T. Leung mainly investigates Job shop scheduling, Scheduling, Mathematical optimization, Scheduling and Heuristics. His Job shop scheduling research incorporates themes from Representation and Heuristic. His work carried out in the field of Heuristic brings together such families of science as Ant colony optimization algorithms and Minification.
His research in Scheduling focuses on subjects like Computational complexity theory, which are connected to Theoretical computer science, Test data and Meta heuristic. His studies deal with areas such as Upper and lower bounds and Decision model as well as Mathematical optimization. His Upper and lower bounds research is multidisciplinary, incorporating elements of Distributed computing, Job scheduler, Iterated greedy algorithm and Greedy algorithm.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
On the complexity of fixed-priority scheduling of periodic, real-time tasks
Joseph Y.-T. Leung;Jennifer Whitehead.
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Joseph Leung;Laurie Kelly;James H. Anderson.
Minimizing total tardiness on one machine is NP-hard
Jianzhong Du;Joseph Y. T. Leung.
A note on preemptive scheduling of periodic, real-time tasks
Joseph Y.-T. Leung;M.L. Merrill.
Complexity of scheduling parallel task systems
J. Du;J. Y.-T. Leung.
Efficient algorithms for interval graphs and circular-arc graphs
Udaiprakash I. Gupta;D. T. Lee;Joseph Y.-T. Leung.
Wireless Sensor Networks
Insup Lee;Joseph Y-T. Leung;Sang H. Son.
On-line scheduling of real-time tasks
K.S. Hong;J.Y.-T. Leung.
Competitive Two-Agent Scheduling and Its Applications
Joseph Y. T. Leung;Michael Pinedo;Guohua Wan.
Packing squares into a square
Joseph Y.-T. Leung;Tommy W. Tam;C. S. Wong;Gilbert H. Young.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: