Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDJoseph Y.-T. Leung
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
[j133]Zhao-Hong Jia, Jianhai Yan, Joseph Y.-T. Leung, Kai Li, Huaping Chen:
Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities. Appl. Soft Comput. 75: 548-561 (2019)- [j132]Zhao-Hong Jia, Xue-Xue Zhuo, Joseph Y.-T. Leung, Kai Li:
Integrated production and transportation on parallel batch machines to minimize total weighted delivery time. Comput. Oper. Res. 102: 39-51 (2019) - [j131]Zhao-Hong Jia, Xue-Xue Zhuo, Joseph Y.-T. Leung, Kai Li:
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. 105: 248 (2019) - [j130]José Elias C. Arroyo, Joseph Y.-T. Leung, Ricardo Gonçalves Tavares:
An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times. Eng. Appl. Artif. Intell. 77: 239-254 (2019) - [j129]Bayi Cheng, Joseph Y.-T. Leung, Kai Li, Shanlin Yang:
Integrated optimization of material supplying, manufacturing, and product distribution: Models and fast algorithms. Eur. J. Oper. Res. 277(1): 100-111 (2019) - 2018
- [j128]Chunfeng Liu, Jufeng Wang, Joseph Y.-T. Leung:
Integrated bacteria foraging algorithm for cellular manufacturing in supply chain considering facility transfer and production planning. Appl. Soft Comput. 62: 602-618 (2018) - [j127]Zhao-Hong Jia, Han Zhang, Wen-tao Long, Joseph Y.-T. Leung, Kai Li, Wei Li:
A meta-heuristic for minimizing total weighted flow time on parallel batch machines. Comput. Ind. Eng. 125: 298-308 (2018) - 2017
- [j126]Zhao-Hong Jia, Yu-lan Zhang, Joseph Y.-T. Leung, Kai Li:
Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines. Appl. Soft Comput. 55: 226-237 (2017) - [j125]José Elías C. Arroyo, Joseph Y.-T. Leung:
An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. Comput. Ind. Eng. 105: 84-100 (2017) - [j124]José Elías C. Arroyo, Joseph Y.-T. Leung:
Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times. Comput. Oper. Res. 78: 117-128 (2017) - [j123]Bayi Cheng, Joseph Y.-T. Leung, Kai Li:
Integrated scheduling on a batch machine to minimize production, inventory and distribution costs. Eur. J. Oper. Res. 258(1): 104-112 (2017) - [j122]Jun-qiang Wang
, Guo-qiang Fan, Yingqian Zhang, Cheng-wu Zhang, Joseph Y.-T. Leung:
Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes. Eur. J. Oper. Res. 258(2): 478-490 (2017) - [j121]Joseph Y.-T. Leung, C. T. Ng:
Fast approximation algorithms for uniform machine scheduling with processing set restrictions. Eur. J. Oper. Res. 260(2): 507-513 (2017) - [j120]Lixin Tang, Xiaoli Zhao, Jiyin Liu, Joseph Y.-T. Leung:
Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine. Eur. J. Oper. Res. 263(2): 401-411 (2017) - [j119]Zhao-Hong Jia, Xiaohao Li, Joseph Y.-T. Leung:
Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities. Future Gener. Comput. Syst. 67: 22-34 (2017) - [j118]Zhao-Hong Jia, Ming-li Pei, Joseph Y.-T. Leung:
Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights. Int. J. Syst. Sci. 48(16): 3542-3557 (2017) - [j117]Cheng He, Joseph Y.-T. Leung:
Two-agent scheduling of time-dependent jobs. J. Comb. Optim. 34(2): 362-377 (2017) - 2016
- [j116]Cheng He, Joseph Y.-T. Leung, Kangbok Lee, Michael L. Pinedo:
Improved algorithms for single machine scheduling with release dates and rejections. 4OR 14(1): 41-55 (2016) - [j115]Zhao-Hong Jia, Chao Wang, Joseph Y.-T. Leung:
An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families. Appl. Soft Comput. 38: 395-404 (2016) - [j114]Chunfeng Liu, Jufeng Wang, Joseph Y.-T. Leung:
Worker assignment and production planning with learning and forgetting in manufacturing cells by hybrid bacteria foraging algorithm. Comput. Ind. Eng. 96: 162-179 (2016) - [j113]Cheng He, Joseph Y.-T. Leung, Kangbok Lee, Michael L. Pinedo:
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost. Discret. Appl. Math. 204: 150-163 (2016) - [j112]Nicholas G. Hall, Joseph Y.-T. Leung, Chung-Lun Li:
Multitasking via alternate and shared processing: Algorithms and complexity. Discret. Appl. Math. 208: 41-58 (2016) - [j111]Kai Li, Chao Zhou, Joseph Y.-T. Leung, Ying Ma:
Integrated production and delivery with single machine and multiple vehicles. Expert Syst. Appl. 57: 12-20 (2016) - [j110]Cheng He, Joseph Y.-T. Leung, Kangbok Lee, Michael L. Pinedo:
An improved binary search algorithm for the Multiple-Choice Knapsack Problem. RAIRO Oper. Res. 50(4-5): 995-1001 (2016) - 2015
- [j109]Bayi Cheng, Joseph Y.-T. Leung, Kai Li:
Integrated scheduling of production and distribution to minimize total cost using an improved ant colony optimization method. Comput. Ind. Eng. 83: 217-225 (2015) - [j108]Zhao-Hong Jia, Joseph Y.-T. Leung:
A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes. Eur. J. Oper. Res. 240(3): 649-665 (2015) - [j107]Kai Li, Zhao-Hong Jia, Joseph Y.-T. Leung:
Integrated production and delivery on parallel batching machines. Eur. J. Oper. Res. 247(3): 755-763 (2015) - 2014
- [j106]Kai Li, Joseph Y.-T. Leung, Bayi Cheng:
An agent-based intelligent algorithm for uniform machine scheduling to minimize total completion time. Appl. Soft Comput. 25: 277-284 (2014) - [j105]Zhao-Hong Jia, Joseph Y.-T. Leung:
An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes. Comput. Oper. Res. 46: 49-58 (2014) - [j104]Kangbok Lee, Joseph Y.-T. Leung, Zhao-Hong Jia, Wenhua Li, Michael L. Pinedo, Bertrand M. T. Lin:
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs. Eur. J. Oper. Res. 238(1): 54-64 (2014) - [j103]Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
Two dimensional load balancing. Oper. Res. Lett. 42(8): 539-544 (2014) - 2013
- [j102]Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
Makespan minimization in online scheduling with machine eligibility. Ann. Oper. Res. 204(1): 189-222 (2013) - [j101]Dirk Briskorn, Joseph Y.-T. Leung:
Minimizing maximum lateness of jobs in inventory constrained scheduling. J. Oper. Res. Soc. 64(12): 1851-1864 (2013) - [j100]Joseph Y.-T. Leung, Zhi-Long Chen:
Integrated production and distribution with fixed delivery departure dates. Oper. Res. Lett. 41(3): 290-293 (2013) - 2012
- [j99]Dongsheng Xu, Chung-Lun Li, Joseph Y.-T. Leung:
Berth allocation with time-dependent physical limitations on vessels. Eur. J. Oper. Res. 216(1): 47-56 (2012) - [j98]Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
Coordination mechanisms for parallel machine scheduling. Eur. J. Oper. Res. 220(2): 305-313 (2012) - 2011
- [j97]Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
Coordination mechanisms with hybrid local policies. Discret. Optim. 8(4): 513-524 (2011) - [j96]Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo:
Minimizing makespan in an ordered flow shop with machine-dependent processing times. J. Comb. Optim. 22(4): 797-818 (2011) - [j95]Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
Scheduling jobs with equal processing times subject to machine eligibility constraints. J. Sched. 14(1): 27-38 (2011) - [j94]Xinfa Hu, Guoliang Xing, Joseph Y.-T. Leung:
Exploring the Interplay between Computation and Communication in Distributed Real-Time Scheduling. IEEE Trans. Computers 60(12): 1759-1771 (2011) - 2010
- [j93]Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
Makespan minimization in online scheduling with machine eligibility. 4OR 8(4): 331-364 (2010) - [j92]Yumei Huo, Joseph Y.-T. Leung, Xin Wang:
Integrated production and delivery scheduling with disjoint windows. Discret. Appl. Math. 158(8): 921-931 (2010) - [j91]Yumei Huo, Joseph Y.-T. Leung:
Parallel machine scheduling with nested processing set restrictions. Eur. J. Oper. Res. 204(2): 229-236 (2010) - [j90]Guohua Wan, Sudheer R. Vakati, Joseph Y.-T. Leung, Michael Pinedo:
Scheduling two agents with controllable processing times. Eur. J. Oper. Res. 205(3): 528-539 (2010) - [j89]Byung-Cheon Choi, Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
Flow shops with machine maintenance: Ordered and proportionate cases. Eur. J. Oper. Res. 207(1): 97-104 (2010) - [j88]Dirk Briskorn, Byung-Cheon Choi, Kangbok Lee, Joseph Y.-T. Leung, Michael Pinedo:
Complexity of single machine scheduling subject to nonnegative inventory constraints. Eur. J. Oper. Res. 207(2): 605-619 (2010) - [j87]Joseph Y.-T. Leung, Michael Pinedo, Guohua Wan:
Competitive Two-Agent Scheduling and Its Applications. Oper. Res. 58(2): 458-469 (2010) - [j86]Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo:
A note on makespan minimization in proportionate flow shops. Inf. Process. Lett. 111(2): 77-81 (2010) - [j85]Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo:
Complexity of a scheduling problem with controllable processing times. Oper. Res. Lett. 38(2): 123-126 (2010) - [j84]Yumei Huo, Joseph Y.-T. Leung:
Fast approximation algorithms for job scheduling with processing set restrictions. Theor. Comput. Sci. 411(44-46): 3947-3955 (2010)
2000 – 2009
- 2009
- [j83]Yumei Huo, Joseph Y.-T. Leung, Xin Wang:
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions. Discret. Optim. 6(3): 292-298 (2009) - [j82]Yumei Huo, Joseph Y.-T. Leung, Xin Wang:
Preemptive Scheduling Algorithms with Nested Processing Set restriction. Int. J. Found. Comput. Sci. 20(6): 1147-1160 (2009) - [j81]Kangbok Lee, Joseph Y.-T. Leung, Michael Pinedo:
A note on "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs". Inf. Process. Lett. 109(12): 608-610 (2009) - [j80]Kangbok Lee, Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo:
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. Inf. Process. Lett. 109(16): 913-917 (2009) - [j79]Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
A note on graph balancing problems with restrictions. Inf. Process. Lett. 110(1): 24-29 (2009) - [j78]Kangbok Lee, Joseph Y.-T. Leung, Michael Pinedo:
Online scheduling on two uniform machines subject to eligibility constraints. Theor. Comput. Sci. 410(38-40): 3975-3981 (2009) - [c14]Yumei Huo, Joseph Y.-T. Leung, Xin Wang:
Integrated Production and Delivery Scheduling with Disjoint Windows. COCOA 2009: 471-482 - 2008
- [j77]Joseph Y.-T. Leung, Haibing Li, Michael Pinedo:
Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time. Ann. Oper. Res. 159(1): 107-123 (2008) - [j76]Joseph Y.-T. Leung, Hairong Zhao:
Scheduling problems in master-slave model. Ann. Oper. Res. 159(1): 215-231 (2008) - [j75]Joseph Y.-T. Leung, C. T. Ng, T. C. Edwin Cheng:
Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times. Eur. J. Oper. Res. 187(3): 1090-1099 (2008) - [j74]Joseph Y.-T. Leung, Chung-Yee Lee, Chung W. Ng, Gilbert H. Young:
Preemptive multiprocessor order scheduling to minimize total weighted flowtime. Eur. J. Oper. Res. 190(1): 40-51 (2008) - [j73]Joseph Y.-T. Leung, Chung-Lun Li:
An asymptotic approximation scheme for the concave cost bin packing problem. Eur. J. Oper. Res. 191(2): 582-586 (2008) - [j72]Yumei Huo, Joseph Y.-T. Leung, Xin Wang:
Online scheduling of equal-processing-time task systems. Theor. Comput. Sci. 401(1-3): 85-95 (2008) - [c13]Xinfa Hu, Joseph Y.-T. Leung:
Integrating Communication Cost into the Utility Accrual Model for the Resource Allocation in Distributed Real-Time Systems. RTCSA 2008: 217-226 - [c12]Xinfa Hu, Joseph Y.-T. Leung:
Testing Interval Trees for Real-Time Scheduling Systems. RTCSA 2008: 327-336 - 2007
- [j71]Joseph Y.-T. Leung, Haibing Li, Michael Pinedo:
Scheduling orders for multiple product types to minimize total weighted completion time. Discret. Appl. Math. 155(8): 945-970 (2007) - [j70]Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao:
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness. Eur. J. Oper. Res. 177(1): 116-134 (2007) - [j69]Joseph Y.-T. Leung, Haibing Li, Hairong Zhao:
Scheduling Two-Machine Flow shops with Exact Delays. Int. J. Found. Comput. Sci. 18(2): 341-359 (2007) - [j68]Joseph Y.-T. Leung, Haibing Li, Michael Pinedo, Jiawei Zhang:
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines. Inf. Process. Lett. 103(3): 119-129 (2007) - [j67]Guohua Wan, Joseph Y.-T. Leung, Michael Pinedo:
Scheduling imprecise computation tasks on uniform processors. Inf. Process. Lett. 104(2): 45-52 (2007) - [j66]Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao:
Complexity of two dual criteria scheduling problems. Oper. Res. Lett. 35(2): 211-220 (2007) - [e2]Sang Hyuk Son, Insup Lee, Joseph Y.-T. Leung:
Handbook of Real-Time and Embedded Systems. Chapman and Hall/CRC 2007, ISBN 978-1-58488-678-5 [contents] - [r10]Edward G. Coffman Jr., Joseph Y.-T. Leung, János Csirik:
Variants of Classical One-Dimensional Bin Packing. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r9]Edward G. Coffman Jr., Joseph Y.-T. Leung, János Csirik:
Variable-Sized Bin Packing and Bin Covering. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r8]Insup Lee, Joseph Y.-T. Leung, Sang Hyuk Son:
Introduction and Overview. Handbook of Real-Time and Embedded Systems 2007 - [r7]Joseph Y.-T. Leung:
Approximation Algorithms for Imprecise Computation Tasks with 0/1 Constraint. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r6]Joseph Y.-T. Leung:
Imprecise Computation Model. Handbook of Real-Time and Embedded Systems 2007 - [r5]Joseph Y.-T. Leung:
Imprecise Computation Model. Handbook of Real-Time and Embedded Systems 2007 - 2006
- [j65]Joseph Y.-T. Leung, Haibing Li, Michael Pinedo:
Scheduling orders for multiple product types with due date related objectives. Eur. J. Oper. Res. 168(2): 370-389 (2006) - [j64]Chung-Yee Lee, Joseph Y.-T. Leung, Gang Yu:
Two Machine Scheduling under Disruptions with Transportation Considerations. J. Sched. 9(1): 35-48 (2006) - [j63]Teofilo F. Gonzalez, Joseph Y.-T. Leung, Michael Pinedo:
Minimizing total completion time on uniform machines with deadline constraints. ACM Trans. Algorithms 2(1): 95-115 (2006) - [j62]Yumei Huo, Joseph Y.-T. Leung:
Minimizing mean flow time for UET tasks. ACM Trans. Algorithms 2(2): 244-262 (2006) - [j61]Joseph Y.-T. Leung, Hairong Zhao:
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems. IEEE Trans. Computers 55(8): 985-999 (2006) - 2005
- [j60]Joseph Y.-T. Leung, Haibing Li, Michael Pinedo, Chelliah Sriskandarajah:
Open shops with jobs overlap - revisited. Eur. J. Oper. Res. 163(2): 569-571 (2005) - [j59]Joseph Y.-T. Leung, Hairong Zhao:
Minimizing mean flowtime and makespan on master-slave systems. J. Parallel Distributed Comput. 65(7): 843-856 (2005) - [j58]Yumei Huo, Joseph Y.-T. Leung:
Minimizing total completion time for UET tasks with release time and outtree precedence constraints. Math. Methods Oper. Res. 62(2): 275-279 (2005) - [j57]Joseph Y.-T. Leung, Haibing Li, Michael Pinedo:
Order Scheduling in an Environment with Dedicated Resources in Parallel. J. Sched. 8(5): 355-386 (2005) - [j56]Yumei Huo, Joseph Y.-T. Leung:
Online Scheduling of Precedence Constrained Tasks. SIAM J. Comput. 34(3): 743-762 (2005) - 2004
- [j55]Kevin I.-J. Ho, Joseph Y.-T. Leung:
A Dual Criteria Preemptive Scheduling Problem For Minimax Error Of Imprecise Computation Tasks. Int. J. Found. Comput. Sci. 15(5): 717-731 (2004) - [j54]Joseph Y.-T. Leung:
Improved Competitive Algorithms For Two-Processor Real-Time Systems. Int. J. Found. Comput. Sci. 15(5): 733-751 (2004) - [c11]Joseph Y.-T. Leung, Hairong Zhao:
Minimizing Mean Flowtime on Master-Slave Machines. PDPTA 2004: 939-945 - [e1]Joseph Y.-T. Leung:
Handbook of Scheduling - Algorithms, Models, and Performance Analysis. Chapman and Hall/CRC 2004, ISBN 978-1-58488-397-5 [contents] - [r4]Joseph Y.-T. Leung:
Introduction and Notation. Handbook of Scheduling 2004 - [r3]Joseph Y.-T. Leung:
A Tutorial on Complexity. Handbook of Scheduling 2004 - [r2]Joseph Y.-T. Leung:
Some Basic Scheduling Algorithms. Handbook of Scheduling 2004 - [r1]Joseph Y.-T. Leung:
Minimizing TotalWeighted Error for Imprecise Computation Tasks and Related Problems. Handbook of Scheduling 2004 - 2003
- [j53]Jian Yang, Joseph Y.-T. Leung:
The Ordered Open-End Bin-Packing Problem. Oper. Res. 51(5): 759-770 (2003) - [j52]James M. Calvin, Joseph Y.-T. Leung:
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. Oper. Res. Lett. 31(3): 202-210 (2003) - [j51]Joseph Y.-T. Leung, Michael Pinedo:
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints. SIAM J. Comput. 32(5): 1370-1388 (2003) - [c10]Chung W. Ng, Joseph Y.-T. Leung, Gilbert H. Young:
Heuristics for Generalized Task System. PDPTA 2003: 1447-1453
1990 – 1999
- 1999
- [j50]Moshe Dror, Wieslaw Kubiak, Joseph Y.-T. Leung:
Tree Precedence in Scheduling: The Strong-Weak Distinction. Inf. Process. Lett. 71(3-4): 127-134 (1999) - 1998
- [j49]Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young:
Minimizing Mean Flow Time with Error Constraint. Algorithmica 20(1): 101-118 (1998) - 1997
- [j48]Kevin I.-J. Ho, Joseph Y.-T. Leung, W.-D. Wei:
Scheduling Imprecise Computation Tasks with 0/1-constraint. Discret. Appl. Math. 78(1-3): 117-132 (1997) - 1996
- [j47]Joseph Y.-T. Leung, Tommy W. Tam, Gilbert H. Young:
On-Line Routing of Real-Time Messages. J. Parallel Distributed Comput. 34(2): 211-217 (1996) - [j46]Sunan Han, Dawei Hong, Joseph Y.-T. Leung:
Probabilistic analysis of a bin covering algorithm. Oper. Res. Lett. 18(4): 193-199 (1996) - [c9]Gilbert H. Young, Joseph Y.-T. Leung, Xue-Jie Zhang:
Generalized Task System for Parallel Computation. PDPTA 1996: 241-244 - 1995
- [j45]Joseph Y.-T. Leung, W.-D. Wei:
Some properties of nonnegative integral matrices. Ars Comb. 40 (1995) - [j44]Sunan Han, Dawei Hong, Joseph Y.-T. Leung:
On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem. INFORMS J. Comput. 7(2): 201-204 (1995) - [j43]Dawei Hong, Joseph Y.-T. Leung:
Probabilistic Analysis of k-Dimensional Packing Algorithms. Inf. Process. Lett. 55(1): 17-24 (1995) - [j42]Joseph Y.-T. Leung, W.-D. Wei:
Tighter Bounds on a Heuristic for a Partition Problem. Inf. Process. Lett. 56(1): 51-57 (1995) - [j41]Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young:
Routing Messages with Release Time and Deadline Constraint. J. Parallel Distributed Comput. 31(1): 65-76 (1995) - 1994
- [j40]Joseph Y.-T. Leung, Vincent K. M. Yu, W.-D. Wei:
Minimizing the Weighted Number of Tardy Task Units. Discret. Appl. Math. 51(3): 307-316 (1994) - [j39]Joseph Y.-T. Leung, Vincent K. M. Yu:
Heuristic for Minimizing the Number of Late Jobs on Two Processors. Int. J. Found. Comput. Sci. 5(3/4): 262-279 (1994) - [j38]Kevin I.-J. Ho, Joseph Y.-T. Leung, W.-D. Wei:
Minimizing Maximum Weighted Error for Imprecise Computation Tasks. J. Algorithms 16(3): 431-452 (1994) - [j37]Joseph Y.-T. Leung, Sunil M. Shende:
On Multidimensional Packet Routing for Meshes with Buses. J. Parallel Distributed Comput. 20(2): 187-197 (1994) - 1993
- [j36]Joseph Y.-T. Leung, C. S. Wong:
Minimizing the Number of Late Tasks with Error Constraint. Inf. Comput. 106(1): 83-108 (1993) - [j35]Kevin I.-J. Ho, Joseph Y.-T. Leung, W.-D. Wei:
Complexity of Scheduling Tasks with Time-Dependent Execution Times. Inf. Process. Lett. 48(6): 315-320 (1993) - [j34]Jianzhong Du, Joseph Y.-T. Leung:
Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops. J. Algorithms 14(1): 24-44 (1993) - [j33]Jianzhong Du, Joseph Y.-T. Leung:
Minimizing Mean Flow Time with Release Time and Deadline Constraints. J. Algorithms 14(1): 45-68 (1993) - 1992
- [j32]Joseph Y.-T. Leung, W.-D. Wei:
A Comparison Theorem for Permanents and a Proof of a Conjecture on (t, m)-Families. J. Comb. Theory, Ser. A 61(1): 98-112 (1992) - [j31]Kwang Soo Hong, Joseph Y.-T. Leung:
Some Results on Liu's Conjecture. SIAM J. Discret. Math. 5(4): 500-523 (1992) - [j30]Kwang Soo Hong, Joseph Y.-T. Leung:
On-Line Scheduling of Real-Time Tasks. IEEE Trans. Computers 41(10): 1326-1331 (1992) - 1991
- [j29]Jianzhong Du, Joseph Y.-T. Leung, Gilbert H. Young:
Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time. Inf. Comput. 92(2): 219-236 (1991) - [j28]Jianzhong Du, Joseph Y.-T. Leung:
Minimizing the number of late jobs on unrelated machines. Oper. Res. Lett. 10(3): 153-158 (1991) - [c8]Joseph Y.-T. Leung, Sunil M. Shende:
Packet routing on square meshes with row and column buses. SPDP 1991: 834-837 - 1990
- [j27]Joseph Y.-T. Leung, Gilbert H. Young:
Minimizing Total Tardiness on a Single Machine with Precedence Constraints. INFORMS J. Comput. 2(4): 346-352 (1990) - [j26]