C.T. Ng

6.6k total citations · 2 hit papers
189 papers, 5.0k citations indexed

About

C.T. Ng is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, C.T. Ng has authored 189 papers receiving a total of 5.0k indexed citations (citations by other indexed papers that have themselves been cited), including 124 papers in Industrial and Manufacturing Engineering, 86 papers in Computer Networks and Communications and 43 papers in Management Information Systems. Recurrent topics in C.T. Ng's work include Scheduling and Optimization Algorithms (105 papers), Optimization and Search Problems (85 papers) and Advanced Manufacturing and Logistics Optimization (70 papers). C.T. Ng is often cited by papers focused on Scheduling and Optimization Algorithms (105 papers), Optimization and Search Problems (85 papers) and Advanced Manufacturing and Logistics Optimization (70 papers). C.T. Ng collaborates with scholars based in Hong Kong, China and Belarus. C.T. Ng's co-authors include T.C.E. Cheng, Mikhail Y. Kovalyov, Jinjiang Yuan, Ali Allahverdi, Ciwei Dong, Liu Yang, Liying Kang, Bin Shen, Pui‐Sze Chow and Shisheng Li and has published in prestigious journals such as IEEE Transactions on Automatic Control, European Journal of Operational Research and International Journal of Production Economics.

In The Last Decade

C.T. Ng

182 papers receiving 4.8k citations

Hit Papers

A survey of scheduling pr... 2006 2026 2012 2019 2006 2014 250 500 750

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
C.T. Ng 3.5k 1.7k 929 740 334 189 5.0k
Chengbin Chu 5.8k 1.6× 1.3k 0.8× 1.2k 1.3× 932 1.3× 401 1.2× 301 8.6k
Chung‐Yee Lee 6.4k 1.8× 1.6k 1.0× 2.4k 2.6× 1.1k 1.5× 288 0.9× 148 8.6k
Stéphane Dauzère‐Pérès 4.2k 1.2× 578 0.3× 1.2k 1.3× 672 0.9× 108 0.3× 216 5.3k
Chelliah Sriskandarajah 4.1k 1.2× 1.0k 0.6× 477 0.5× 213 0.3× 221 0.7× 166 4.8k
Oded Berman 2.6k 0.7× 684 0.4× 1.2k 1.3× 509 0.7× 281 0.8× 222 6.2k
Feng Chu 3.6k 1.0× 375 0.2× 911 1.0× 773 1.0× 137 0.4× 239 5.7k
Michael J. Magazine 1.8k 0.5× 501 0.3× 1.7k 1.8× 755 1.0× 309 0.9× 83 3.7k
Milind Dawande 808 0.2× 918 0.5× 484 0.5× 419 0.6× 294 0.9× 151 2.7k
José M. Framiñán 4.3k 1.2× 625 0.4× 1.2k 1.3× 913 1.2× 107 0.3× 170 5.7k
S. David Wu 1.6k 0.4× 418 0.2× 1.3k 1.4× 619 0.8× 311 0.9× 61 3.1k

Countries citing papers authored by C.T. Ng

Since Specialization
Citations

This map shows the geographic impact of C.T. Ng's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by C.T. Ng with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites C.T. Ng more than expected).

Fields of papers citing papers by C.T. Ng

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by C.T. Ng. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by C.T. Ng. The network helps show where C.T. Ng may publish in the future.

Co-authorship network of co-authors of C.T. Ng

This figure shows the co-authorship network connecting the top 25 collaborators of C.T. Ng. A scholar is included among the top collaborators of C.T. Ng based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with C.T. Ng. C.T. Ng is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Huang, George Q., et al.. (2025). How does consumer quality preference impact blockchain adoption in supply chains?. Electronic Markets. 35(1). 5 indexed citations
2.
Zhan, Sha-lei, et al.. (2025). Supply chain network viability: Managing disruption risk via dynamic data and interaction models. Omega. 134. 103303–103303. 3 indexed citations
3.
Luo, Chunlin, et al.. (2024). To share or not to share: Strategic information sharing with store brand encroachment in platform markets. Transportation Research Part E Logistics and Transportation Review. 189. 103632–103632. 9 indexed citations
4.
Yang, Liu, et al.. (2024). Competition under demand uncertainty: The roles of technology and capacity strategy. European Journal of Operational Research. 317(1). 185–204. 1 indexed citations
5.
Chen, Rubing, et al.. (2024). Rescheduling to trade off between global disruption of original jobs with flexibility and scheduling cost of new jobs. Omega. 128. 103114–103114. 2 indexed citations
6.
Chen, Rubing, et al.. (2024). Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work. European Journal of Operational Research. 322(2). 467–479.
7.
Ng, C.T., et al.. (2023). Managing the quality-speed tradeoff in blockchain-supported healthcare diagnostic services. Omega. 120. 102911–102911. 7 indexed citations
8.
Chen, Rubing, et al.. (2023). Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work. Naval Research Logistics (NRL). 70(6). 537–557. 1 indexed citations
9.
Lu, Lingfa, et al.. (2022). Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work. Naval Research Logistics (NRL). 69(5). 816–837. 9 indexed citations
10.
Gao, Yuan, Jinjiang Yuan, C.T. Ng, & T.C.E. Cheng. (2021). Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost. 4OR. 20(2). 273–287. 3 indexed citations
11.
Yuan, Jinjiang, et al.. (2021). Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work. Journal of Combinatorial Optimization. 41(2). 504–525. 12 indexed citations
12.
Chen, Rubing, Jinjiang Yuan, C.T. Ng, & T.C.E. Cheng. (2020). Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion. European Journal of Operational Research. 293(1). 79–92. 6 indexed citations
13.
Zhang, Yuan, Jinjiang Yuan, C.T. Ng, & T.C.E. Cheng. (2020). Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work. Naval Research Logistics (NRL). 68(3). 378–393. 13 indexed citations
14.
Cheng, T.C.E., et al.. (2019). Scheduling an autonomous robot searching for hidden targets. Annals of Operations Research. 298(1-2). 95–109. 8 indexed citations
15.
Yuan, Jinjiang, C.T. Ng, & T.C.E. Cheng. (2019). Scheduling with release dates and preemption to minimize multiple max-form objective functions. European Journal of Operational Research. 280(3). 860–875. 22 indexed citations
16.
Chen, Rubing, Jinjiang Yuan, C.T. Ng, & T.C.E. Cheng. (2019). Single‐machine scheduling with deadlines to minimize the total weighted late work. Naval Research Logistics (NRL). 66(7). 582–595. 22 indexed citations
17.
Gao, Yuan, Jinjiang Yuan, C.T. Ng, & T.C.E. Cheng. (2018). A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan. European Journal of Operational Research. 273(1). 74–81. 25 indexed citations
18.
To, Wai Ming, Peter K.C. Lee, & C.T. Ng. (2017). Factors Contributing to Haze Pollution: Evidence from Macao, China. Energies. 10(9). 1352–1352. 6 indexed citations
19.
Li, Shisheng, T.C.E. Cheng, C.T. Ng, & Jinjiang Yuan. (2017). Two‐agent scheduling on a single sequential and compatible batching machine. Naval Research Logistics (NRL). 64(8). 628–641. 14 indexed citations
20.
Lai, Kee‐hung, et al.. (2011). Editorial : research in shipping and transport logistics. International Journal of Shipping and Transport Logistics. 3(1). 1–5. 19 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026