*Computer Performance*, (K.M. Chandy and M. Reiser, eds.), 327-339,
North-Holland Publishing Co., New York, 1977.

2. *
Coffman, E. G., Jr., D. B. Johnson and J. Y-T. Leung, "An Efficient
Algorithm for Allocating Paged, Drum-Like Storage," *BIT*, 18:52-66, 1978. Also in *Proc. of 1977 Conference on Information Sciences and Systems*, 430-433,
Baltimore, MD, 1977.

3. *
Coffman, E. G., Jr., J. Y-T. Leung and D. W. Ting, "Bin-Packing:
Maximizing the Number of Pieces Packed," *Acta
Informatica*, 9:263-271, 1978.

4. *
Coffman, E. G., Jr., J. Y-T. Leung and D. Slutz, "On the Optimality of
Fast Heuristics for Scheduling and Storage Allocation Problems," *Foundations of Control Engineering*, 3:161-169,
1978. Also in *Proc. of 1977 International Conference on Parallel
Processing*, 95-99, Bellaire, MI, 1977.

5.* Coffman, E. G., Jr. and
J. Y-T. Leung, "Combinatorial Analysis of an Efficient Algorithm for Processor and
Storage Allocation," *SIAM J. on Computing*,
8:202-217, 1979. Also in *Proc. of the 18th Annual Symposium on Foundations of
Computer Science*, 214-221, Providence, RI, 1977.

6. *
Leung, J. Y-T. and E. K. Lai, "On Minimum Cost Recovery from System
Deadlock," *IEEE Transactions on Computers*,
C28:671-677, 1979. Also in *Proc. of 1979 Conference on Information Sciences and
Systems*, 155-159, Baltimore, MD, 1979.

7.* Gupta, U. I., D. T. Lee
and J. Y-T. Leung, "An Optimal Solution for the Channel-Assignment Problem," *IEEE Transactions on Computers*, C28:807-810, 1979.
Also in *Proc. of 1979 Conference on Information Sciences and Systems*, 66-69, Baltimore,
MD, 1979.

8.* Leung, J. Y-T.,
"Bounds on List Scheduling of UET Tasks with Restricted Resource Contraints,"
*Information Processing Letters*, 9:167-170,
1979.

9.* Leung, J. Y-T. and M. L.
Merrill, "A Note on Preemptive Scheduling of Periodic, Real-Time Tasks," *Information Processing Letters*, 11:115-118, 1980.

10.* Gupta, U. I., D. T. Lee, J.
Y-T. Leung, J. W. Pruitt and C. K. Wong, "Record Allocation to Minimize Expected Seek
Delay," *Theoretical Computer Science*,
16:307-319, 1981. Also in *Proc. of the 17th Annual Allerton Conference on
Communications, Control, and Computing*, 225-230, Urbana-Champaign, IL, 1979.

11.* Nakajima, K., J. Y-T. Leung
and S. L. Hakimi, "Optimal Two Processor Scheduling of Tree Precedence Constrained
Tasks with Two Execution Times," *Performance
Evaluation*, 1:320-330, 1981. Also in *Proc. of the 18th Annual Allerton Conference on
Communication, Control, and Computing*, 480-489, Urbana-Champaign, IL, 1980.

12.* Leung, J. Y-T., "On
Scheduling Independent Tasks with Restricted Execution Times," *Operations Research*, 30:163-171, 1982. Also in *Proc.
of the 18th Annual Allerton Conference on Communication, Control, and Computing*,
471-479, Urbana-Champaign, IL, 1980.

13.* Leung, J. Y-T. and J.
Whitehead, "On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time
Tasks," *Performance Evaluation*, 2:237-250,
1982. Also in *Proc. of the 18th Annual Allerton Conference on
Communication, Control, and Computing*, 464-470, Urbana-Champaign, IL, 1980.

14.* Gupta, U. I., D. T. Lee and
J. Y-T. Leung, "Efficient Algorithms for Interval Graphs and Circular-Arc
Graphs," *Networks*, 12:459-467, 1982. Also in *Proc.
of the 1981 Conference on Information Sciences and Systems*, 198-203, Baltimore, MD,
1981.

15. Leung, J. Y-T.,
"Complexity of Optimal Deadlock Recovery," *Proc. of the 21st Annual Allerton Conference on
Communication, Control, and Computing*, 876-885, Urbana-Champaign, IL, 1983.

16.* Leung, J. Y-T., "Fast
Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc, and
Chordal Graphs," *J. of Algorithms*,
5:22-35, 1984.

17.* Assmann, S. F., D. S.
Johnson, D. J. Kleitman and J. Y-T. Leung,
"On a Dual Version of the One-Dimensional Bin Packing Problem," *J. of Algorithms*, 5:502-525, 1984.

18.* Lee, D. T. and J. Y-T. Leung,
"On the 2-Dimensional Channel Assignment Problem," *IEEE Transactions on Computers*, C33:2-6,
1984.

19.* Leung, J. Y-T., O. Vornberger
and J. Witthoff, "On Some Variants of the Bandwidth Minimization Problem," *SIAM J. on Computing*, 13:650-667, 1984.

20.* Leung, J. Y-T. and B. Monien,
"On the Complexity of Deadlock Recovery," *Fundamenta Informaticae*, 9:323-342, 1986.
Also in Lecture Notes in Computer Science, 182:208-218, 1985.

21.* Du, J. and J. Y-T. Leung,
"Scheduling Tree-Structured Tasks with Restricted Execution Time," *Information Processing Letters*, 28:183-188,
1988.

22.* Leung, J. Y-T., "A New
Algorithm for Scheduling Periodic, Real-Time Tasks," *Algorithmica*, 4:209-219, 1989. Also in *Proc.
of the 1986 Annual Conference on Information Sciences and Systems*, 172-177, Princeton,
NJ, 1986.

23.* Leung, J. Y-T. and G. H.
Young, "Minimizing Schedule Length Subject to Minimum Flow Time," *SIAM J. on Computing*, 18:314-326, 1989. Also in *Proc.
of the 25th Annual Allerton Conference on Communication, Control, and Computing*,
650-659, Urbana-Champaign, IL, 1987.

24.* Du, J. and J. Y-T. Leung,
"Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule
Length," *SIAM J. on Discrete Math*.,
2:176-196, 1989.

25.* Leung, J. Y-T., "Bin
Packing with Restricted Piece Sizes," *Information
Processing Letters*, 31:145-149, 1989.

26.* Du, J. and J. Y-T. Leung,
"Complexity of Scheduling Parallel Task Systems," *SIAM J. on Discrete Math.*, 2:473-487, 1989. Also in *Proc.
of the 1988 Conference on Information Sciences and Systems*, 742-747, Princeton, NJ,
1988.

27.* Hong, K. S. and J. Y-T.
Leung, "Preemptive Scheduling with Release Times and Deadlines," *J. of Real-Time Systems*, 1:265-281, 1989. Also in *Proc.
of the 1988 Conference on Information Sciences and Systems*, 748, Princeton, NJ,
1988.

28.* Leung, J. Y-T. and G. H.
Young, "Preemptive Scheduling to Minimize Mean Weighted Flow Time," *Information Processing Letters*, 34:47-50,
1990.

29.* Herrbach, L. A. and J. Y-T.
Leung, "Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean
Flow Time," *Operations Research*,
38:487-494, 1990.

30.* Du, J. and J. Y-T. Leung,
"Minimizing Total Tardiness on One Machine is NP-hard," *Mathematics of Operations Research*, 15:483-495,
1990.

31.* Leung, J. Y-T., T. W. Tam, C.
S. Wong, G. H. Young and F. Chin, "Packing Squares into a Square," *J. of Parallel and Distributed Computing*,
10:271-275, 1990.

32.* Du, J., J. Y-T. Leung and G.
H. Young, "Minimizing Mean Flow Time with Release Time Constraint," *Theoretical Computer Science*, 75:347-355,
1990.

33.* Leung, J. Y-T. and G. H.
Young, "Minimizing Total Tardiness on a Single Machine with Precedence
Constraint," *ORSA J. on Computing*,
2:346-352, 1990.

34.* Du, J. and J. Y-T. Leung,
"Minimizing the Number of Late Jobs on Unrelated Machines," *Operations Research Letters*, 10:153-158,
1991.

35.* Du, J., J. Y-T. Leung and G.
H. Young, "Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow
Time," *Information and Computation*,
92:219-236, 1991.

36.
Leung, J. Y-T., "Research in Real-Time Scheduling," in *Foundations of Real-Time Computing: Scheduling and
Resource Management*, (A.M. van Tilborg and G.M. Koob, eds.), 31-62, Kluwer, Boston,
1991.

37.
Leung, J. Y-T. and S. Shende, "Packet Routing on Square Meshes with Row and
Column Buses," *Proc. of the 3rd IEEE Symposium
on Parallel and Distributed Processing*, 834-837, Dallas, TX, 1991.

38.* Du, J., J. Y-T. Leung and C.
S. Wong, "Minimizing the Number of Late Jobs with Release Time Constraint," *J. of Combinatorial Math. and Combinatorial Computing*,
11:97-107, 1992.

39.* Leung, J. Y-T. and W-D. Wei,
"A Comparison Theorem for Permanents and a Proof of a Conjecture on (t,
m)-families," *J. of Combinatorial Theory:
Series A*, 61:98-112, 1992.

40.* Hong, K. S. and J. Y-T.
Leung, "On-Line Scheduling of Real-Time Tasks," *IEEE Transactions on Computers*, C41:1326-1331,
1992. Also in *Proc. of the 9th Real-Time Systems Symposium*,
244-250, Huntsville, AL, 1988.

41.
Leung, J. Y-T., "Recent Advances in Scheduling Imprecise
Computation Tasks," *Proc. of IEEE Workshop on
Imprecise and Approximate Computatio*n, 62-66, Phoenix, AZ, 1992.

42.* Hong, K. S. and J. Y-T.
Leung, "Some Results on Liu's Conjecture," *SIAM J. on Discrete Math.*, 5:500-523,
1992.

43.* Du, J. and J. Y-T. Leung,
"Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops," *J. of Algorithms*, 14:24-44, 1993.

44.* Du, J. and J. Y-T. Leung,
"Minimizing Mean Flow Time with Release Time and Deadline Constraints," *J. of Algorithms*, 14:45-68, 1993. Also in *Proc.
of the 9th Real-Time Systems Symposium*, 24-32, Huntsville, AL, 1988.

45.* Leung, J. Y-T. and C. S.
Wong, "Minimizing the Number of Late Tasks with Error Constraint," *Information and Computation*, 106:83-108, 1993. Also in *Proc.
of the 11th Real-Time Systems Symposium*, 32-40, Orlando, FL, 1990.

46.* Ho, K. I-J., J. Y-T. Leung
and W-D. Wei, "Complexity of Scheduling Tasks with Time-Dependent Execution
Time," *Information Processing Letters*,
48:315-320, 1993.

47.* Leung, J. Y-T. and S. Shende,
"On Multidimensional Packet Routing for Meshes with Buses," *J. of Parallel and Distributed Computing*,
20:187-197, 1994.

48.* Ho, K. I-J., J. Y-T. Leung
and W-D. Wei, "Minimizing Maximum Weighted Error for Imprecise Computation
Tasks," *J. of Algorithms*, 16:431-452,
1994.

49.* Leung, J. Y-T., V. K. M. Yu
and W-D. Wei, "Minimizing the Weighted Number of Tardy Task Units," *Discrete Applied Mathematics*, 51:307-316,
1994.

50.
Jiang, H., J. Y-T. Leung, P. Luo and S. Shende, "Efficient
Algorithms for Non-blocking Wormhole Routing and Circuit Switching on Linear Array
Multiprocessors," *Proc. of the ISCA
International Conference on Parallel and Distributed Computing Systems*, 614-619, Las
Vegas, Nevada, 1994.

51.* Leung, J. Y-T. and W-D. Wei,
"Maximal k-Multiple-Free Sets of Integers," *Ars Combinatoria*, 38:113-117, 1994.

52.* Leung, J. Y-T., W-D. Wei and
V. K. M. Yu, "Minimizing Makespan on Parallel Machines with Nonsimultaneous Machine
Available and Ending Times," *J. of
Combinatorial Math. and Combinatorial Computing*, 17:33-54, 1995.

53.* Han, S., D. Hong and J. Y-T.
Leung, "On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the
Makespan Minimization Problem," *ORSA J. on
Computing*, 7:201-204, 1995.

54.
Leung, J. Y-T., "A Survey of Scheduling Results for Imprecise
Computation Tasks," in *Imprecise and
Approximate Computation*, (S. Natarajan, ed.), 35-42, Kluwer, Boston, 1995.

55.* Leung, J. Y-T. and V. K. M.
Yu, "Heuristic for Minimizing the Number of Late Jobs on Two Processors," *International J. of Foundations of Computer Science*,
5:261-279, 1995.

56.* Hong, D. and J. Y-T. Leung,
"Probabilistic Analysis of k-Dimensional Packing Algorithms," *Information Processing Letters*, 55:17-24,
1995.

57.* Leung, J. Y-T. and W-D. Wei,
"Tighter Bounds on a Heuristic for a Partition Problem," *Information Processing Letters*, 56:51-57,
1995.

58.* Leung, J. Y-T., T. W. Tam and
C. S. Wong, "Heuristics for Minimizing Total Flow Time with Error Constraint*," J. of Combinatorial Math. and Combinatorial
Computing*, 19:273-295, 1995.

59.* Leung, J. Y-T. and W-D. Wei,
"Some Properties of Nonnegative Integral Matrices," *Ars Combinatoria*, 40:193-205, 1995.

60.* Leung, J. Y-T., T. W. Tam, C.
S. Wong and G. H. Young, "Routing Messages with Release Time and Deadline
Constraints," *J. of Parallel and Distributed
Computing*, 31:65-76, 1995. Also in *Proc. of Euromicro Workshop on Real Time*, 168-177,
Como, Italy, 1989.

61.* Han, S., D. Hong and J. Y-T.
Leung, "Probabilistic Analysis of a Bin Covering Algorithm," *Operations Research Letters*, 18:193-199,
1996.

62.* Leung, J. Y-T., T. W. Tam and
G. H. Young, "On-Line Routing of Real-Time Messages," *J. of Parallel and Distributed Computing*,
34:211-217, 1996. Also in *Proc. of the 11th Real-Time Systems Symposium*,
126-135, Orlando, FL, 1990.

63.* Hong, D. and J. Y-T. Leung,
"General Probabilistic Bounds for Dual Bin Packing Heuristics," *Journal of Combinatorial Math. and Combinatorial
Computing*, 24:85-96, 1997.

64.* Ho, K. I-J., J. Y-T. Leung
and W-D. Wei, "Scheduling Imprecise Computation Tasks with 0/1-Constraint," *Discrete Applied Mathematics*, 78:117-132, 1997.

65.* Leung, J. Y-T., T. W. Tam, C.
S. Wong and G. H. Young, "Minimizing Mean Flow Time with Error Constraint," *Algorithmica*, 20:101-118, 1998. Also in *Proc.
of the 10th Real-Time Systems Symposium*, 2-11, Santa Monica, CA, 1989.

66.* Dror, M., W. Kubiak and J.
Y-T. Leung, "Tree Precedence in Scheduling:
The Strong-Weak Distinction," *Information
Processing Letters*, 71:127-134, 1999.

67. *
Leung, J. Y-T., M. Dror and G. H. Young, "A Note on an Open-End Bin Packing
Problem," *J. of Scheduling, *4:201-207,
2001.

68.* Leung, J. Y-T., "A Dual
Criteria Sequencing Problem with Earliness and Tardiness Penalties," *Naval Research Logisti*cs, 49:422-431,
2002.

69.* Calvin, J. and J. Y-T. Leung,
"Average-Case Analysis of a Greedy Algorithm for 0/1 Knapsack," *Operations Research Letters, *31:202-210,
2003.

70. C. Ng, J. Y-T. Leung, and G.
Young, "Heuristics for Generalized Task System," *Proc. of the 2003 International Conference on Parallel
and Distributed Processing Techniques and Applications, *Vol. 3, pp. 1447-1453, Las
Vegas, Nevada, June 2003.

71. Leung, J. Y-T., H. Li, and M.
Pinedo, "Order Scheduling Models with Applications in Practice," *Proc. of the 1st Multidisciplinary International
Conference on Scheduling: Theory and Applications, *pp. 2-10, Nottingham, United
Kingdom, August 2003.

72.* Yang, J. and J. Y-T. Leung,
"The Ordered Open-end Bin Packing Problem," *Operations Research, *51:759-770, 2003.

73.* Leung, J. Y-T. and M. L.
Pinedo, "Minimizing Total Completion Time on Parallel Machines with Deadline
Constraints," *SIAM J. on Computing,
*32:1370-1388, 2003.

74.* Leung, J. Y-T. and M. L.
Pinedo, "A Note on the Scheduling of Parallel Machines Subject to Breakdown and
Repair," *Naval Research Logistics, *51:60-72,
2004.

75. Leung, J. Y-T. (ed.), *Handbook of Scheduling: Algorithms, Models, and
Performance Analysis, *Chapman and Hall/CRC, Boca Raton, FL, 2004., 1120 pp.

76. Leung, J. Y-T.,
"Introduction and Notation," in J. Y-T. Leung (ed.), *Handbook of Scheduling: Algorithms, Models, and
Performance Analysis, *Chapman and Hall/CRC, Boca Raton, FL, 2004.

77. Leung, J. Y-T., "A
Tutorial on Complexity," in J. Y-T. Leung (ed.), *Handbook of Scheduling: Algorithms, Models, and
Performance Analysis, *Chapman and Hall/CRC, Boca Raton, FL, 2004.

78. Leung, J. Y-T., "Some
Basic Scheduling Algorithms," in J. Y-T. Leung (ed.), *Handbook of Scheduling: Algorithms, Models, and
Performance Analysis, *Chapman and Hall/CRC, Boca Raton, FL, 2004.

79. Leung, J. Y-T.,
"Minimizing Total Weighted Error for Imprecise Computation Tasks and Related
Problems," in J. Y-T. Leung (ed.), *Handbook of
Scheduling: Algorithms, Models, and Performance Analysis, *Chapman and Hall/CRC, Boca
Raton, FL, 2004.

80.* Ho, K. I-J. and J. Y-T.
Leung, "A Dual Criteria Preemptive Scheduling Problem for Minimax Error of Imprecise
Computation Tasks," *International J. of
Foundations of Computer Science*, 15:717-731, 2004. Also in *
Proc. of the 6th Workshop on Models and Algorithms for Planning and Scheduling Problems
*, pp. 64-65, Aussois, France, March 2003.

81.* Leung, J. Y-T.,
"Improved Competitive Algorithms for Two-Processor Real-Time Systems," *International J. of Foundations of Computer Science,
*15:733-751, 2004.

82.* Leung, J. Y-T., H. Li, M. L.
Pinedo and C. Sriskandarajah, "Open Shops with Jobs Overlap - Revisited," *European Journal of Operational Research,
*163(2):569-571, 2005.

83.* Yang, J. and J. Y-T. Leung,
"A Generalization of the Weighted Set Covering Problem," *Naval Research Logistics, *52:142-149,
2005.

84.* Huo, Y. and J. Y-T. Leung,
"Online Scheduling of Precedence Constrained Tasks,"
*SIAM J. on Computing, *34:743-762, 2005.
Also in *
Proc. of the 2nd International Conference on Scheduling: Theory and Applications,
* pp. 573-584, New York, N.Y., USA, July 2005.

85.* Leung, J. Y-T., H. Li and M.
L. Pinedo, "Order Scheduling in an Environment with Dedicated Resources in
Parallel," *Journal of Scheduling, *8:355-386, 2005.

86. Leung, J. Y-T., H. Li and M.
L. Pinedo, "Order Scheduling Models: An Overview," in G. Kendall, E. K. Burke,
S. Petrovic and M. Gendreau (eds.), *Multidisciplinary
Scheduling: Theory and Applications, * pp. 37-53, Springer, 2005.

87. Leung, J. Y-T., H. Li and M. L. Pinedo,
"Scheduling Orders in Dedicated and Flexible Machine Environments," in
*Proc. of the 2nd International Conference on Scheduling: Theory and Applications,
* pp. 471-484, New York, N.Y., USA, July 2005.

88. Leung, J. Y-T. and H. Zhao,
"Scheduling Algorithms for Master-slave Systems," in * Proc. of the 2nd International Conference on Scheduling: Theory and Applications,
* pp. 501-513, New York, N.Y., USA, July 2005.

89. Krasik, V., J. Y-T. Leung,
M. Pinedo and J. Zhang, "Inventory Control and Scheduling with Facilities in
Parallel," in *
Proc. of the 2nd International Conference on Scheduling: Theory and Applications,
* pp. 740-742, New York, N.Y., USA, July 2005.

90.* Leung, J. Y-T. and H. Zhao,
"Minimizing Mean Flowtime and Makespan on Master-Slave Systems,"
*Journal of Parallel and Distributed Computing,
* 65:843-856, 2005. Also in
*Proc of the 2004 International Conference on
Parallel and Distributed Processing Techniques and Applications,* Vol. II,
pp. 939-945, Las Vegas, Nevada, 2004.

91.* Huo, Y. and J. Y-T. Leung,
"Minimizing Total Completion Time for UET Tasks with Release Time and Outtree
Precedence Constraints," *Mathematical Methods
of Operations Research, * 62(2): 275-279, 2005.

92.* Leung, J. Y-T., H. Li and M.
L. Pinedo, "Scheduling Multiple Product Types with Due Date Related Objectives,"
*European Journal of Operational Research, *
168(2): 370-389, 2006.

93.* C. Y. Lee, J. Y-T. Leung and
G. Yu, "Two Machine Scheduling under Disruptions with Transportation Considerations,"
*J. of Scheduling, *
9:35-48, 2006.

94.* Leung, J. Y-T., H. Li and M.
Pinedo, "Approximation Algorithm for Minimizing Total Weighted Completion Time of
Orders on Identical Machines in Parallel," *
Naval Research Logistics, * 53(4):243-260, 2006.

95.* Gonzalez, T., J. Y-T. Leung and M. L.
Pinedo, "Minimizing Total Completion Time on Uniform Machines with Deadline
Constraints," *ACM Transactions on Algorithms,
* 2(1):95-115, 2006.

96.* Huo, Y. and J. Y-T. Leung,
"Minimizing Mean Flow Time for UET Tasks,"
*ACM Transactions on Algorithms,
* 2(2):244-262, 2006.

97.* Leung, J. Y-T. and H. Zhao,
"Minimizing Sum of Completion Times and Makespan in Master-Slave Systems,"
* IEEE Transactions on Computers, *
55(8):985-999, 2006.

98.* Huo, Y., J. Y-T. Leung and H.
Zhao, "Bi-criteria Scheduling Problems: Number of Tardy Jobs and Maximum Weighted
Tardiness," * European Journal of Operational
Research, * 177:116-134, 2007.

99.* Huo, Y., J. Y-T. Leung and H.
Zhao, "Complexity of Two Dual Criteria Scheduling Problems,"
* Operations Research Letters, *
35:211-220, 2007.

100.* Leung, J. Y-T., H. Li and M.
Pinedo, "Scheduling Orders for Multiple Product Types to Minimize Total Weighted
Completion Time," * Discrete Applied Math., *
155:945-970, 2007.

101.* Leung, J. Y-T., H. Li and H.
Zhao, "Scheduling Two-Machine Flow Shops with Exact Delays,"
* International Journal of Foundations of
Computer Science, *
18:341-360, 2007.

102.* Leung, J. Y-T., H. Li, M.
Pinedo and J. Zhang, "Minimizing Total Weighted Completion Time when Scheduling
Orders in a Flexible Environment with Uniform Machines,"
* Information Processing Letters, *
103:119-129, 2007.

103. Leung, J. Y-T.,
"Approximation Algorithms for Imprecise Computation Tasks with 0/1 Constraint,"
in T. F. Gonzalez (ed.), *Handbook of
Approximation Algorithms and Metaheuristics, *Chapman and Hall/CRC, Boca
Raton, FL, 2007.

104. Coffman, E. G. Jr., J. Csirik
and J. Y-T. Leung, "Variants of Classical One-Dimensional Bin Packing, "
in T. F. Gonzalez (ed.), *Handbook of
Approximation Algorithms and Metaheuristics, *Chapman and Hall/CRC, Boca
Raton, FL, 2007.

105. Coffman, E. G. Jr., J. Csirik
and J. Y-T. Leung, "Variable-Sized Bin Packing and Bin Covering," in T. F.
Gonzalez (ed.), *Handbook of Approximation Algorithms
and Metaheuristics, *Chapman and Hall/CRC, Boca Raton, FL, 2007.

106. Lee, I., J. Y-T. Leung and
S. H. Son (eds.), *Handbook of Real-Time and Embedded
Systems, *Chapman and Hall/CRC, Boca Raton, FL, 2007, 800 pp.

107. Lee, I., J. Y-T. Leung
and S. H. Son, "Introduction and Overivew," in I. Lee, J. Y-T. Leung and S.
H. Son (eds.), *Handbook of Real-Time and Embedded
Systems, *Chapman and Hall/CRC, Boca Raton, FL, 2007.

108. Leung, J. Y-T., "
Imprecise Computation Model: Total Weighted Error and Maximum Weighted Error,"
in I. Lee, J. Y-T. Leung and S. H. Son (eds.), *
Handbook of Real-Time and Embedded Systems, *Chapman and Hall/CRC, Boca Raton, FL,
2007.

109. Leung, J. Y-T., "
Imprecise Computation Model: Bicriteria and Other Related Problems," in I. Lee,
J. Y-T. Leung and S. H. Son (eds.), * Handbook
of Real-Time and Embedded Systems, *Chapman and Hall/CRC, Boca Raton, FL, 2007.

110.* Wan, G., J. Y-T. Leung
and M. Pinedo, "Scheduling Imprecise Computation Tasks on Uniform Processors,"
* Information Processing Letters, *
104:45-52, 2007.

111. Wan, G., J. Y-T. Leung
and M. Pinedo, "Competitive Agent Scheduling with Controllable Processing Times,"
* Proc. of 3rd Multidisciplinary International
Conference on Scheduling: Theory and Applications, * pp. 514-522, Paris, France, 2007.

112.* Leung, J. Y-T., C. T. Ng and
T. C. Edwin Cheng, "Minimizing Sum of Completion Times for Batch Scheduling of Jobs
with Deteriorating Processing Times,"
* European Journal of Operational Research, *
187:1090-1099, 2008.

113.* Leung, J. Y-T. and H.
Zhao, "Scheduling Problems in Master-Slave Model,"
* Annals of Operations Research, *
159:215-231, 2008.

114.* Leung, J. Y-T., H. Li and M.
Pinedo, "Scheduling Orders on Either Dedicated or Flexible Machines in Parallel in
Order to Minimize Total Weighted Completion Time,"
* Annals of Operations Research, *
159:107-123, 2008.

115.* Leung, J. Y-T., C. Y. Lee,
C. W. Ng and G. H. Young, "Preemptive Multiprocessor Order Scheduling to Minimize
Total Weighted Flowtime,"
* European Journal of Operational Research, *
190:40-51, 2008.

116.* Ou, J., J. Y-T. Leung
and C.-L. Li,"Scheduling Parallel Machines with Inclusive Processing Set
Restrictions," * Naval Research Logistics, *
55:328-338, 2008.

117.* Leung, J. Y-T. and C-L. Li,
"An Asymptotic Approximation Scheme for the Concave-cost Bin Packing Problem,"
* European Journal of Operational Research, *
191:581-585, 2008.

118.* Huo, Y., J. Y-T. Leung
and X. Wang,"Online Scheduling of Equal-Processing-Time Task Systems,"
* Theoretical Computer Science, *
401:85-95, 2008.

119. Hu, X. and J. Y-T. Leung,
"Integrating Communication Cost into the Utility Accrual Model for the Resource
Allocation in Distributed Real-Time Systems," *
Proc. of the 14th IEEE International Conference on Embedded and Real-Time Computer
Systems and Applications, * pp. 217-226, Kaohsiung, Taiwan, August 2008.

120. Hu, X. and J. Y-T. Leung,
"Testing Interval Trees for Real-Time Scheduling Systems, "
* Proc. of the 14th IEEE International Conference
on Embedded and Real-Time Computer Systems and Applications, * pp. 327-336, Kaohsiung,
Taiwan, August 2008.

121.* Krasik, V., J. Y-T. Leung,
M. Pinedo and J. Zhang, "Scheduling Multiple Products on Parallel Machines with
Setup Costs," * Naval Research Logistics, *
55:654-669, 2008.

122.* Leung, J. Y-T.
and C-L. Li,"Scheduling with Processing Set Restrictions: A Survey,"
* International Journal of Production
Economics, * 116:251-262, 2008.

123.* Lee, K., J. Y-T. Leung
and M. L. Pinedo, "A Note on "An Approximation Algorithm for the Load-Balanced
Semi-Matching Problem in Weighted Bipartite Graphs","
* Information Processing Letters, *
109:608-610, 2009.

124.* Huo, Y., J. Y-T. Leung
and X. Wang,"A Fast Preemptive Scheduling Algorithm with Release Times and
Inclusive Processing Set Restrictions," *
Discrete Optimization, * 6:292-298, 2009.

125.* Lee, K., B-C. Choi,
J. Y-T. Leung and M. L. Pinedo,"Approximation Algorithms for Multi-Agent
Scheduling to Minimize Total Weighted Completion Time,"
* Information Processing Letters, *
109:913-917, 2009.

126.* Lee, K., J. Y-T. Leung
and M. L. Pinedo, "Online Scheduling on Two Uniform Machines Subject to Eligibility
Constraints," * Theoretical Computer Science, *
410:3975-3981, 2009.

127.* Lee, K., J. Y-T. Leung
and M. L. Pinedo, "A Note on Graph Balancing Problems with Restrictions,"
* Information Processing Letters, *
110:24-29, 2009.

128.* Huo, Y., J. Y-T. Leung
and X. Wang,"Preemptive Scheduling Algorithms with Nested Processing Set
Restriction," * International Journal of
Foundations of Computer Science, * 20:1147-1160, 2009.

129.* Huo, Y. and J. Y-T. Leung,
"Parallel Machine Scheduling with Nested Processing Set Restrictions,"
* European Journal of Operational Research, *
204:229-236, 2010.

130.* Choi, B-C., J. Y-T. Leung
and M. L. Pinedo,"Complexity of a Scheduling Problem with Controllable Processing
Times," * Operations Research Letters, *
38:123-126, 2010

131.* Huo, Y., J. Y-T. Leung
and X. Wang,"Integrated Production and Delivery Scheduling with Disjoint
Windows," * Discrete Applied Mathematics,
* 158:921-931, 2010.

132.* Wan, G., S. R. Vakati,
J. Y-T. Leung and M. Pinedo, "Scheduling Two Agents with Controllable
Processing Times," * European Journal
of Operational Research,* 205:528-539, 2010.

133.* Leung, J. Y-T., M. Pinedo
and G. Wan, "Competitive Two-Agent Scheduling and Its Applications," * Operations Research, * 58:458-469, 2010.

134.* Choi, B-C., K. Lee,
J. Y-T. Leung and M. L. Pinedo, "Flow Shops with Machine Maintenance: Ordered
and Proportionate Cases," * European
Journal of Operational Research, * 207:97-104, 2010.

135.* Briskorn, D., B-C. Choi,
K. Lee, J. Y-T. Leung and M. L. Pinedo, "Complexity of Single Machine Scheduling
Subject to Inventory Constraints," *
European Journal of Operational Research, * 207:605-619, 2010.

136.* Huo, Y. and J. Y-T. Leung,
"Fast Approximation Algorithms for Job Scheduling with Processing Set Restrictions,"
* Theoretical Computer Science, * 411:3947-3955,
2010.

137.* Choi, B-C., J. Y-T. Leung
and M. L. Pinedo, "A Note on Makespan Minimization in Proportionate Flow Shops,"
* Information Processing Letters, * 111:77-81,
2010.

138.* Lee, K., J. Y-T. Leung
and M. L. Pinedo "Makespan Minimization in Online Scheduling with Machine
Eligibility," * 4OR, * 8:331-364, 2010.

139.* Lee, K., J. Y-T. Leung
and M. L. Pinedo,"Scheduling Jobs with Equal Processing Times Subject to Machine
Eligibility Constraints," * Journal of
Scheduling, * 14:27-38, 2011.

140.* Briskorn, D., J. Y-T. Leung
and M. L. Pinedo,"Robust Scheduling on a Single Machine using Time Buffers,"
* IIE Transactions, * 43:383-398, 2011.

141.* Kellerer, H., J. Y-T. Leung
and C.-L. Li, "Multiple Subset Sum with Inclusive Assignment Set Restrictions,"
* Naval Research Logistics, * 58:546-563. 2011.

142.* Lee, K., J. Y-T. Leung
and M. L. Pinedo, "Coordination Mechanisms with Hybrid Local Policy,"
* Discrete Optimization, * 8:513-524, 2011.

143.* Choi, B-C., J. Y-T. Leung
and M. L. Pinedo,"Minimizing Makespan in an Ordered Flow Shop with Machine-Dependent
Processing Times," * Journal of Combinatorial
Optimizatoin, * 22:797-818, 2011.

144.* Hu, X., G. Xing and J. Y-T. Leung,
"Exploring the Interplay between Computation and Communication in Distributed Real-Time
Scheduling," * IEEE Transactions on Computers,
* 60:1759-1771, 2011.

145.* Xu, D., C-L. Li and J. Y-T. Leung,
"Berth Allocation with Time Dependent Physical Limitations on Vessels,"
* European Journal of Operational Research,
* 216:47-56, 2012.

146.* Choi, B-C., K. Lee, J. Y-T.
Leung, M. L. Pinedo and D. Briskorn, "Container Scheduling: Complexity and
Algorithms," * Productions and Operation
Management, * 21:115-129, 2012.

147.* Lee, K., J. Y-T. Leung
and M. L. Pinedo, "Coordination Mechanisms for Parallel Machine Scheduling,"
* European Journal of Operational Research,
* 220:305-313, 2012.

148.* Leung, J. Y-T., K. Lee and
M. L. Pinedo, "Bi-criteria Scheduling with Machine Assignment Costs,"
* International Journal of Production Economics,
* 139:321-329, 2012.

149.* Lee, K., B-C. Choi, J. Y-T.
Leung, M. L. Pinedo and D. Briskorn, "Minimizing the Total Weighted Delivery Time
in Container Transportation Scheduling," *
Naval Research Logistics, * 59:266-277, 2012.

150.* Briskorn, D. and J. Y-T. Leung,
"Minimizing Maximum Lateness of Jobs in Inventory Constrained Scheduling,"
* Journal of the Operational Research Society, *
1-14, 2013.

151.* Lee, K., J. Y-T. Leung and
M. L. Pinedo, "Makespan Minimization in Online Scheduling with Machine Eligibility,"
* Annals of Operations Research, * 204:189-222, 2013.

152.* Leung, J. Y-T. and Z-L. Chen,
"Integrated Production and Distribution with Fixed Delivery Departure Dates,"
* Operations Research Letters, * 41:290-293, 2013.

153.* Jia, Z-H. and J. Y-T. Leung,
"An Improved Meta-heuristic for Makespan Minimization of a Single Batch Machine with
Non-identical Job Sizes," * Computers and Operations
Research, * 46:49-58, 2014.

154.* Lee, K., J. Y-T. Leung, Z-H. Jia, W. Li,
M. L. Pinedo and B. M. T. Lin, "Fast Approximation Algorithms for Bi-criteria Scheduling with
Machine Assignment Cost," * European Journal of
Operational Research, * 238:54-64, 2014.

155.* Wang, J-Q. and J. Y-T. Leung,
"Scheduling Jobs with Equal-Processing-Time on Parallel Machines with Non-identical Capacities
to Minimize Makespan," * International Journal of Production
Economics, * 156:325-331, 2014.

156.* Li, K., J. Y-T. Leung and B-Y. Cheng,
"An Agent-based Intelligent Algorithm for Uniform Machine Scheduling to Minimize Total Completion
Time," * Applied Soft Computing, * 25:277-284, 2014.

157.* Lee, K., J. Y-T. Leung and M. L. Pinedo,
"Two Dimensional Load Balancing," * Operations
Research Letters, * 42:539-544, 2014.

158.* Jia, Z-H. and J. Y-T. Leung,
"A Meta-heuristic to Minimize Makespan for Parallel Batch Machines with Arbitrary
Job Sizes," * European Journal of Operational
Research, * 240:649-665, 2015.

159.* Cheng, B-Y., J. Y-T. Leung and K. Li,
"Integrated Scheduling of Production and Distribution to Minimize Total Cost Using an Improved Ant Colony
Optimization Method," * Computers and Industrial Engineering, *
83:217-225, 2015.

160.* Jia, Z-H., K. Li and J. Y-T. Leung,
"Effective Heuristic for Makespan Minimization in Parallel Batch Machines with Non-identical
Capacities," * International Journal of Production
Economics, * 169:1-10, 2015.

161.* Hall, N. G., J. Y-T. Leung and C-L. Li,
"The Effects of Multitasking on Operations Scheduling," *
Production and Operations Management, * 24(8):1248-1265, 2015.

162.* Li, K., Z-H. Jia and J. Y-T. Leung,
"Integrated Production and Delivery on Parallel Batching Machines," *
European Journal of Operational Research, * 247:755-763, 2015.

163.* Li, K., S-L. Yang, J. Y-T. Leung and B-Y. Cheng,
"Effective Meta-heuristic for Scheduling on Uniform Machines with Resource Dependent Release Dates,"
* International Journal of Production Research, * 53(19):5857-5872, 2015.

164.* Cheng, B-Y., J. Y-T. Leung, K. Li and S-L. Yang,
"Single Batch Machine Scheduling with Deliveries," *
Naval Research Logistics, * 62:470-482, 2015.

165.* Jia, Z-H., C. Wang and J. Y-T. Leung,
"An ACO Algorithm for Makespan Minimization in Parallel Batch Machines with Non-identical Job
Sizes and Incompatible Job Families," * Applied Soft
Computing, * 38:395-404, 2016.

166.* Li, K., X. Zhang, J. Y-T. Leung and S-L. Yang,
"Parallel Machine Scheduling Problems in Green Manufacturing Industry," *
Journal of Manufacturing Systems, * 38:98-106, 2016.

167.* Leung, J. Y-T. and C-L. Li,
"Scheduling with Processing Set Restrictions: A Literature Update," *
International Journal of Production Economics, * 175:1-11, 2016.

168.* Liu, C., J. Wang and J. Y-T. Leung,
"Solving Cell Formation and Task Scheduling in Cellular Manufacturing Systems by Discrete Bateria Foraging
Algorithm," * International Journal of Production Research, *
54(3):923-944, 2016.

169. Li, K., C. Zhou, J. Y-T. Leung and Y. Ma
"Integrated Production and Delivery with Single Machine and Multiple Vehicles,"
* Expert Systems with Applications, * 57:12-20, 2016.

170.* Liu, C., J. Wang and J. Y-T. Leung,
"Worker Assignment and Production Planning with Learning and Forgetting in Manufacturing Cells by
Hybrid Bacteria Foraging Algorithm," * Computers and
Industrial Engineering, * 96:162-179, 2016.

171.* He, C., J. Y-T. Leung, K. Lee and M. L. Pinedo,
"Improved Algorithms for Single Machine Scheduling with Release dates and Rejection,"
* Discrete Applied Mathematics, * 204:150-163, 2016.

172.* He, C., J. Y-T. Leung, K. Lee and M. L. Pinedo,
"Improved Algorithms for Single Machine Scheduling with Release dates and Rejection,"
* 4OR, * 14:41-55, 2016.

173.* Hall, N. G., J. Y-T. Leung and C-L. Li,
"Multitasking via Alternate and Shared Processing: Algorithm and Complexity,"
* Discrete Applied Mathematics, * 208:41-58, 2016.

174.* He, C., J. Y-T. Leung, K. Lee and M. L. Pinedo,
"An Improved Binary Search Algorithm for the Multiple-Choice Knapsack Problem,"
* RAIRO \--- Operations Research, * 50:995-1001, 2016.

175.* Gong H., L. Tang and J. Y-T. Leung,
"Parallel Machine Scheduling with Batch Deliveries to Minimize the Total Flow Time and the
Delivery Cost," *Naval Research Logistics, *
63:492-502, 2016.

176.* Arroyo, J.E. and J. Y-T. Leung,
"Scheduling Unrelated Parallel Batch Processing Machines with Non-identical Job Sizes
and Unequal Ready Times," * Computers and Operations
Research, * 78:117-128, 2017.

177.* Jia, Z-H., X-H. Li and J. Y-T. Leung,
"Minimizing Makespan for Arbitrary Size Jobs with Release Times on P-batch Machines with
Arbitrary Capacities," * Future Generation Computer
Systems, * 67:22-34, 2017.

178.* Arroyo, J. E. and J. Y-T. Leung,
"An Effective Iterated Greedy Algorithm for Scheduling Unrelated Parallel Batch Machines with
Non-identical Capacities and Unequal Ready Times," *Computers
and Industrial Engineering, * 105:84-100, 2017.

179.* Jia, Z-H., T-T. Wen, J. Y-T. Leung and K. Li,
"Effective Heuristics for Makespan Minimization in Parallel Batch Machines with Non-identical
Capacities and Job Release Times," *Journal of Industrial and
Management Optimization, * 13(2):977-993, 2017.

180.* Jia, Z-H., Y-L. Zhang, J. Y-T. Leung and K. Li,
"Bi-criteria Ant Colony Optimization Algorithm for Minimizing Makespan and Energy Consumption on Parallel
Batch Machines," *Applied Soft Computing, * 55:226-237, 2017.

181.* Cheng, B-Y., J. Y-T. Leung and K. Li,
"Integrated Scheduling on a Batch Machine to Minimize Production, Inventory and Distribution
Costs," *European Journal of Operational Research,
* 258:104-112, 2017.

182.* Wang, J-Q., G-Q. Fan, Y. Zhang, C-W. Zhang and
J. Y-T. Leung, "Two-agent Scheduling on a Single Parallel-batching Machine with Equal Processing Time
and Non-identical Job Sizes," *European Journal of Operational
Research, * 258:478-490, 2017.

183.* Leung, J. Y-T. and C. T. Ng,
"Fast Approximation Algorithms for Uniform Machine Scheduling with Processing Set Restrictions,"
*European Journal of Operational Research, * 260:507-513, 2017.

184.* He, C. and J. Y-T. Leung,
"Schedulig Deteriorating Jobs with Two Agents," *
Journal of Cobminatorial Optimization, * 34:362-377, 2017.

185.* Li, K., X. Zhang, J. Y-T. Leung and B-Y. Cheng,
"Integrated Production and Delivery with Multiple Factories and Multiple Customers,"
*International Journal of Systems Science: Operations and Logistics,
* 4(3):219-228, 2017.

186.* Jia, Z-H., M-L. Pei and J. Y-T. Leung,
"Multi-objective ACO Algorithms to Minimize the Makespan and the Total Rejection Cost on BPMs
with Arbitrary Job Weights," *International Journal of Systems
Science, * 48(16):3542-3557, 2017.

187.* Liu, C., J. Wang and J. Y-T. Leung,
"Integrated Bacteria Foraging Algorithm for Cellular Manufacturing in Supply Chain Considering
Facility Transfer and Production Planning," *Applied Soft
Computing, * 62:602-618, 2018.

188.* Tang, L., X. Zhao, J. Liu and J. Y-T. Leung,
"Competitive Two-agent Scheduling with Deteriorating Jobs on a Single Parallel-batching Machine,"
*European Journal of Operational Research, * Accepted for publication.

189. Campos, S.C., J.E. Arroyo and J. Y-T. Leung, "ILS and IG Meta-heuristics for the Three-stage Flow Shop Scheduling Problem to Minimize Total Tardiness with Sequence Dependent Setup Times," Working Paper.

190. Cheng, B-Y., J. Y-T. Leung, K. Li and S-L. Yang, "Integrated Optimization of Material Supplying, Manufacturing and Product Distribution: Models and Fast Algorithms," Working Paper.

191. Arroyo, J.E. and J. Y-T. Leung, "An Iterated Greedy Algorithm for Total Flow Time Minimization in Unrelated Parallel Batch Machines with Unequal Job Release Times,quot; Working Paper.

192. Wu, L., J. Y-T. Leung, Z-H. Jia and X. Li, "Deadline-Constrained Cost Optimization of Resource Provisioning for Scientific Workflow in Cloud Computing," Working Paper.

193. Jia, Z-H., X-X. Zhuo, J. Y-T. Leung and K. Li, "Integrated Production and Transportation on Parallel Batch Machines to Minimize Total Weighted Delivery Time," Working Paper.

194. Jia, Z-H., W-T. Long, J. Y-T. Leung, W. Li and K. Li, "Ant Colony Optimization Algorithm for Minimizing the Total Weighted Completion Time on Parallel Batch Mahines," Working Paper.

* -- Journal Papers.