# Search results for: Joseph Y-T. Leung

Applied Soft Computing > 2018 > 62 > C > 602-618

European Journal of Operational Research > 2017 > 263 > 2 > 401-411

European Journal of Operational Research > 2017 > 260 > 2 > 507-513

Applied Soft Computing > 2017 > 55 > C > 226-237

European Journal of Operational Research > 2017 > 258 > 2 > 478-490

European Journal of Operational Research > 2017 > 258 > 1 > 104-112

Computers & Industrial Engineering > 2017 > 105 > C > 84-100

Future Generation Computer Systems > 2017 > 67 > C > 22-34

Computers & Operations Research > 2017 > 78 > C > 117-128

Expert Systems with Applications > 2016 > 57 > C > 12-20

Discrete Applied Mathematics > 2016 > 208 > C > 41-58

Computers & Industrial Engineering > 2016 > 96 > C > 162-179

Discrete Applied Mathematics > 2016 > 204 > C > 150-163

International Journal of Production Economics > 2016 > 175 > C > 1-11

Lecture Notes in Computer Science > Combinatorial Optimization and Applications > Scheduling > 471-482

Lecture Notes in Computer Science > STACS 85 > 208-218

Journal of Combinatorial Optimization > 2017 > 34 > 2 > 362-377

*A*and

*B*. We are interested in generating all Pareto-optimal schedules for the two criteria: (1) the total completion time of the jobs in

*A*and the maximum cost of the jobs in

*B*, and (2) the maximum cost of the jobs in

*A*and the maximum cost of the jobs in

*B*. We show that all Pareto-optimal schedules for both...

Journal of Manufacturing Systems > 2016 > 38 > C > 98-106