C. T. Ng

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 15

Top Topics

Top Venues

Comput. Ind. Eng.

Eur. J. Oper. Res.

Ann. Oper. Res.

Publications

Shanshan Guo, Fei Huang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs. Discret. Appl. Math. 345 (2024)
Yuqing Pan, C. T. Ng, Ciwei Dong, T. C. E. Cheng
Information sharing and coordination in a vaccine supply chain. Ann. Oper. Res. 329 (1) (2023)
Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost. 4OR 20 (2) (2022)
Jie Xu, Chunlin Luo, C. T. Ng, Xuehao Feng, T. C. E. Cheng
Remanufacturing with random yield in the presence of the take-back regulation. Comput. Ind. Eng. 168 (2022)
Shanshan Zhang, Xiumei Wang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
On cycle-nice claw-free graphs. Discret. Math. 345 (7) (2022)
Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion. Eur. J. Oper. Res. 293 (1) (2021)
Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
A note on competing-agent Pareto-scheduling. Optim. Lett. 15 (1) (2021)
Ruyan He, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work. J. Comb. Optim. 41 (2) (2021)
Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
Bicriteria scheduling to minimize total late work and maximum tardiness with preemption. Comput. Ind. Eng. 159 (2021)
T. C. E. Cheng, Boris Kriheli, Eugene Levner, C. T. Ng
Scheduling an autonomous robot searching for hidden targets. Ann. Oper. Res. 298 (1) (2021)
Jing Fan, C. T. Ng, T. C. E. Cheng, Hui Shi
Single Bounded Parallel-Batch Machine Scheduling with an Unavailability Constraint and Job Delivery. AAIM (2020)
C. T. Ng, T. C. E. Cheng, Dmitry Tsadikovich, Eugene Levner, Amir Elalouf, Sharon Hovav
A multi-criterion approach to optimal vaccination planning: Method and solution. Comput. Ind. Eng. 126 (2018)
T. C. E. Cheng, C. T. Ng, Eugene Levner, Boris Kriheli
A Fast Algorithm for Detecting Hidden Objects by Smart Mobile Robots. SMARTCOMP (2017)
Joseph Y.-T. Leung, C. T. Ng
Fast approximation algorithms for uniform machine scheduling with processing set restrictions. Eur. J. Oper. Res. 260 (2) (2017)
T. C. E. Cheng, Yakov M. Shafransky, C. T. Ng
An alternative approach for proving the NP-hardness of optimization problems. Eur. J. Oper. Res. 248 (1) (2016)
Edward G. Coffman Jr., C. T. Ng, Vadim G. Timkovsky
How small are shifts required in optimal preemptive schedules? J. Sched. 18 (2) (2015)
Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng
Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness. J. Sched. 18 (2) (2015)
Shisheng Li, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
Single-machine batch scheduling with job processing time compatibility. Theor. Comput. Sci. 583 (2015)
B. Zhang, C. T. Ng, T. C. E. Cheng
Multi-period empty container repositioning with stochastic demand and lost sales. J. Oper. Res. Soc. 65 (2) (2014)
L. L. Liu, C. T. Ng, T. C. E. Cheng
Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan. Optim. Lett. 8 (1) (2014)
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) (2013)
L. Q. Zhang, L. F. Lu, C. T. Ng
The unbounded parallel-batch scheduling with rejection. J. Oper. Res. Soc. 63 (3) (2012)
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. Discret. Appl. Math. 160 (7-8) (2012)
C. T. Ng, Q. Ding, T. C. E. Cheng, Sze Sing Lam
Preemptive repayment policy for multiple loans. Ann. Oper. Res. 192 (1) (2012)
Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Yunqing Zhang
A theorem on cycle-wheel Ramsey number. Discret. Math. 312 (5) (2012)
C. T. Ng, Lingfa Lu
On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time. J. Sched. 15 (3) (2012)
Shisheng Li, C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. Eur. J. Oper. Res. 210 (3) (2011)
Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng
Best semi-online algorithms for unbounded parallel batch scheduling. Discret. Appl. Math. 159 (8) (2011)
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) (2011)
C. T. Ng, Ji-Bo Wang, T. C. Edwin Cheng, Sze Sing Lam
Flowshop scheduling of deteriorating jobs on dominating machines. Comput. Ind. Eng. 61 (3) (2011)
L. Yang, C. T. Ng, T. C. Edwin Cheng
Optimal production strategy under demand fluctuations: Technology versus capacity. Eur. J. Oper. Res. 214 (2) (2011)
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. Sched. 14 (4) (2011)
Q. Q. Nong, T. C. E. Cheng, C. T. Ng
Two-agent scheduling to minimize the total cost. Eur. J. Oper. Res. 215 (1) (2011)
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. Comput. Oper. Res. 37 (1) (2010)
L. L. Liu, C. T. Ng, T. C. Edwin Cheng
On scheduling unbounded batch processing machine(s). Comput. Ind. Eng. 58 (4) (2010)
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. Eur. J. Oper. Res. 200 (2) (2010)
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. Eur. J. Oper. Res. 207 (2) (2010)
L. L. Liu, C. T. Ng, T. C. Edwin Cheng
On the complexity of bi-criteria scheduling on a single batch processing machine. J. Sched. 13 (6) (2010)
L. Yang, C. T. Ng, T. C. Edwin Cheng
Evaluating the effects of distribution centres on the performance of vendor-managed inventory systems. Eur. J. Oper. Res. 201 (1) (2010)
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) (2010)
Bibo Yang, C. T. Ng
Pricing problem in wireless telecommunication product and service bundling. Eur. J. Oper. Res. 207 (1) (2010)
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) (2010)
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) (2010)
C. T. Ng, Natalja M. Matsveichuk, Yuri N. Sotskov, T. C. Edwin Cheng
Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times. Asia Pac. J. Oper. Res. 26 (6) (2009)
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) (2009)
T. C. Edwin Cheng, Yaojun Chen, C. T. Ng
Codiameters of 3-domination critical graphs with toughness more than one. Discret. Math. 309 (5) (2009)
Huajun Tang, T. C. E. Cheng, C. T. Ng
Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications. Comput. Ind. Eng. 57 (3) (2009)
C. T. Ng, T. C. Edwin Cheng, Vladimir Kotov, Mikhail Y. Kovalyov
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications. Discret. Appl. Math. 157 (8) (2009)
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) (2009)
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) (2009)
L. L. Liu, C. T. Ng, T. C. Edwin Cheng
Bicriterion scheduling with equal processing times on a batch processing machine. Comput. Oper. Res. 36 (1) (2009)
L. L. Liu, C. T. Ng, T. C. Edwin Cheng
Scheduling jobs with release dates on parallel batch processing machines. Discret. Appl. Math. 157 (8) (2009)
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) (2009)
Ji-Bo Wang, C. T. Ng, T. C. Edwin Cheng
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. Comput. Oper. Res. 35 (8) (2008)
Yaojun Chen, T. C. Edwin Cheng, C. T. Ng
Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5. Discret. Math. 308 (7) (2008)
M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov, Mikhail Y. Kovalyov
Batch scheduling of step deteriorating jobs. J. Sched. 11 (1) (2008)
Alexandr Kovalev, C. T. Ng
A discrete EOQ problem is solvable in O(logn) time. Eur. J. Oper. Res. 189 (3) (2008)
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) (2008)
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) (2008)
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time. Eur. J. Oper. Res. 191 (2) (2008)
Ali Allahverdi, C. T. Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov
A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187 (3) (2008)
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. Eur. J. Oper. Res. 187 (3) (2008)
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
Multi-agent scheduling on a single machine with max-form criteria. Eur. J. Oper. Res. 188 (2) (2008)
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, Sze Sing Lam
Group sequencing around a common due date. Discret. Optim. 5 (3) (2008)
Jinjiang Yuan, T. C. Edwin Cheng, C. T. Ng
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time. Eur. J. Oper. Res. 178 (2) (2007)
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) (2007)
T. C. Edwin Cheng, Liying Kang, C. T. Ng
Paired domination on interval and circular-arc graphs. Discret. Appl. Math. 155 (16) (2007)
T. C. Edwin Cheng, Liying Kang, C. T. Ng
An improved algorithm for the p-center problem on interval graphs with unit lengths. Comput. Oper. Res. 34 (8) (2007)
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. Discret. Math. 307 (9-10) (2007)
C. T. Ng, Mikhail Y. Kovalyov
Batching and scheduling in a multi-machine flow shop. J. Sched. 10 (6) (2007)
Jinjiang Yuan, Y. X. Lin, C. T. Ng, T. C. Edwin Cheng
Approximability of single machine scheduling with fixed jobs to minimize total completion time. Eur. J. Oper. Res. 178 (1) (2007)
Mikhail Y. Kovalyov, C. T. Ng, T. C. Edwin Cheng
Fixed interval scheduling: Models, applications, computational complexity and algorithms. Eur. J. Oper. Res. 178 (2) (2007)
T. C. E. Cheng, L. Y. Kang, C. T. Ng
Due-date assignment and parallel-machine scheduling with deteriorating jobs. J. Oper. Res. Soc. 58 (8) (2007)
Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng
) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness. J. Sched. 9 (4) (2006)
Jinjiang 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. Sched. 9 (6) (2006)
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theor. Comput. Sci. 362 (1-3) (2006)
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) (2006)
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
A note on the complexity of the problem of two-agent scheduling on a single machine. J. Comb. Optim. 12 (4) (2006)
T. C. Edwin Cheng, Yaojun Chen, C. T. Ng
A note on acyclic domination number in graphs of diameter two. Discret. Appl. Math. 154 (6) (2006)
Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng
On the single machine total tardiness problem. Eur. J. Oper. Res. 165 (3) (2005)
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan, Zhaohui Liu
Single machine scheduling to minimize total weighted tardiness. Eur. J. Oper. Res. 165 (2) (2005)
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. Ann. Oper. Res. 133 (1-4) (2005)
Liying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao
Scheduling to Minimize Makespan with Time-Dependent Processing Times. ISAAC (2005)
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) (2005)
C. T. Ng, Xiaoqiang Cai, T. C. E. Cheng, Sze Sing Lam
Minimizing Completion Time Variance with Compressible Processing Times. J. Glob. Optim. 31 (2) (2005)
T. C. E. Cheng, L. Y. Kang, C. T. Ng
Single machine due-date scheduling of jobs with decreasing start-time dependent processing times. Int. Trans. Oper. Res. 12 (3) (2005)
T. C. E. Cheng, Liying Kang, C. T. Ng
Due-date assignment and single machine scheduling with deteriorating jobs. J. Oper. Res. Soc. 55 (2) (2004)
Jinjiang 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) (2004)
C. T. Ng, T. C. Edwin Cheng, Jinjiang 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) (2003)
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard. J. Sched. 6 (5) (2003)
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs. J. Sched. 6 (6) (2003)
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs. J. Sched. 6 (4) (2003)
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) (2002)
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints. Oper. Res. Lett. 30 (1) (2002)
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. Inf. Process. Lett. 82 (4) (2002)
Y. H. Chen, C. T. Ng, Y. Z. Wang
Data reduction in integrated reverse engineering and rapid prototyping. Int. J. Comput. Integr. Manuf. 12 (2) (1999)