default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDC. T. Ng 0001
Chi To Ng 0001 – C. T. Daniel Ng
Person information
- affiliation: Hong Kong Polytechnic University, Department of Logistics and Maritime Studies, Logistics Research Centre, Kowloon
Other persons with the same name
- C. T. Ng 0002 — University of Waterloo, Faculty of Mathematics, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j122]T. C. E. Cheng, Shu Guo, Chi To Ng:
Operational research in health care: Overview and future research agenda. Comput. Ind. Eng. 187: 109847 (2024)- [j121]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: 141-146 (2024) - [j120]Liu Yang, Chi To Ng, T. C. E. Cheng, Mingyao Sun, Xuefeng Shao, Ruiqing Li:
Competition under demand uncertainty: The roles of technology and capacity strategy. Eur. J. Oper. Res. 317(1): 185-204 (2024) - [j119]Chenyi Chen, Ciwei Dong, Chi To Ng, Xiutian Shi:
Operations strategy for a construction supply chain: modular integrated construction and blockchain adoption. Int. Trans. Oper. Res. 31(6): 3999-4024 (2024) - [j118]Liu Yang, Chi To Ng, Vikas Kumar, Xuefeng Shao, Yi Li:
Knowledge Management: High-Quality Production Decisions in Partial Volume Flexibility to Create Value for Customers. IEEE Trans. Engineering Management 71: 12699-12714 (2024) - 2023
- [j117]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): 1197-1220 (2023) - [j116]Liu Yang, Yaodong Ni, Chi To Ng:
Blockchain-enabled traceability and producer's incentive to outsource delivery. Int. J. Prod. Res. 61(11): 3811-3828 (2023) - [j115]Xing Chai, Wenhua Li, C. T. Ng, T. C. E. Cheng:
Approximation algorithms for batch scheduling with processing set restrictions. J. Sched. 26(6): 523-533 (2023) - 2022
- [j114]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): 273-287 (2022) - [j113]Bin Shen, Ciwei Dong, Chi To Ng:
Preface. Asia Pac. J. Oper. Res. 39(1): 2102003:1-2102003:8 (2022) - [j112]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: 108097 (2022) - [j111]Shanshan Zhang, Xiumei Wang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
On cycle-nice claw-free graphs. Discret. Math. 345(7): 112876 (2022) - [j110]Rongda Chen, Ze Wang, Liu Yang, Chi To Ng, T. C. E. Cheng:
A Study on Operational Risk and Credit Portfolio Risk Estimation Using Data Analytics. Decis. Sci. 53(1): 84-123 (2022) - 2021
- [j109]Chi To Ng, T. C. E. Cheng, Eugene Levner, Boris Kriheli:
Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm. Ann. Oper. Res. 296(1): 407-420 (2021) - [j108]T. C. E. Cheng, Boris Kriheli, Eugene Levner, C. T. Ng:
Scheduling an autonomous robot searching for hidden targets. Ann. Oper. Res. 298(1): 95-109 (2021) - [j107]Mingyao Sun, Feng Wu, Chi To Ng, T. C. E. Cheng:
Effects of imperfect IoT-enabled diagnostics on maintenance services: A system design perspective. Comput. Ind. Eng. 153: 107096 (2021) - [j106]Yuqing Pan, Chi To Ng, T. C. E. Cheng:
Effect of free-riding behavior on vaccination coverage with customer regret. Comput. Ind. Eng. 159: 107494 (2021) - [j105]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: 107525 (2021) - [j104]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): 79-92 (2021) - [j103]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): 504-525 (2021) - [j102]Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
A note on competing-agent Pareto-scheduling. Optim. Lett. 15(1): 249-262 (2021) - 2020
- [j101]Xuan Wang, Chi To Ng:
New retail versus traditional retail in e-commerce: channel establishment, price competition, and consumer recognition. Ann. Oper. Res. 291(1): 921-937 (2020) - [j100]Ciwei Dong, Liu Yang, Chi To Ng:
Quantity Leadership for a Dual-Channel Supply Chain with Retail Service. Asia Pac. J. Oper. Res. 37(2): 2050005:1-2050005:32 (2020) - [j99]Jinjiang Yuan, Chi To Ng, T. C. E. Cheng:
Scheduling with release dates and preemption to minimize multiple max-form objective functions. Eur. J. Oper. Res. 280(3): 860-875 (2020) - [c3]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: 525-536
2010 – 2019
- 2019
- [j98]Yuan Gao, Jinjiang Yuan, Chi To Ng, T. C. E. Cheng:
A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan. Eur. J. Oper. Res. 273(1): 74-81 (2019) - 2018
- [j97]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: 637-649 (2018) - 2017
- [j96]Joseph Y.-T. Leung, C. T. Ng:
Fast approximation algorithms for uniform machine scheduling with processing set restrictions. Eur. J. Oper. Res. 260(2): 507-513 (2017) - [c2]T. C. E. Cheng, C. T. Ng, Eugene Levner, Boris Kriheli:
A Fast Algorithm for Detecting Hidden Objects by Smart Mobile Robots. SMARTCOMP 2017: 1-6 - 2016
- [j95]Ciwei Dong, Bin Shen, Pui-Sze Chow, Liu Yang, Chi To Ng:
Sustainability investment under cap-and-trade regulation. Ann. Oper. Res. 240(2): 509-531 (2016) - [j94]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): 52-58 (2016) - 2015
- [j93]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): 147-153 (2015) - [j92]Edward G. Coffman Jr., C. T. Ng, Vadim G. Timkovsky:
How small are shifts required in optimal preemptive schedules? J. Sched. 18(2): 155-163 (2015) - [j91]Shisheng Li, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
Single-machine batch scheduling with job processing time compatibility. Theor. Comput. Sci. 583: 57-66 (2015) - 2014
- [j90]Liu Yang, Chi To Ng:
Flexible capacity strategy with multiple market periods under demand uncertainty and investment constraint. Eur. J. Oper. Res. 236(2): 511-521 (2014) - [j89]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): 302-319 (2014) - [j88]Chi To Ng, Tai Chiu Edwin Cheng, Andrei M. Bandalouski, Mikhail Y. Kovalyov, Sze Sing Lam:
A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines. J. Oper. Res. Soc. 65(10): 1571-1579 (2014) - [j87]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): 307-318 (2014) - 2013
- [j86]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) - [j85]S. S. Li, Peter Brucker, Chi To Ng, T. C. Edwin Cheng, Natalia V. Shakhlevich, Jinjiang Yuan:
A note on reverse scheduling with maximum lateness objective. J. Sched. 16(4): 417-422 (2013) - 2012
- [j84]C. T. Ng, Q. Ding, T. C. E. Cheng, Sze Sing Lam:
Preemptive repayment policy for multiple loans. Ann. Oper. Res. 192(1): 141-150 (2012) - [j83]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): 1191-1210 (2012) - [j82]Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Yunqing Zhang:
A theorem on cycle-wheel Ramsey number. Discret. Math. 312(5): 1059-1061 (2012) - [j81]L. Q. Zhang, Lingfa Lu, C. T. Ng:
The unbounded parallel-batch scheduling with rejection. J. Oper. Res. Soc. 63(3): 293-298 (2012) - [j80]C. T. Ng, Lingfa Lu:
On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time. J. Sched. 15(3): 391-398 (2012) - [j79]Chi To Ng, Dong-Ping Song, T. C. E. Cheng:
Optimal Policy for Inventory Transfer Between Two Depots With Backlogging. IEEE Trans. Autom. Control. 57(12): 3247-3252 (2012) - 2011
- [j78]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): 647-654 (2011) - [j77]Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng:
Best semi-online algorithms for unbounded parallel batch scheduling. Discret. Appl. Math. 159(8): 838-847 (2011) - [j76]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. Discret. Appl. Math. 159(13): 1367-1376 (2011) - [j75]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): 482-488 (2011) - [j74]L. Yang, C. T. Ng, T. C. Edwin Cheng:
Optimal production strategy under demand fluctuations: Technology versus capacity. Eur. J. Oper. Res. 214(2): 393-402 (2011) - [j73]Q. Q. Nong, T. C. E. Cheng, C. T. Ng:
Two-agent scheduling to minimize the total cost. Eur. J. Oper. Res. 215(1): 39-44 (2011) - [j72]Huajun Tang, T. C. Edwin Cheng, C. T. Daniel Ng:
Multi-facility ordered median problems in directed networks. J. Syst. Sci. Complex. 24(1): 61-67 (2011) - [j71]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): 361-369 (2011) - [j70]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
- [j69]L. L. Liu, C. T. Ng, T. C. Edwin Cheng:
On scheduling unbounded batch processing machine(s). Comput. Ind. Eng. 58(4): 814-817 (2010) - [j68]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): 83-90 (2010) - [j67]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): 621-624 (2010) - [j66]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): 112-122 (2010) - [j65]Bibo Yang, C. T. Ng:
Pricing problem in wireless telecommunication product and service bundling. Eur. J. Oper. Res. 207(1): 473-480 (2010) - [j64]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): 601-604 (2010) - [j63]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) - [j62]G. Tang, F. Chen, T. C. Edwin Cheng, C. T. Daniel Ng, Zhi-Long Chen:
The loader problem: formulation, complexity and algorithms. J. Oper. Res. Soc. 61(5): 840-848 (2010) - [j61]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): 629-638 (2010) - [j60]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) - [j59]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)
2000 – 2009
- 2009
- [j58]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): 715-734 (2009) - [j57]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) - [j56]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): 707-712 (2009) - [j55]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): 110-118 (2009) - [j54]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): 1806-1824 (2009) - [j53]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): 1825-1830 (2009) - [j52]T. C. Edwin Cheng, Yaojun Chen, C. T. Ng:
Codiameters of 3-domination critical graphs with toughness more than one. Discret. Math. 309(5): 1067-1078 (2009) - [j51]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) - [j50]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) - [j49]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
- [j48]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): 2684-2693 (2008) - [j47]T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, Sze Sing Lam:
Group sequencing around a common due date. Discret. Optim. 5(3): 594-604 (2008) - [j46]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): 1296-1307 (2008) - [j45]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): 985-1032 (2008) - [j44]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): 1090-1099 (2008) - [j43]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): 603-609 (2008) - [j42]Alexandr Kovalev, C. T. Ng:
A discrete EOQ problem is solvable in O(logn) time. Eur. J. Oper. Res. 189(3): 914-919 (2008) - [j41]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): 320-331 (2008) - [j40]Charles Audet, Pierre Hansen, Alejandro Karam, Chi To Ng, Sylvain Perron:
Exact L 2-norm plane separation. Optim. Lett. 2(4): 483-495 (2008) - [j39]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) - [j38]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) - [j37]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): 17-28 (2008) - 2007
- [j36]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): 2215-2222 (2007) - [j35]T. C. Edwin Cheng, Liying Kang, C. T. Ng:
Paired domination on interval and circular-arc graphs. Discret. Appl. Math. 155(16): 2077-2086 (2007) - [j34]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): 1047-1053 (2007) - [j33]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): 46-56 (2007) - [j32]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): 331-342 (2007) - [j31]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): 631-633 (2007) - [j30]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): 1103-1108 (2007) - [j29]C. T. Ng, Mikhail Y. Kovalyov:
Batching and scheduling in a multi-machine flow shop. J. Sched. 10(6): 353-364 (2007) - [j28]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
- [j27]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. Appl. Math. Comput. 180(1): 185-193 (2006) - [j26]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): 1019-1022 (2006) - [j25]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) - [j24]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): 387-394 (2006) - [j23]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. Sched. 9(4): 343-364 (2006) - [j22]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): 499-513 (2006) - [j21]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): 273-281 (2006) - 2005
- [j20]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): 163-174 (2005) - [j19]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) - [j18]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): 423-443 (2005) - [j17]Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng:
On the single machine total tardiness problem. Eur. J. Oper. Res. 165(3): 843-846 (2005) - [j16]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): 355-366 (2005) - [j15]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): 333-352 (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
- [j14]C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Single machine batch scheduling with jointly compressible setup and processing times. Eur. J. Oper. Res. 153(1): 211-219 (2004) - [j13]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): 198-203 (2004) - [j12]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): 199-212 (2004) - 2003
- [j11]C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov, Sze Sing Lam:
Single machine scheduling with a variable common due date and resource-dependent processing times. Comput. Oper. Res. 30(8): 1173-1185 (2003) - [j10]C. T. Daniel Ng, T. C. E. Cheng, Mikhail Y. Kovalyov:
Batch scheduling with controllable setup and processing times to minimize total completion time. J. Oper. Res. Soc. 54(5): 499-506 (2003) - [j9]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): 323-326 (2003) - [j8]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): 405-412 (2003) - [j7]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): 483-490 (2003) - [j6]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): 551-555 (2003) - 2002
- [j5]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) - [j4]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): 187-191 (2002) - [j3]Aleksander Bachman, T. C. Edwin Cheng, Adam Janiak, C. T. Daniel Ng:
Scheduling start time dependent jobs to minimize the total weighted completion time. J. Oper. Res. Soc. 53(6): 688-693 (2002) - [j2]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): 66-68 (2002)
1990 – 1999
- 1999
- [j1]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): 97-103 (1999)
Coauthor Index
[j122] [j121] [j120] [j117] [j115] [j114] [j112] [j111] [j110] [j109] [j108] [j107] [j106] [j105] [j104] [j103] [j102] [j99] [c3] [j98] [j97] [c2] [j94] [j93] [j91] [j89] [j88] [j87] [j86] [j85] [j84] [j83] [j82] [j79] [j78] [j77] [j76] [j75] [j74] [j73] [j72] [j71] [j70] [j69] [j68] [j67] [j66] [j64] [j63] [j62] [j61] [j60] [j59] [j58] [j57] [j56] [j55] [j54] [j53] [j52] [j51] [j50] [j49] [j48] [j47] [j46] [j45] [j44] [j43] [j41] [j39] [j38] [j37] [j36] [j35] [j34] [j33] [j32] [j31] [j30] [j28] [j27] [j26] [j25] [j24] [j23] [j22] [j21] [j20] [j19] [j18] [j17] [j16] [j15] [c1] [j14] [j13] [j12] [j11] [j10] [j9] [j8] [j7] [j6] [j5] [j4] [j3] [j2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
