| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Yunqing Zhang |
A theorem on cycle-wheel Ramsey number.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, Lingfa Lu |
On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time. |
J. Scheduling |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, Q. Ding, T. C. E. Cheng, S. S. Lam |
Preemptive repayment policy for multiple loans. |
Annals OR |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Q. Zhang, L. F. Lu, C. T. Ng |
The unbounded parallel-batch scheduling with rejection. |
JORS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shisheng Li, C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan |
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. |
European Journal of Operational Research |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Yang, C. T. Ng, T. C. Edwin Cheng |
Optimal production strategy under demand fluctuations: Technology versus capacity. |
European Journal of Operational Research |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Q. Q. Nong, T. C. E. Cheng, C. T. Ng |
Two-agent scheduling to minimize the total cost. |
European Journal of Operational Research |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. Scheduling |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, Ji-Bo Wang, T. C. Edwin Cheng, S. S. Lam |
Flowshop scheduling of deteriorating jobs on dominating machines. |
Computers & Industrial Engineering |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng |
Best semi-online algorithms for unbounded parallel batch scheduling. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | G. Tang, F. Chen, T. C. Edwin Cheng, C. T. Daniel Ng, Zhi-Long Chen |
The loader problem: formulation, complexity and algorithms. |
JORS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, Shisheng Li, T. C. Edwin Cheng, Jinjiang Yuan |
Preemptive scheduling with simple linear deterioration on a single machine. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Yang, C. T. Ng, T. C. Edwin Cheng |
Evaluating the effects of distribution centres on the performance of vendor-managed inventory systems. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bibo Yang, C. T. Ng |
Pricing problem in wireless telecommunication product and service bundling. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | L. L. Liu, C. T. Ng, T. C. Edwin Cheng |
On the complexity of bi-criteria scheduling on a single batch processing machine. |
J. Scheduling |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | L. L. Liu, C. T. Ng, T. C. Edwin Cheng |
On scheduling unbounded batch processing machine(s). |
Computers & Industrial Engineering |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Computers & OR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, Zhiyi Tan, Yong He, T. C. Edwin Cheng |
Two semi-online scheduling problems on two uniform machines. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | T. C. Edwin Cheng, Yaojun Chen, C. T. Ng |
Codiameters of 3-domination critical graphs with toughness more than one. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaojun Chen, T. C. Edwin Cheng, Zhengke Miao, C. T. Ng |
The Ramsey numbers for cycles versus wheels of odd order. |
Appl. Math. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Huajun Tang, T. C. E. Cheng, C. T. Ng |
Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications. |
Computers & Industrial Engineering |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, Natalja M. Matsveichuk, Yuri N. Sotskov, T. C. Edwin Cheng |
Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times. |
APJOR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | L. L. Liu, C. T. Ng, T. C. Edwin Cheng |
Bicriterion scheduling with equal processing times on a batch processing machine. |
Computers & OR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, T. C. Edwin Cheng, Vladimir Kotov, Mikhail Y. Kovalyov |
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | L. L. Liu, C. T. Ng, T. C. Edwin Cheng |
Scheduling jobs with release dates on parallel batch processing machines. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, S. S. Lam |
Group sequencing around a common due date. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaojun Chen, T. C. Edwin Cheng, C. T. Ng |
Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
European Journal of Operational Research |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan |
Multi-agent scheduling on a single machine with max-form criteria. |
European Journal of Operational Research |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan |
Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time. |
European Journal of Operational Research |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Kovalev, C. T. Ng |
A discrete EOQ problem is solvable in O(logn) time. |
European Journal of Operational Research |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ali Allahverdi, C. T. Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov |
A survey of scheduling problems with setup times or costs. |
European Journal of Operational Research |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov, Mikhail Y. Kovalyov |
Batch scheduling of step deteriorating jobs. |
J. Scheduling |
2008 |
DBLP DOI BibTeX RDF |
Deterioration, Open-end bin packing, Scheduling, Batching |
| 1 | Ji-Bo Wang, C. T. Ng, T. C. Edwin Cheng |
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. |
Computers & OR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | J. J. Yuan, T. C. Edwin Cheng, C. T. Ng |
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time. |
European Journal of Operational Research |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikhail Y. Kovalyov, C. T. Ng, T. C. Edwin Cheng |
Fixed interval scheduling: Models, applications, computational complexity and algorithms. |
European Journal of Operational Research |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | J. J. Yuan, Y. X. Lin, C. T. Ng, T. C. Edwin Cheng |
Approximability of single machine scheduling with fixed jobs to minimize total completion time. |
European Journal of Operational Research |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, Mikhail Y. Kovalyov |
Batching and scheduling in a multi-machine flow shop. |
J. Scheduling |
2007 |
DBLP DOI BibTeX RDF |
Scheduling, Dynamic programming, Batching, Flow shop |
| 1 | T. C. Edwin Cheng, Liying Kang, C. T. Ng |
An improved algorithm for the p-center problem on interval graphs with unit lengths. |
Computers & OR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | T. C. Edwin Cheng, Liying Kang, C. T. Ng |
Paired domination on interval and circular-arc graphs. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Applied Mathematics and Computation |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, T. C. Edwin Cheng, J. J. Yuan |
A note on the complexity of the problem of two-agent scheduling on a single machine. |
J. Comb. Optim. |
2006 |
DBLP DOI BibTeX RDF |
Production/scheduling, Multi-agent deterministic sequencing, Games/group decisions, Cooperative sequencing |
| 1 | T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov |
A new algorithm for online uniform-machine scheduling to minimize the makespan. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan |
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | J. J. 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. Scheduling |
2006 |
DBLP DOI BibTeX RDF |
Scheduling, Makespan, Family, Batching, Release dates |
| 1 | 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. Scheduling |
2006 |
DBLP DOI BibTeX RDF |
Equal-length jobs, Total tardiness, Preemptive scheduling, Single machine, Release date |
| 1 | T. C. Edwin Cheng, Yaojun Chen, C. T. Ng |
A note on acyclic domination number in graphs of diameter two. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng |
On the single machine total tardiness problem. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, Zhaohui Liu |
Single machine scheduling to minimize total weighted tardiness. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Annals OR |
2005 |
DBLP DOI BibTeX RDF |
total weighted completion time, controllable setup and processing times, single machine scheduling, group technology |
| 1 | Liying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao |
Scheduling to Minimize Makespan with Time-Dependent Processing Times. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
fully polynomial approximation scheme, makespan, parallel machines scheduling |
| 1 | C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov |
Single machine batch scheduling with jointly compressible setup and processing times. |
European Journal of Operational Research |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | J. J. 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. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov, S. S. Lam |
Single machine scheduling with a variable common due date and resource-dependent processing times. |
Computers & OR |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, T. C. Edwin Cheng, J. J. 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. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan |
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs. |
J. Scheduling |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan |
The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard. |
J. Scheduling |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, T. C. Edwin Cheng, J. J. Yuan |
Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs. |
J. Scheduling |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, T. C. Edwin Cheng, J. J. Yuan |
A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints. |
Oper. Res. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, T. C. Edwin Cheng, J. J. Yuan |
Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Y. H. Chen, C. T. Ng, Y. Z. Wang |
Data reduction in integrated reverse engineering and rapid prototyping. |
Int. J. Computer Integrated Manufacturing |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, Andrew K. C. Wong |
On the nonuniqueness of discretization of two-dimensional probability distribution subject to the maximization of Shannon's entropy. |
IEEE Transactions on Information Theory |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng |
Measures of Information with the Branching Property over a Graph and Their Representations |
Information and Control |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | B. Forte, C. T. Ng |
Derivation of a Class of Entropies Including Those of Degree \beta |
Information and Control |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng |
Representation for Measures of Information with the Branching Property |
Information and Control |
1974 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")