Data reduction in integrated reverse engineering and rapid prototyping. - Y. H. Chen; C. T. Ng 001; Y. Z. Wang (Int. J. Comput. Integr. Manuf., 1999)

Three scheduling problems with deteriorating jobs to minimize the total completion time. - C. T. Ng 001; T. C. Edwin Cheng; Aleksander Bachman; Adam Janiak (Inf. Process. Lett., 2002)

Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. - C. T. Ng 001; T. C. Edwin Cheng; Jinjiang Yuan (Inf. Process. Lett., 2002)

Scheduling start time dependent jobs to minimize the total weighted completion time. - Aleksander Bachman; T. C. Edwin Cheng; Adam Janiak; C. T. Daniel Ng (J. Oper. Res. Soc., 2002)

A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints. - C. T. Ng 001; T. C. Edwin Cheng; Jinjiang Yuan (Oper. Res. Lett., 2002)

Single machine scheduling with a variable common due date and resource-dependent processing times. - C. T. Daniel Ng; T. C. Edwin Cheng; Mikhail Y. Kovalyov; Sze Sing Lam (Comput. Oper. Res., 2003)

Batch scheduling with controllable setup and processing times to minimize total completion time. - C. T. Daniel Ng; T. C. E. Cheng; Mikhail Y. Kovalyov (J. Oper. Res. Soc., 2003)

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. - C. T. Ng 001; T. C. Edwin Cheng; Jinjiang Yuan; Zhaohui Liu 001 (Oper. Res. Lett., 2003)

The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard. - T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (J. Sched., 2003)

A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs. - T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (J. Sched., 2003)

Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs. - C. T. Ng 001; T. C. Edwin Cheng; Jinjiang Yuan (J. Sched., 2003)

Single machine batch scheduling with jointly compressible setup and processing times. - C. T. Daniel Ng; T. C. Edwin Cheng; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2004)

Due-date assignment and single machine scheduling with deteriorating jobs. - T. C. E. Cheng; Liying Kang; C. T. Ng 001 (J. Oper. Res. Soc., 2004)

The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. - Jinjiang Yuan; Zhaohui Liu 001; C. T. Ng 001; T. C. Edwin Cheng (Theor. Comput. Sci., 2004)

Scheduling to Minimize Makespan with Time-Dependent Processing Times. - Liying Kang; T. C. Edwin Cheng; C. T. Ng 001; Min Zhao (ISAAC, 2005)

Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time. - C. T. Ng 001; T. C. Edwin Cheng; Adam Janiak; Mikhail Y. Kovalyov (Ann. Oper. Res., 2005)

A note on domination and minus domination numbers in cubic graphs. - Yaojun Chen; T. C. Edwin Cheng; C. T. Ng 001; Erfang Shan (Appl. Math. Lett., 2005)

Single machine scheduling to minimize total weighted tardiness. - T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan; Zhaohui Liu 001 (Eur. J. Oper. Res., 2005)

On the single machine total tardiness problem. - Zhongjun Tian; C. T. Ng 001; T. C. Edwin Cheng (Eur. J. Oper. Res., 2005)

Single machine due-date scheduling of jobs with decreasing start-time dependent processing times. - T. C. E. Cheng; L. Y. Kang; C. T. Ng 001 (Int. Trans. Oper. Res., 2005)

Minimizing Completion Time Variance with Compressible Processing Times. - C. T. Ng 001; Xiaoqiang Cai; T. C. E. Cheng; Sze Sing Lam (J. Glob. Optim., 2005)

Minimizing total completion time in a two-machine flow shop with deteriorating jobs. - Ji-Bo Wang; C. T. Daniel Ng; T. C. Edwin Cheng; Li-Li Liu (Appl. Math. Comput., 2006)

A note on acyclic domination number in graphs of diameter two. - T. C. Edwin Cheng; Yaojun Chen; C. T. Ng 001 (Discret. Appl. Math., 2006)

A new algorithm for online uniform-machine scheduling to minimize the makespan. - T. C. Edwin Cheng; C. T. Ng 001; Vladimir Kotov (Inf. Process. Lett., 2006)

A note on the complexity of the problem of two-agent scheduling on a single machine. - C. T. Ng 001; T. C. Edwin Cheng; Jinjiang Yuan (J. Comb. Optim., 2006)

An O(n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness. - Zhongjun Tian; C. T. Ng 001; T. C. Edwin Cheng (J. Sched., 2006)

Single machine batch scheduling problem with family setup times and release dates to minimize makespan. - Jinjiang Yuan; Zhaohui Liu 001; C. T. Ng 001; T. C. Edwin Cheng (J. Sched., 2006)

Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. - T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (Theor. Comput. Sci., 2006)

An improved algorithm for the p-center problem on interval graphs with unit lengths. - T. C. Edwin Cheng; Liying Kang; C. T. Ng 001 (Comput. Oper. Res., 2007)

Paired domination on interval and circular-arc graphs. - T. C. Edwin Cheng; Liying Kang; C. T. Ng 001 (Discret. Appl. Math., 2007)

The Ramsey numbers for a cycle of length six or seven versus a clique of order seven. - T. C. Edwin Cheng; Yaojun Chen; Yunqing Zhang; C. T. Ng 001 (Discret. Math., 2007)

Fixed interval scheduling: Models, applications, computational complexity and algorithms. - Mikhail Y. Kovalyov; C. T. Ng 001; T. C. Edwin Cheng (Eur. J. Oper. Res., 2007)

NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time. - Jinjiang Yuan; T. C. Edwin Cheng; C. T. Ng 001 (Eur. J. Oper. Res., 2007)

Approximability of single machine scheduling with fixed jobs to minimize total completion time. - Jinjiang Yuan; Y. X. Lin; C. T. Ng 001; T. C. Edwin Cheng (Eur. J. Oper. Res., 2007)

Due-date assignment and parallel-machine scheduling with deteriorating jobs. - T. C. E. Cheng; L. Y. Kang; C. T. Ng 001 (J. Oper. Res. Soc., 2007)

Batching and scheduling in a multi-machine flow shop. - C. T. Ng 001; Mikhail Y. Kovalyov (J. Sched., 2007)

Scheduling jobs with agreeable processing times and due dates on a single batch processing machine. - L. L. Liu; C. T. Ng 001; T. C. Edwin Cheng (Theor. Comput. Sci., 2007)

Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. - Ji-Bo Wang; C. T. Ng 001; T. C. Edwin Cheng (Comput. Oper. Res., 2008)

Group sequencing around a common due date. - T. C. Edwin Cheng; Mikhail Y. Kovalyov; C. T. Ng 001; Sze Sing Lam (Discret. Optim., 2008)

Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5. - Yaojun Chen; T. C. Edwin Cheng; C. T. Ng 001 (Discret. Math., 2008)

A survey of scheduling problems with setup times or costs. - Ali Allahverdi; C. T. Ng 001; T. C. Edwin Cheng; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2008)

Multi-agent scheduling on a single machine with max-form criteria. - T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (Eur. J. Oper. Res., 2008)

Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time. - T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (Eur. J. Oper. Res., 2008)

A discrete EOQ problem is solvable in O(logn) time. - Alexandr Kovalev; C. T. Ng 001 (Eur. J. Oper. Res., 2008)

Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times. - Joseph Y.-T. Leung; C. T. Ng 001; T. C. Edwin Cheng (Eur. J. Oper. Res., 2008)

Exact L 2-norm plane separation. - Charles Audet; Pierre Hansen; Alejandro Karam; Chi To Ng 001; Sylvain Perron (Optim. Lett., 2008)

An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines. - Q. Q. Nong; T. C. Edwin Cheng; C. T. Ng 001 (Oper. Res. Lett., 2008)

The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan. - Q. Q. Nong; C. T. Ng 001; T. C. Edwin Cheng (Oper. Res. Lett., 2008)

Batch scheduling of step deteriorating jobs. - M. S. Barketau; T. C. Edwin Cheng; C. T. Ng 001; Vladimir Kotov; Mikhail Y. Kovalyov (J. Sched., 2008)

Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times. - C. T. Ng 001; Natalja M. Matsveichuk; Yuri N. Sotskov; T. C. Edwin Cheng (Asia Pac. J. Oper. Res., 2009)

The Ramsey numbers for cycles versus wheels of odd order. - Yaojun Chen; T. C. Edwin Cheng; Zhengke Miao; C. T. Ng 001 (Appl. Math. Lett., 2009)

Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications. - Huajun Tang; T. C. E. Cheng; C. T. Ng 001 (Comput. Ind. Eng., 2009)

Bicriterion scheduling with equal processing times on a batch processing machine. - L. L. Liu; C. T. Ng 001; T. C. Edwin Cheng (Comput. Oper. Res., 2009)

Scheduling jobs with release dates on parallel batch processing machines. - L. L. Liu; C. T. Ng 001; T. C. Edwin Cheng (Discret. Appl. Math., 2009)

The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications. - C. T. Ng 001; T. C. Edwin Cheng; Vladimir Kotov; Mikhail Y. Kovalyov (Discret. Appl. Math., 2009)

Codiameters of 3-domination critical graphs with toughness more than one. - T. C. Edwin Cheng; Yaojun Chen; C. T. Ng 001 (Discret. Math., 2009)

Online scheduling on unbounded parallel-batch machines to minimize the makespan. - Ji Tian; T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (Inf. Process. Lett., 2009)

Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness. - Zhongjun Tian; C. T. Ng 001; T. C. Edwin Cheng (Oper. Res. Lett., 2009)

Two semi-online scheduling problems on two uniform machines. - C. T. Ng 001; Zhiyi Tan 001; Yong He 014; T. C. Edwin Cheng (Theor. Comput. Sci., 2009)

On scheduling unbounded batch processing machine(s). - L. L. Liu; C. T. Ng 001; T. C. Edwin Cheng (Comput. Ind. Eng., 2010)

A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. - C. T. Ng 001; Ji-Bo Wang; T. C. Edwin Cheng; L. L. Liu (Comput. Oper. Res., 2010)

"Product Partition" and related problems of scheduling and systems reliability: Computational complexity and approximation. - C. T. Ng 001; M. S. Barketau; T. C. Edwin Cheng; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2010)

A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure. - C. T. Ng 001; Mikhail Y. Kovalyov; T. C. E. Cheng (Eur. J. Oper. Res., 2010)

Pricing problem in wireless telecommunication product and service bundling. - Bibo Yang; C. T. Ng 001 (Eur. J. Oper. Res., 2010)

Evaluating the effects of distribution centres on the performance of vendor-managed inventory systems. - L. Yang; C. T. Ng 001; T. C. Edwin Cheng (Eur. J. Oper. Res., 2010)

Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan. - Ruyan Fu; T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (Inf. Process. Lett., 2010)

The loader problem: formulation, complexity and algorithms. - G. Tang; F. Chen; T. C. Edwin Cheng; C. T. Daniel Ng; Zhi-Long Chen (J. Oper. Res. Soc., 2010)

On the complexity of bi-criteria scheduling on a single batch processing machine. - L. L. Liu; C. T. Ng 001; T. C. Edwin Cheng (J. Sched., 2010)

Preemptive scheduling with simple linear deterioration on a single machine. - C. T. Ng 001; Shisheng Li; T. C. Edwin Cheng; Jinjiang Yuan (Theor. Comput. Sci., 2010)

A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting. - Q. Q. Nong; T. C. Edwin Cheng; C. T. Ng 001 (Theor. Comput. Sci., 2010)

Flowshop scheduling of deteriorating jobs on dominating machines. - C. T. Ng 001; Ji-Bo Wang; T. C. Edwin Cheng; Sze Sing Lam (Comput. Ind. Eng., 2011)

A closed-form solution for the optimal release times for the F2 deteriorating jobs ∑wjCj problem. - Edouard Wagneur; T. C. Edwin Cheng; C. T. Daniel Ng (Discret. Appl. Math., 2011)

Best semi-online algorithms for unbounded parallel batch scheduling. - Jinjiang Yuan; C. T. Ng 001; T. C. Edwin Cheng (Discret. Appl. Math., 2011)

Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. - Shisheng Li; C. T. Ng 001; T. C. Edwin Cheng; Jinjiang Yuan (Eur. J. Oper. Res., 2011)

Two-agent scheduling to minimize the total cost. - Q. Q. Nong; T. C. E. Cheng; C. T. Ng 001 (Eur. J. Oper. Res., 2011)

Optimal production strategy under demand fluctuations: Technology versus capacity. - L. Yang; C. T. Ng 001; T. C. Edwin Cheng (Eur. J. Oper. Res., 2011)

Multi-facility ordered median problems in directed networks. - Huajun Tang; T. C. Edwin Cheng; C. T. Daniel Ng (J. Syst. Sci. Complex., 2011)

A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan. - Jinjiang Yuan; Ruyan Fu; C. T. Ng 001; T. C. Edwin Cheng (J. Sched., 2011)

Online scheduling on unbounded parallel-batch machines with incompatible job families. - Ji Tian; T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (Theor. Comput. Sci., 2011)

Preemptive repayment policy for multiple loans. - C. T. Ng 001; Q. Ding; T. C. E. Cheng; Sze Sing Lam (Ann. Oper. Res., 2012)

An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. - Ji Tian; T. C. E. Cheng; C. T. Ng 001; Jinjiang Yuan (Discret. Appl. Math., 2012)

A theorem on cycle-wheel Ramsey number. - Yaojun Chen; T. C. Edwin Cheng; C. T. Ng 001; Yunqing Zhang (Discret. Math., 2012)

The unbounded parallel-batch scheduling with rejection. - L. Q. Zhang; Lingfa Lu; C. T. Ng 001 (J. Oper. Res. Soc., 2012)

On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time. - C. T. Ng 001; Lingfa Lu (J. Sched., 2012)

Optimal Policy for Inventory Transfer Between Two Depots With Backlogging. - Chi To Ng 001; Dong-Ping Song; T. C. E. Cheng (IEEE Trans. Autom. Control., 2012)

An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan. - Ruyan Fu; T. C. E. Cheng; C. T. Ng 001; Jinjiang Yuan (Oper. Res. Lett., 2013)

A note on reverse scheduling with maximum lateness objective. - S. S. Li; Peter Brucker; Chi To Ng 001; T. C. Edwin Cheng; Natalia V. Shakhlevich; Jinjiang Yuan (J. Sched., 2013)

Flexible capacity strategy with multiple market periods under demand uncertainty and investment constraint. - Liu Yang; Chi To Ng 001 (Eur. J. Oper. Res., 2014)

A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines. - Chi To Ng 001; Tai Chiu Edwin Cheng; Andrei M. Bandalouski; Mikhail Y. Kovalyov; Sze Sing Lam (J. Oper. Res. Soc., 2014)

Multi-period empty container repositioning with stochastic demand and lost sales. - B. Zhang; C. T. Ng 001; T. C. E. Cheng (J. Oper. Res. Soc., 2014)

Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan. - L. L. Liu; C. T. Ng 001; T. C. E. Cheng (Optim. Lett., 2014)

How small are shifts required in optimal preemptive schedules? - Edward G. Coffman Jr.; C. T. Ng 001; Vadim G. Timkovsky (J. Sched., 2015)

Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness. - Jinjiang Yuan; C. T. Ng 001; T. C. Edwin Cheng (J. Sched., 2015)

Single-machine batch scheduling with job processing time compatibility. - Shisheng Li; T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (Theor. Comput. Sci., 2015)

Sustainability investment under cap-and-trade regulation. - Ciwei Dong; Bin Shen 006; Pui-Sze Chow; Liu Yang; Chi To Ng 001 (Ann. Oper. Res., 2016)

An alternative approach for proving the NP-hardness of optimization problems. - T. C. E. Cheng; Yakov M. Shafransky; C. T. Ng 001 (Eur. J. Oper. Res., 2016)

A Fast Algorithm for Detecting Hidden Objects by Smart Mobile Robots. - T. C. E. Cheng; C. T. Ng 001; Eugene Levner; Boris Kriheli (SMARTCOMP, 2017)

Fast approximation algorithms for uniform machine scheduling with processing set restrictions. - Joseph Y.-T. Leung; C. T. Ng 001 (Eur. J. Oper. Res., 2017)

A multi-criterion approach to optimal vaccination planning: Method and solution. - C. T. Ng 001; T. C. E. Cheng; Dmitry Tsadikovich; Eugene Levner; Amir Elalouf; Sharon Hovav (Comput. Ind. Eng., 2018)

A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan. - Yuan Gao; Jinjiang Yuan; Chi To Ng 001; T. C. E. Cheng (Eur. J. Oper. Res., 2019)

Single Bounded Parallel-Batch Machine Scheduling with an Unavailability Constraint and Job Delivery. - Jing Fan; C. T. Ng 001; T. C. E. Cheng; Hui Shi (AAIM, 2020)

New retail versus traditional retail in e-commerce: channel establishment, price competition, and consumer recognition. - Xuan Wang; Chi To Ng 001 (Ann. Oper. Res., 2020)

Quantity Leadership for a Dual-Channel Supply Chain with Retail Service. - Ciwei Dong; Liu Yang; Chi To Ng 001 (Asia Pac. J. Oper. Res., 2020)

Scheduling with release dates and preemption to minimize multiple max-form objective functions. - Jinjiang Yuan; Chi To Ng 001; T. C. E. Cheng (Eur. J. Oper. Res., 2020)

Scheduling an autonomous robot searching for hidden targets. - T. C. E. Cheng; Boris Kriheli; Eugene Levner; C. T. Ng 001 (Ann. Oper. Res., 2021)

Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm. - Chi To Ng 001; T. C. E. Cheng; Eugene Levner; Boris Kriheli (Ann. Oper. Res., 2021)

Bicriteria scheduling to minimize total late work and maximum tardiness with preemption. - Rubing Chen; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Comput. Ind. Eng., 2021)

Effect of free-riding behavior on vaccination coverage with customer regret. - Yuqing Pan; Chi To Ng 001; T. C. E. Cheng (Comput. Ind. Eng., 2021)

Effects of imperfect IoT-enabled diagnostics on maintenance services: A system design perspective. - Mingyao Sun; Feng Wu; Chi To Ng 001; T. C. E. Cheng (Comput. Ind. Eng., 2021)

Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion. - Rubing Chen; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Eur. J. Oper. Res., 2021)

Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work. - Ruyan He; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (J. Comb. Optim., 2021)

A note on competing-agent Pareto-scheduling. - Yuan Gao; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Optim. Lett., 2021)

Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost. - Yuan Gao; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (4OR, 2022)

Preface. - Bin Shen 006; Ciwei Dong; Chi To Ng 001 (Asia Pac. J. Oper. Res., 2022)

Remanufacturing with random yield in the presence of the take-back regulation. - Jie Xu; Chunlin Luo; C. T. Ng 001; Xuehao Feng; T. C. E. Cheng (Comput. Ind. Eng., 2022)

On cycle-nice claw-free graphs. - Shanshan Zhang; Xiumei Wang; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Discret. Math., 2022)

A Study on Operational Risk and Credit Portfolio Risk Estimation Using Data Analytics. - Rongda Chen; Ze Wang; Liu Yang; Chi To Ng 001; T. C. E. Cheng (Decis. Sci., 2022)

Blockchain-enabled traceability and producer's incentive to outsource delivery. - Liu Yang; Yaodong Ni; Chi To Ng 001 (Int. J. Prod. Res., 2023)

Information sharing and coordination in a vaccine supply chain. - Yuqing Pan; C. T. Ng 001; Ciwei Dong; T. C. E. Cheng (Ann. Oper. Res., 2023)

Approximation algorithms for batch scheduling with processing set restrictions. - Xing Chai; Wenhua Li; C. T. Ng 001; T. C. E. Cheng (J. Sched., 2023)

Competition under demand uncertainty: The roles of technology and capacity strategy. - Liu Yang; Chi To Ng 001; T. C. E. Cheng; Mingyao Sun; Xuefeng Shao; Ruiqing Li (Eur. J. Oper. Res., 2024)

Knowledge Management: High-Quality Production Decisions in Partial Volume Flexibility to Create Value for Customers. - Liu Yang; Chi To Ng 001; Vikas Kumar; Xuefeng Shao; Yi Li (IEEE Trans. Engineering Management, 2024)

Operational research in health care: Overview and future research agenda. - T. C. E. Cheng; Shu Guo; Chi To Ng 001 (Comput. Ind. Eng., 2024)

Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs. - Shanshan Guo; Fei Huang 007; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Discret. Appl. Math., 2024)

Operations strategy for a construction supply chain: modular integrated construction and blockchain adoption. - Chenyi Chen; Ciwei Dong; Chi To Ng 001; Xiutian Shi (Int. Trans. Oper. Res., 2024)

Information disclosing strategy and additional online customer reviews. - Shaozeng Dong; Liu Yang; Hsin-Te Wu; Baozhen Shi; Chi To Ng 001; Yifei Wang (Enterp. Inf. Syst., 2024)

Sufficient conditions for k-factors and spanning trees of graphs. - Guoyan Ao; Ruifang Liu; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Discret. Appl. Math., 2025)

Claw-free minimal matching covered graphs. - Yipei Zhang; Xiumei Wang; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Discret. Appl. Math., 2025)

Properly colored even cycles in edge-colored complete balanced bipartite graphs. - Shanshan Guo; Fei Huang 007; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Discret. Math., 2025)

Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work. - Rubing Chen; Xinyu Dong; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Eur. J. Oper. Res., 2025)

How does consumer quality preference impact blockchain adoption in supply chains? - Benedict Jun Ma; Samuel Shuai Liu; George Q. Huang; Chi-To Ng 001 (Electron. Mark., 2025)

Even cycles and perfect matchings in planar graphs. - Shanshan Zhang; Xiumei Wang; Jinjiang Yuan; C. T. Daniel Ng; T. C. E. Cheng (Discret. Appl. Math., 2026)