J. J. Yuan

发表

Multi-agent scheduling on a single machine with max-form criteria

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2008, Eur. J. Oper. Res..

NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2007, Eur. J. Oper. Res..

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2003, Oper. Res. Lett..

A note on the complexity of the problem of two-agent scheduling on a single machine

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2006, J. Comb. Optim..

A note on reverse scheduling with maximum lateness objective

T. C. Edwin Cheng, J. J. Yuan, Peter Brucker, 2013, J. Sched..

A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times

T. C. Edwin Cheng, J. J. Yuan, A. F. Yang, 2004, Eur. J. Oper. Res..

Single machine batch scheduling problem with family setup times and release dates to minimize makespan

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2006, J. Sched..

Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2002, Inf. Process. Lett..

A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2003, J. Sched..

Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times

T. C. Edwin Cheng, J. J. Yuan, A. F. Yang, 2005, Comput. Oper. Res..

The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard

J. J. Yuan, L. F. Lu, 2007, Eur. J. Oper. Res..

A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2002, Oper. Res. Lett..

The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2003, J. Sched..

Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2008, Eur. J. Oper. Res..

Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2003, J. Sched..

Approximability of single machine scheduling with fixed jobs to minimize total completion time

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2007, Eur. J. Oper. Res..

Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2006, Theor. Comput. Sci..

The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2004, Theor. Comput. Sci..

Single machine parallel batch scheduling subject to precedence constraints

J. J. Yuan, T.C.E. Cheng, C. T. Ng, 2004 .

Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness

T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, 2015, J. Sched..

Single machine serial-batching scheduling problem with a common batch size to minimize total weighted completion time

T.C.E. Cheng, C. T. Ng, J. J. Yuan, 2007 .