The SCEAS System
| |||||||

## Search the dblp DataBase
J. J. Yuan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- T. C. Edwin Cheng, J. J. Yuan, A. F. Yang
**Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2005, v:32, n:, pp:849-859 [Journal] - C. T. Ng, T. C. Edwin Cheng, J. J. Yuan
**Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:82, n:4, pp:187-191 [Journal] - C. T. Ng, T. C. Edwin Cheng, J. J. Yuan
**A note on the complexity of the problem of two-agent scheduling on a single machine.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2006, v:12, n:4, pp:387-394 [Journal] - C. T. Ng, T. C. Edwin Cheng, J. J. Yuan
**A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2002, v:30, n:1, pp:66-68 [Journal] - C. T. Ng, T. C. Edwin Cheng, J. J. Yuan, Zhaohui Liu
**On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2003, v:31, n:3, pp:323-326 [Journal] - C. T. Ng, T. C. Edwin Cheng, J. J. Yuan
**Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2003, v:6, n:4, pp:405-412 [Journal] - T. C. Edwin Cheng, C. T. Ng, J. J. Yuan
**The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2003, v:6, n:5, pp:483-490 [Journal] - T. C. Edwin Cheng, C. T. Ng, J. J. Yuan
**A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2003, v:6, n:6, pp:551-555 [Journal] - J. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng
**Single machine batch scheduling problem with family setup times and release dates to minimize makespan.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2006, v:9, n:6, pp:499-513 [Journal] - T. C. Edwin Cheng, C. T. Ng, J. J. Yuan
**Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:362, n:1-3, pp:273-281 [Journal] - J. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng
**The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:320, n:2-3, pp:199-212 [Journal] - L. F. Lu, J. J. Yuan
**The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:177, n:2, pp:1302-1309 [Journal] - J. J. Yuan, Y. X. Lin, C. T. Ng, T. C. Edwin Cheng
**Approximability of single machine scheduling with fixed jobs to minimize total completion time.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:178, n:1, pp:46-56 [Journal] - J. J. Yuan, T. C. Edwin Cheng, C. T. Ng
**NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:178, n:2, pp:631-633 [Journal] - T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, Z. H. Liu
**Single machine scheduling to minimize total weighted tardiness.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:165, n:2, pp:423-443 [Journal] - J. J. Yuan, A. F. Yang, T. C. Edwin Cheng
**A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2004, v:158, n:2, pp:525-528 [Journal]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |