The SCEAS System
| |||||||

## Search the dblp DataBase
C. T. Ng:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Liying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao
**Scheduling to Minimize Makespan with Time-Dependent Processing Times.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:925-933 [Conf] - Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Erfang Shan
**A note on domination and minus domination numbers in cubic graphs.**[Citation Graph (0, 0)][DBLP] Appl. Math. Lett., 2005, v:18, n:9, pp:1062-1067 [Journal] - T. C. Edwin Cheng, Yaojun Chen, C. T. Ng
**A note on acyclic domination number in graphs of diameter two.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:6, pp:1019-1022 [Journal] - T. C. Edwin Cheng, Yaojun Chen, Yunqing Zhang, C. T. Ng
**The Ramsey numbers for a cycle of length six or seven versus a clique of order seven.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:9-10, pp:1047-1053 [Journal] - B. Forte, C. T. Ng
**Derivation of a Class of Entropies Including Those of Degree \beta**[Citation Graph (0, 0)][DBLP] Information and Control, 1975, v:28, n:4, pp:335-351 [Journal] - C. T. Ng
**Representation for Measures of Information with the Branching Property**[Citation Graph (0, 0)][DBLP] Information and Control, 1974, v:25, n:1, pp:45-56 [Journal] - C. T. Ng
**Measures of Information with the Branching Property over a Graph and Their Representations**[Citation Graph (0, 0)][DBLP] Information and Control, 1979, v:41, n:2, pp:214-231 [Journal] - C. T. Ng, T. C. Edwin Cheng, Aleksander Bachman, Adam Janiak
**Three scheduling problems with deteriorating jobs to minimize the total completion time.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:6, pp:327-333 [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] - T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov
**A new algorithm for online uniform-machine scheduling to minimize the makespan.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:99, n:3, pp:102-105 [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] - Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng
**An O(n**[Citation Graph (0, 0)][DBLP]^{2}) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness. J. Scheduling, 2006, v:9, n:4, pp:343-364 [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. L. Liu, C. T. Ng, T. C. Edwin Cheng
**Scheduling jobs with agreeable processing times and due dates on a single batch processing machine.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:374, n:1-3, pp:159-169 [Journal] - C. T. Ng, Andrew K. C. Wong
**On the nonuniqueness of discretization of two-dimensional probability distribution subject to the maximization of Shannon's entropy.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:1, pp:166-0 [Journal] - Mikhail Y. Kovalyov, C. T. Ng, T. C. Edwin Cheng
**Fixed interval scheduling: Models, applications, computational complexity and algorithms.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:178, n:2, pp:331-342 [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] - Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng
**On the single machine total tardiness problem.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:165, n:3, pp:843-846 [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] - T. C. Edwin Cheng, L. Y. Kang, C. T. Ng
**Paired domination on interval and circular-arc graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:16, pp:2077-2086 [Journal] **The Ramsey numbers for cycles versus wheels of odd order.**[Citation Graph (, )][DBLP]**An improved algorithm for the p-center problem on interval graphs with unit lengths.**[Citation Graph (, )][DBLP]**Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint.**[Citation Graph (, )][DBLP]**Bicriterion scheduling with equal processing times on a batch processing machine.**[Citation Graph (, )][DBLP]**A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs.**[Citation Graph (, )][DBLP]**The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications.**[Citation Graph (, )][DBLP]**Scheduling jobs with release dates on parallel batch processing machines.**[Citation Graph (, )][DBLP]**Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5.**[Citation Graph (, )][DBLP]**Codiameters of 3-domination critical graphs with toughness more than one.**[Citation Graph (, )][DBLP]
Search in 0.003secs, 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 |