Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009 | ||
---|---|---|

45 | EE | L. L. Liu, C. T. Ng, T. C. Edwin Cheng: Bicriterion scheduling with equal processing times on a batch processing machine. Computers & OR 36(1): 110-118 (2009) |

44 | EE | C. T. Ng, Zhiyi Tan, Yong He, T. C. Edwin Cheng: Two semi-online scheduling problems on two uniform machines. Theor. Comput. Sci. 410(8-10): 776-792 (2009) |

2008 | ||

43 | EE | Ji-Bo Wang, C. T. Ng, T. C. Edwin Cheng: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. Computers & OR 35(8): 2684-2693 (2008) |

42 | EE | Yaojun Chen, T. C. Edwin Cheng, C. T. Ng: Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5. Discrete Mathematics 308(7): 1296-1307 (2008) |

41 | EE | T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, S. S. Lam: Group sequencing around a common due date. Discrete Optimization 5(3): 594-604 (2008) |

40 | EE | Joseph Y.-T. Leung, C. T. Ng, T. C. Edwin Cheng: Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times. European Journal of Operational Research 187(3): 1090-1099 (2008) |

39 | EE | Ali Allahverdi, C. T. Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov: A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187(3): 985-1032 (2008) |

38 | EE | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan: Multi-agent scheduling on a single machine with max-form criteria. European Journal of Operational Research 188(2): 603-609 (2008) |

37 | EE | Alexandr Kovalev, C. T. Ng: A discrete EOQ problem is solvable in O(logn) time. European Journal of Operational Research 189(3): 914-919 (2008) |

36 | EE | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan: Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time. European Journal of Operational Research 191(2): 320-331 (2008) |

35 | EE | M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov, Mikhail Y. Kovalyov: Batch scheduling of step deteriorating jobs. J. Scheduling 11(1): 17-28 (2008) |

34 | EE | Q. Q. Nong, C. T. Ng, T. C. Edwin Cheng: The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan. Oper. Res. Lett. 36(1): 61-66 (2008) |

33 | EE | Q. Q. Nong, T. C. Edwin Cheng, C. T. Ng: An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines. Oper. Res. Lett. 36(5): 584-588 (2008) |

2007 | ||

32 | EE | T. C. Edwin Cheng, Liying Kang, C. T. Ng: An improved algorithm for the p-center problem on interval graphs with unit lengths. Computers & OR 34(8): 2215-2222 (2007) |

31 | EE | T. C. Edwin Cheng, L. Y. Kang, C. T. Ng: Paired domination on interval and circular-arc graphs. Discrete Applied Mathematics 155(16): 2077-2086 (2007) |

30 | EE | 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. Discrete Mathematics 307(9-10): 1047-1053 (2007) |

29 | EE | 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. European Journal of Operational Research 178(1): 46-56 (2007) |

28 | EE | Mikhail Y. Kovalyov, C. T. Ng, T. C. Edwin Cheng: Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research 178(2): 331-342 (2007) |

27 | EE | 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. European Journal of Operational Research 178(2): 631-633 (2007) |

26 | EE | C. T. Ng, Mikhail Y. Kovalyov: Batching and scheduling in a multi-machine flow shop. J. Scheduling 10(6): 353-364 (2007) |

25 | EE | 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. Theor. Comput. Sci. 374(1-3): 159-169 (2007) |

2006 | ||

24 | EE | T. C. Edwin Cheng, Yaojun Chen, C. T. Ng: A note on acyclic domination number in graphs of diameter two. Discrete Applied Mathematics 154(6): 1019-1022 (2006) |

23 | EE | T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov: A new algorithm for online uniform-machine scheduling to minimize the makespan. Inf. Process. Lett. 99(3): 102-105 (2006) |

22 | EE | 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. J. Comb. Optim. 12(4): 387-394 (2006) |

21 | EE | Zhongjun Tian,
C. T. Ng,
T. C. Edwin Cheng:
An O(n^{2}) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness.
J. Scheduling 9(4): 343-364 (2006) |

20 | EE | 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. J. Scheduling 9(6): 499-513 (2006) |

19 | EE | 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. Theor. Comput. Sci. 362(1-3): 273-281 (2006) |

2005 | ||

18 | EE | Liying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao: Scheduling to Minimize Makespan with Time-Dependent Processing Times. ISAAC 2005: 925-933 |

17 | EE | C. T. Ng, T. C. Edwin Cheng, Adam Janiak, Mikhail Y. Kovalyov: Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time. Annals OR 133(1-4): 163-174 (2005) |

16 | EE | Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Erfang Shan: A note on domination and minus domination numbers in cubic graphs. Appl. Math. Lett. 18(9): 1062-1067 (2005) |

15 | EE | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, Z. H. Liu: Single machine scheduling to minimize total weighted tardiness. European Journal of Operational Research 165(2): 423-443 (2005) |

14 | EE | Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng: On the single machine total tardiness problem. European Journal of Operational Research 165(3): 843-846 (2005) |

2004 | ||

13 | EE | 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. Theor. Comput. Sci. 320(2-3): 199-212 (2004) |

2003 | ||

12 | C. T. Ng, T. C. Edwin Cheng, J. J. Yuan: Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs. J. Scheduling 6(4): 405-412 (2003) | |

11 | 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. J. Scheduling 6(5): 483-490 (2003) | |

10 | 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. J. Scheduling 6(6): 551-555 (2003) | |

9 | EE | 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. Oper. Res. Lett. 31(3): 323-326 (2003) |

2002 | ||

8 | EE | C. T. Ng, T. C. Edwin Cheng, Aleksander Bachman, Adam Janiak: Three scheduling problems with deteriorating jobs to minimize the total completion time. Inf. Process. Lett. 81(6): 327-333 (2002) |

7 | EE | 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. Inf. Process. Lett. 82(4): 187-191 (2002) |

6 | EE | 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. Oper. Res. Lett. 30(1): 66-68 (2002) |

1999 | ||

5 | EE | Y. H. Chen, C. T. Ng, Y. Z. Wang: Data reduction in integrated reverse engineering and rapid prototyping. Int. J. Computer Integrated Manufacturing 12(2): 97-103 (1999) |

1987 | ||

4 | 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. IEEE Transactions on Information Theory 33(1): 166- (1987) | |

1979 | ||

3 | C. T. Ng: Measures of Information with the Branching Property over a Graph and Their Representations Information and Control 41(2): 214-231 (1979) | |

1975 | ||

2 | B. Forte, C. T. Ng: Derivation of a Class of Entropies Including Those of Degree \beta Information and Control 28(4): 335-351 (1975) | |

1974 | ||

1 | C. T. Ng: Representation for Measures of Information with the Branching Property Information and Control 25(1): 45-56 (1974) |

1 | Ali Allahverdi | [39] |

2 | Aleksander Bachman | [8] |

3 | M. S. Barketau | [35] |

4 | Y. H. Chen | [5] |

5 | Yaojun Chen | [16] [24] [30] [42] |

6 | T. C. Edwin Cheng | [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [38] [39] [40] [41] [42] [43] [44] [45] |

7 | B. Forte | [2] |

8 | Yong He | [44] |

9 | Adam Janiak | [8] [17] |

10 | L. Y. Kang | [31] |

11 | Liying Kang | [18] [32] |

12 | Vladimir Kotov | [23] [35] |

13 | Alexandr Kovalev | [37] |

14 | Mikhail Y. Kovalyov | [17] [26] [28] [35] [39] [41] |

15 | S. S. Lam | [41] |

16 | Joseph Y.-T. Leung | [40] |

17 | Y. X. Lin | [29] |

18 | L. L. Liu | [25] [45] |

19 | Z. H. Liu | [15] |

20 | Zhaohui Liu | [9] [13] [20] |

21 | Q. Q. Nong | [33] [34] |

22 | Erfang Shan | [16] |

23 | Zhiyi Tan | [44] |

24 | Zhongjun Tian | [14] [21] |

25 | Ji-Bo Wang | [43] |

26 | Y. Z. Wang | [5] |

27 | Andrew K. C. Wong | [4] |

28 | J. J. Yuan | [6] [7] [9] [10] [11] [12] [13] [15] [19] [20] [22] [27] [29] [36] [38] |

29 | Yunqing Zhang | [30] |

30 | Min Zhao | [18] |