C. T. Ng

102 papers B 2C 1Journal 99
YearRankTypeTitle / Venue / Authors
2025 J jnl
Bicriterion parallel-machine scheduling of equal-length jobs to minimize total tardiness and number of tardy jobs.
J. Comb. Optim.
Jing Zhang, Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2025 J jnl
Claw-free minimal matching covered graphs.
Discret. Appl. Math.
Yipei Zhang, Xiumei Wang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2025 J jnl
Properly colored even cycles in edge-colored complete balanced bipartite graphs.
Discret. Math.
Shanshan Guo, Fei Huang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2025 J jnl
Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work.
Eur. J. Oper. Res.
Rubing Chen, Xinyu Dong, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2025 J jnl
Sufficient conditions for k-factors and spanning trees of graphs.
Discret. Appl. Math.
Guoyan Ao, Ruifang Liu, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2024 J jnl
Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs.
Discret. Appl. Math.
Shanshan Guo, Fei Huang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2023 J jnl
Approximation algorithms for batch scheduling with processing set restrictions.
J. Sched.
Xing Chai, Wenhua Li, C. T. Ng, T. C. E. Cheng
2023 J jnl
Information sharing and coordination in a vaccine supply chain.
Ann. Oper. Res.
Yuqing Pan, C. T. Ng, Ciwei Dong, T. C. E. Cheng
2022 J jnl
On cycle-nice claw-free graphs.
Discret. Math.
Shanshan Zhang, Xiumei Wang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2022 J jnl
Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost.
4OR
Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2022 J jnl
Remanufacturing with random yield in the presence of the take-back regulation.
Comput. Ind. Eng.
Jie Xu, Chunlin Luo, C. T. Ng, Xuehao Feng, T. C. E. Cheng
2021 J jnl
A note on competing-agent Pareto-scheduling.
Optim. Lett.
Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2021 J jnl
Bicriteria scheduling to minimize total late work and maximum tardiness with preemption.
Comput. Ind. Eng.
Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2021 J jnl
Scheduling an autonomous robot searching for hidden targets.
Ann. Oper. Res.
T. C. E. Cheng, Boris Kriheli, Eugene Levner, C. T. Ng
2021 J jnl
Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion.
Eur. J. Oper. Res.
Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2021 J jnl
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work.
J. Comb. Optim.
Ruyan He, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2020 C conf
Single Bounded Parallel-Batch Machine Scheduling with an Unavailability Constraint and Job Delivery.
AAIM
Jing Fan, C. T. Ng, T. C. E. Cheng, Hui Shi
2018 J jnl
A multi-criterion approach to optimal vaccination planning: Method and solution.
Comput. Ind. Eng.
C. T. Ng, T. C. E. Cheng, Dmitry Tsadikovich, Eugene Levner, Amir Elalouf, Sharon Hovav
2017 B conf
A Fast Algorithm for Detecting Hidden Objects by Smart Mobile Robots.
SMARTCOMP
T. C. E. Cheng, C. T. Ng, Eugene Levner, Boris Kriheli
2017 J jnl
Fast approximation algorithms for uniform machine scheduling with processing set restrictions.
Eur. J. Oper. Res.
Joseph Y.-T. Leung, C. T. Ng
2016 J jnl
An alternative approach for proving the NP-hardness of optimization problems.
Eur. J. Oper. Res.
T. C. E. Cheng, Yakov M. Shafransky, C. T. Ng
2015 J jnl
How small are shifts required in optimal preemptive schedules?
J. Sched.
Edward G. Coffman Jr., C. T. Ng, Vadim G. Timkovsky
2015 J jnl
Single-machine batch scheduling with job processing time compatibility.
Theor. Comput. Sci.
Shisheng Li, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2015 J jnl
Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness.
J. Sched.
Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng
2014 J jnl
Multi-period empty container repositioning with stochastic demand and lost sales.
J. Oper. Res. Soc.
B. Zhang, C. T. Ng, T. C. E. Cheng
2014 J jnl
Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan.
Optim. Lett.
L. L. Liu, C. T. Ng, T. C. E. Cheng
2013 J jnl
An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan.
Oper. Res. Lett.
Ruyan Fu, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan
2012 J jnl
A theorem on cycle-wheel Ramsey number.
Discret. Math.
Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Yunqing Zhang
2012 J jnl
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times.
Discret. Appl. Math.
Ji Tian, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan
2012 J jnl
On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time.
J. Sched.
C. T. Ng, Lingfa Lu
2012 J jnl
Preemptive repayment policy for multiple loans.
Ann. Oper. Res.
C. T. Ng, Q. Ding, T. C. E. Cheng, Sze Sing Lam
2012 J jnl
The unbounded parallel-batch scheduling with rejection.
J. Oper. Res. Soc.
L. Q. Zhang, Lingfa Lu, C. T. Ng
2011 J jnl
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan.
J. Sched.
Jinjiang Yuan, Ruyan Fu, C. T. Ng, T. C. Edwin Cheng
2011 J jnl
Best semi-online algorithms for unbounded parallel batch scheduling.
Discret. Appl. Math.
Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng
2011 J jnl
Flowshop scheduling of deteriorating jobs on dominating machines.
Comput. Ind. Eng.
C. T. Ng, Ji-Bo Wang, T. C. Edwin Cheng, Sze Sing Lam
2011 J jnl
Online scheduling on unbounded parallel-batch machines with incompatible job families.
Theor. Comput. Sci.
Ji Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2011 J jnl
Optimal production strategy under demand fluctuations: Technology versus capacity.
Eur. J. Oper. Res.
L. Yang, C. T. Ng, T. C. Edwin Cheng
2011 J jnl
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan.
Eur. J. Oper. Res.
Shisheng Li, C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
2011 J jnl
Two-agent scheduling to minimize the total cost.
Eur. J. Oper. Res.
Q. Q. Nong, T. C. E. Cheng, C. T. Ng
2010 J jnl
"Product Partition" and related problems of scheduling and systems reliability: Computational complexity and approximation.
Eur. J. Oper. Res.
C. T. Ng, M. S. Barketau, T. C. Edwin Cheng, Mikhail Y. Kovalyov
2010 J jnl
A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs.
Comput. Oper. Res.
C. T. Ng, Ji-Bo Wang, T. C. Edwin Cheng, L. L. Liu
2010 J jnl
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting.
Theor. Comput. Sci.
Q. Q. Nong, T. C. Edwin Cheng, C. T. Ng
2010 J jnl
A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure.
Eur. J. Oper. Res.
C. T. Ng, Mikhail Y. Kovalyov, T. C. E. Cheng
2010 J jnl
Evaluating the effects of distribution centres on the performance of vendor-managed inventory systems.
Eur. J. Oper. Res.
L. Yang, C. T. Ng, T. C. Edwin Cheng
2010 J jnl
On scheduling unbounded batch processing machine(s).
Comput. Ind. Eng.
L. L. Liu, C. T. Ng, T. C. Edwin Cheng
2010 J jnl
On the complexity of bi-criteria scheduling on a single batch processing machine.
J. Sched.
L. L. Liu, C. T. Ng, T. C. Edwin Cheng
2010 J jnl
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan.
Inf. Process. Lett.
Ruyan Fu, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2010 J jnl
Preemptive scheduling with simple linear deterioration on a single machine.
Theor. Comput. Sci.
C. T. Ng, Shisheng Li, T. C. Edwin Cheng, Jinjiang Yuan
2010 J jnl
Pricing problem in wireless telecommunication product and service bundling.
Eur. J. Oper. Res.
Bibo Yang, C. T. Ng
2009 J jnl
Bicriterion scheduling with equal processing times on a batch processing machine.
Comput. Oper. Res.
L. L. Liu, C. T. Ng, T. C. Edwin Cheng
2009 J jnl
Codiameters of 3-domination critical graphs with toughness more than one.
Discret. Math.
T. C. Edwin Cheng, Yaojun Chen, C. T. Ng
2009 J jnl
Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications.
Comput. Ind. Eng.
Huajun Tang, T. C. E. Cheng, C. T. Ng
2009 J jnl
Online scheduling on unbounded parallel-batch machines to minimize the makespan.
Inf. Process. Lett.
Ji Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2009 J jnl
Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness.
Oper. Res. Lett.
Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng
2009 J jnl
Scheduling jobs with release dates on parallel batch processing machines.
Discret. Appl. Math.
L. L. Liu, C. T. Ng, T. C. Edwin Cheng
2009 J jnl
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications.
Discret. Appl. Math.
C. T. Ng, T. C. Edwin Cheng, Vladimir Kotov, Mikhail Y. Kovalyov
2009 J jnl
The Ramsey numbers for cycles versus wheels of odd order.
Appl. Math. Lett.
Yaojun Chen, T. C. Edwin Cheng, Zhengke Miao, C. T. Ng
2009 J jnl
Two semi-online scheduling problems on two uniform machines.
Theor. Comput. Sci.
C. T. Ng, Zhiyi Tan, Yong He, T. C. Edwin Cheng
2009 J jnl
Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times.
Asia Pac. J. Oper. Res.
C. T. Ng, Natalja M. Matsveichuk, Yuri N. Sotskov, T. C. Edwin Cheng
2008 J jnl
A discrete EOQ problem is solvable in O(logn) time.
Eur. J. Oper. Res.
Alexandr Kovalev, C. T. Ng
2008 J jnl
A survey of scheduling problems with setup times or costs.
Eur. J. Oper. Res.
Ali Allahverdi, C. T. Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov
2008 J jnl
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines.
Oper. Res. Lett.
Q. Q. Nong, T. C. Edwin Cheng, C. T. Ng
2008 J jnl
Batch scheduling of step deteriorating jobs.
J. Sched.
M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov, Mikhail Y. Kovalyov
2008 J jnl
Group sequencing around a common due date.
Discret. Optim.
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, Sze Sing Lam
2008 J jnl
Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5.
Discret. Math.
Yaojun Chen, T. C. Edwin Cheng, C. T. Ng
2008 J jnl
Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times.
Eur. J. Oper. Res.
Joseph Y.-T. Leung, C. T. Ng, T. C. Edwin Cheng
2008 J jnl
Multi-agent scheduling on a single machine with max-form criteria.
Eur. J. Oper. Res.
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2008 J jnl
Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time.
Eur. J. Oper. Res.
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2008 J jnl
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint.
Comput. Oper. Res.
Ji-Bo Wang, C. T. Ng, T. C. Edwin Cheng
2008 J jnl
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan.
Oper. Res. Lett.
Q. Q. Nong, C. T. Ng, T. C. Edwin Cheng
2007 J jnl
An improved algorithm for the p-center problem on interval graphs with unit lengths.
Comput. Oper. Res.
T. C. Edwin Cheng, Liying Kang, C. T. Ng
2007 J jnl
Approximability of single machine scheduling with fixed jobs to minimize total completion time.
Eur. J. Oper. Res.
Jinjiang Yuan, Y. X. Lin, C. T. Ng, T. C. Edwin Cheng
2007 J jnl
Batching and scheduling in a multi-machine flow shop.
J. Sched.
C. T. Ng, Mikhail Y. Kovalyov
2007 J jnl
Due-date assignment and parallel-machine scheduling with deteriorating jobs.
J. Oper. Res. Soc.
T. C. E. Cheng, L. Y. Kang, C. T. Ng
2007 J jnl
Fixed interval scheduling: Models, applications, computational complexity and algorithms.
Eur. J. Oper. Res.
Mikhail Y. Kovalyov, C. T. Ng, T. C. Edwin Cheng
2007 J jnl
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time.
Eur. J. Oper. Res.
Jinjiang Yuan, T. C. Edwin Cheng, C. T. Ng
2007 J jnl
Paired domination on interval and circular-arc graphs.
Discret. Appl. Math.
T. C. Edwin Cheng, Liying Kang, C. T. Ng
2007 J jnl
Scheduling jobs with agreeable processing times and due dates on a single batch processing machine.
Theor. Comput. Sci.
L. L. Liu, C. T. Ng, T. C. Edwin Cheng
2007 J jnl
The Ramsey numbers for a cycle of length six or seven versus a clique of order seven.
Discret. Math.
T. C. Edwin Cheng, Yaojun Chen, Yunqing Zhang, C. T. Ng
2006 J jnl
A new algorithm for online uniform-machine scheduling to minimize the makespan.
Inf. Process. Lett.
T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov
2006 J jnl
A note on acyclic domination number in graphs of diameter two.
Discret. Appl. Math.
T. C. Edwin Cheng, Yaojun Chen, C. T. Ng
2006 J jnl
A note on the complexity of the problem of two-agent scheduling on a single machine.
J. Comb. Optim.
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
2006 J jnl
An O(n
J. Sched.
Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng
2006 J jnl
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs.
Theor. Comput. Sci.
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2006 J jnl
Single machine batch scheduling problem with family setup times and release dates to minimize makespan.
J. Sched.
Jinjiang Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng
2005 J jnl
A note on domination and minus domination numbers in cubic graphs.
Appl. Math. Lett.
Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Erfang Shan
2005 J jnl
Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time.
Ann. Oper. Res.
C. T. Ng, T. C. Edwin Cheng, Adam Janiak, Mikhail Y. Kovalyov
2005 J jnl
Minimizing Completion Time Variance with Compressible Processing Times.
J. Glob. Optim.
C. T. Ng, Xiaoqiang Cai, T. C. E. Cheng, Sze Sing Lam
2005 J jnl
On the single machine total tardiness problem.
Eur. J. Oper. Res.
Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng
2005 B conf
Scheduling to Minimize Makespan with Time-Dependent Processing Times.
ISAAC
Liying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao
2005 J jnl
Single machine due-date scheduling of jobs with decreasing start-time dependent processing times.
Int. Trans. Oper. Res.
T. C. E. Cheng, L. Y. Kang, C. T. Ng
2005 J jnl
Single machine scheduling to minimize total weighted tardiness.
Eur. J. Oper. Res.
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan, Zhaohui Liu
2004 J jnl
Due-date assignment and single machine scheduling with deteriorating jobs.
J. Oper. Res. Soc.
T. C. E. Cheng, Liying Kang, C. T. Ng
2004 J jnl
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan.
Theor. Comput. Sci.
Jinjiang Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng
2003 J jnl
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs.
J. Sched.
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2003 J jnl
Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs.
J. Sched.
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
2003 J jnl
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.
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan, Zhaohui Liu
2003 J jnl
The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard.
J. Sched.
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2002 J jnl
A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints.
Oper. Res. Lett.
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
2002 J jnl
Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
Inf. Process. Lett.
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
2002 J jnl
Three scheduling problems with deteriorating jobs to minimize the total completion time.
Inf. Process. Lett.
C. T. Ng, T. C. Edwin Cheng, Aleksander Bachman, Adam Janiak
1999 J jnl
Data reduction in integrated reverse engineering and rapid prototyping.
Int. J. Comput. Integr. Manuf.
Y. H. Chen, C. T. Ng, Y. Z. Wang