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 Computation, 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 Logistics, 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.* Leung, J. Y-T., M. Pinedo
and G. Wan, "Competitive Two-Agent Scheduling and Its Applications,"
Operations Research,
accepted for publication.
129.* Huo, Y., J. Y-T. Leung
and X. Wang,"Preemptive Scheduling Algorithms with Nested Processing Set
Restriction," International Journal of
Foundations of Computer Science, accepted for publication.
130.* Choi, B-C., J. Y-T. Leung
and M. L. Pinedo,"Complexity of a Scheduling Problem with Controllable Processing
Times," Operations Research Letters,
accepted for publication.
131.* Huo, Y. and J. Y-T. Leung,
"Parallel Machine Scheduling with Nested Processing Set Restrictions,"
European Journal of Operational Research,
accepted for publication.
132. Wan, G., S. R. Vakati, J. Y-T. Leung and M. Pinedo, "Scheduling Two Agents with Controllable Processing Times," Working Paper.
133. Huo, Y., J. Y-T. Leung and X. Wang,"Integrated Production and Delivery Scheduling with Disjoint Windows," Working Paper.
134. Lee, K., J. Y-T. Leung and M. L. Pinedo,"Scheduling Jobs with Equal Processing Times Subject to Machine Eligibility Constraints," Working Paper.
135. Choi, B-C., J. Y-T. Leung and M. L. Pinedo,"Minimizing Makespan in a Proportionate Flow Shop with Machine-Dependent Processing Times," Working Paper.
136. Briskorn, D., J. Y-T. Leung and M. L. Pinedo,"Robust Scheduling on a Single Machine using Time Buffers," Working Paper.
137. Choi, B-C., K. Lee, J. Y-T. Leung, M. L. Pinedo and D. Briskorn, "Container Scheduling: Complexity and Algorithms," Working Paper.
138. Briskorn, D., B-C. Choi, K. Lee, J. Y-T. Leung and M. L. Pinedo, "Complexity of Single Machine Scheduling subject to Inventory Constraints," Working Paper.
139. Choi, B-C., K. Lee, J. Y-T. Leung and M. L. Pinedo, "Flow Shops with Machine Maintenance: Ordered and Proportionate Cases," Working Paper.
140. Choi, B-C., K. Lee, J. Y-T. Leung, M. L. Pinedo and D. Briskorn, "Container Scheduling: Total Weighted Delivery Time Objective," Working Paper.
141. Lee, K., J. Y-T. Leung and M. L. Pinedo, "Coordination Mechanisms with Hybrid Local Policy," Working Paper.
142. Choi, B-C., J. Y-T. Leung and M. L. Pinedo, "A Note on Makespan Minimization of Proportionate Flow Shop," Working Paper.
143. Lee, K., J. Y-T. Leung and M. L. Pinedo, "Coordination Mechanisms for Parallel Machine Scheduling Problems," Working Paper.
144. Briskorn, D., B-C. Choi, K. Lee, J. Y-T. Leung and M. L. Pinedo, "A Genetic Algorithm for Inventory Constrained Scheduling on a Single Machine," Working Paper.
* -- Journal Papers.