C. T. Daniel Ng
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j80 |      | Ruyan Fu, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan: An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan. Oper. Res. Lett. 41(3): 216-219 (2013) |
| 2012 | ||
| j79 | | C. T. Ng, Q. Ding, T. C. E. Cheng, S. S. Lam: Preemptive repayment policy for multiple loans. Annals OR 192(1): 141-150 (2012) |
| j78 | | Ji Tian, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan: An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. Discrete Applied Mathematics 160(7-8): 1191-1210 (2012) |
| j77 | | Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Yunqing Zhang: A theorem on cycle-wheel Ramsey number. Discrete Mathematics 312(5): 1059-1061 (2012) |
| j76 | | L. Q. Zhang, L. F. Lu, C. T. Ng: The unbounded parallel-batch scheduling with rejection. JORS 63(3): 293-298 (2012) |
| j75 | | C. T. Ng, Lingfa Lu: On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time. J. Scheduling 15(3): 391-398 (2012) |
| 2011 | ||
| j74 | | C. T. Ng, Ji-Bo Wang, T. C. Edwin Cheng, S. S. Lam: Flowshop scheduling of deteriorating jobs on dominating machines. Computers & Industrial Engineering 61(3): 647-654 (2011) |
| j73 | | Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng: Best semi-online algorithms for unbounded parallel batch scheduling. Discrete Applied Mathematics 159(8): 838-847 (2011) |
| j72 | | Edouard Wagneur, T. C. Edwin Cheng, C. T. Daniel Ng: A closed-form solution for the optimal release times for the F2 deteriorating jobs ∑wjCj problem. Discrete Applied Mathematics 159(13): 1367-1376 (2011) |
| j71 | | Shisheng Li, C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. European Journal of Operational Research 210(3): 482-488 (2011) |
| j70 | | L. Yang, C. T. Ng, T. C. Edwin Cheng: Optimal production strategy under demand fluctuations: Technology versus capacity. European Journal of Operational Research 214(2): 393-402 (2011) |
| j69 | | Q. Q. Nong, T. C. E. Cheng, C. T. Ng: Two-agent scheduling to minimize the total cost. European Journal of Operational Research 215(1): 39-44 (2011) |
| j68 | | Jinjiang Yuan, Ruyan Fu, C. T. Ng, T. C. Edwin Cheng: A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan. J. Scheduling 14(4): 361-369 (2011) |
| j67 | | Ji Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan: Online scheduling on unbounded parallel-batch machines with incompatible job families. Theor. Comput. Sci. 412(22): 2380-2386 (2011) |
| 2010 | ||
| j66 | | L. L. Liu, C. T. Ng, T. C. Edwin Cheng: On scheduling unbounded batch processing machine(s). Computers & Industrial Engineering 58(4): 814-817 (2010) |
| j65 | | C. T. Ng, Ji-Bo Wang, T. C. Edwin Cheng, L. L. Liu: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. Computers & OR 37(1): 83-90 (2010) |
| j64 | | C. T. Ng, Mikhail Y. Kovalyov, T. C. E. Cheng: A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure. European Journal of Operational Research 200(2): 621-624 (2010) |
| j63 | | L. Yang, C. T. Ng, T. C. Edwin Cheng: Evaluating the effects of distribution centres on the performance of vendor-managed inventory systems. European Journal of Operational Research 201(1): 112-122 (2010) |
| j62 | | Bibo Yang, C. T. Ng: Pricing problem in wireless telecommunication product and service bundling. European Journal of Operational Research 207(1): 473-480 (2010) |
| j61 | | C. T. Ng, M. S. Barketau, T. C. Edwin Cheng, Mikhail Y. Kovalyov: "Product Partition" and related problems of scheduling and systems reliability: Computational complexity and approximation. European Journal of Operational Research 207(2): 601-604 (2010) |
| j60 | | Ruyan Fu, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan: Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan. Inf. Process. Lett. 110(11): 444-450 (2010) |
| j59 | | G. Tang, F. Chen, T. C. Edwin Cheng, C. T. Daniel Ng, Zhi-Long Chen: The loader problem: formulation, complexity and algorithms. JORS 61(5): 840-848 (2010) |
| j58 | | L. L. Liu, C. T. Ng, T. C. Edwin Cheng: On the complexity of bi-criteria scheduling on a single batch processing machine. J. Scheduling 13(6): 629-638 (2010) |
| j57 | | Q. Q. Nong, T. C. Edwin Cheng, C. T. Ng: A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting. Theor. Comput. Sci. 411(31-33): 2978-2986 (2010) |
| j56 | | C. T. Ng, Shisheng Li, T. C. Edwin Cheng, Jinjiang Yuan: Preemptive scheduling with simple linear deterioration on a single machine. Theor. Comput. Sci. 411(40-42): 3578-3586 (2010) |
| 2009 | ||
| j55 | | C. T. Ng, Natalja M. Matsveichuk, Yuri N. Sotskov, T. C. Edwin Cheng: Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times. APJOR 26(6): 715-734 (2009) |
| j54 | | Yaojun Chen, T. C. Edwin Cheng, Zhengke Miao, C. T. Ng: The Ramsey numbers for cycles versus wheels of odd order. Appl. Math. Lett. 22(12): 1875-1876 (2009) |
| j53 | | Huajun Tang, T. C. E. Cheng, C. T. Ng: Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications. Computers & Industrial Engineering 57(3): 707-712 (2009) |
| j52 | | 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) |
| j51 | | C. T. Ng, T. C. Edwin Cheng, Vladimir Kotov, Mikhail Y. Kovalyov: The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications. Discrete Applied Mathematics 157(8): 1806-1824 (2009) |
| j50 | | L. L. Liu, C. T. Ng, T. C. Edwin Cheng: Scheduling jobs with release dates on parallel batch processing machines. Discrete Applied Mathematics 157(8): 1825-1830 (2009) |
| j49 | | T. C. Edwin Cheng, Yaojun Chen, C. T. Ng: Codiameters of 3-domination critical graphs with toughness more than one. Discrete Mathematics 309(5): 1067-1078 (2009) |
| j48 | | Ji Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan: Online scheduling on unbounded parallel-batch machines to minimize the makespan. Inf. Process. Lett. 109(21-22): 1211-1215 (2009) |
| j47 | | Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng: Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness. Oper. Res. Lett. 37(5): 368-374 (2009) |
| j46 | | 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 | ||
| j45 | | 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) |
| j44 | | 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) |
| j43 | | 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) |
| j42 | | 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) |
| j41 | | 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) |
| j40 | | 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) |
| j39 | | 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) |
| j38 | | 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) |
| j37 | | 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) |
| j36 | | 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) |
| j35 | | 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) |
| 2007 | ||
| j34 | | 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) |
| j33 | | T. C. Edwin Cheng, Liying Kang, C. T. Ng: Paired domination on interval and circular-arc graphs. Discrete Applied Mathematics 155(16): 2077-2086 (2007) |
| j32 | | 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) |
| j31 | | 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) |
| j30 | | 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) |
| j29 | | 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) |
| j28 | | C. T. Ng, Mikhail Y. Kovalyov: Batching and scheduling in a multi-machine flow shop. J. Scheduling 10(6): 353-364 (2007) |
| j27 | | 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 | ||
| j26 | | Ji-Bo Wang, C. T. Daniel Ng, T. C. Edwin Cheng, Li-Li Liu: Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Applied Mathematics and Computation 180(1): 185-193 (2006) |
| j25 | | 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) |
| j24 | | 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) |
| j23 | | 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) |
| j22 | | Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng: An O(n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness. J. Scheduling 9(4): 343-364 (2006) |
| j21 | | 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) |
| j20 | | 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 | ||
| j19 | | 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) |
| j18 | | 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) |
| j17 | | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, Zhaohui Liu: Single machine scheduling to minimize total weighted tardiness. European Journal of Operational Research 165(2): 423-443 (2005) |
| j16 | | 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) |
| c1 | | Liying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao: Scheduling to Minimize Makespan with Time-Dependent Processing Times. ISAAC 2005: 925-933 |
| 2004 | ||
| j15 | | C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov: Single machine batch scheduling with jointly compressible setup and processing times. European Journal of Operational Research 153(1): 211-219 (2004) |
| j14 | | 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 | ||
| j13 | | C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov, S. S. Lam: Single machine scheduling with a variable common due date and resource-dependent processing times. Computers & OR 30(8): 1173-1185 (2003) |
| j12 | | 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) |
| j11 | | 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) |
| j10 | | 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) |
| j9 | | 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) |
| 2002 | ||
| j8 | | 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) |
| j7 | | 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) |
| j6 | | 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 | ||
| j5 | | 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 | ||
| j4 | | 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-169 (1987) |
| 1979 | ||
| j3 | | 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 | ||
| j2 | | 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 | ||
| j1 | | C. T. Ng: Representation for Measures of Information with the Branching Property. Information and Control 25(1): 45-56 (1974) |
Colors in the list of coauthors
Last update Thu May 23 15:44:31 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page