C. T. Ng
Orcid: 0000-0003-0020-8234Affiliations:
- Hong Kong Polytechnic University, Department of Logistics and Maritime Studies, Logistics Research Centre, Kowloon
According to our database1,
C. T. Ng
authored at least 125 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Operations strategy for a construction supply chain: modular integrated construction and blockchain adoption.
Int. Trans. Oper. Res., November, 2024
Discret. Appl. Math., March, 2024
Comput. Ind. Eng., January, 2024
Knowledge Management: High-Quality Production Decisions in Partial Volume Flexibility to Create Value for Customers.
IEEE Trans. Engineering Management, 2024
Eur. J. Oper. Res., 2024
2023
J. Sched., December, 2023
Ann. Oper. Res., October, 2023
Int. J. Prod. Res., 2023
2022
A Study on Operational Risk and Credit Portfolio Risk Estimation Using Data Analytics.
Decis. Sci., 2022
Comput. Ind. Eng., 2022
Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost.
4OR, 2022
2021
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work.
J. Comb. Optim., 2021
Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion.
Eur. J. Oper. Res., 2021
Effects of imperfect IoT-enabled diagnostics on maintenance services: A system design perspective.
Comput. Ind. Eng., 2021
Comput. Ind. Eng., 2021
Bicriteria scheduling to minimize total late work and maximum tardiness with preemption.
Comput. Ind. Eng., 2021
Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm.
Ann. Oper. Res., 2021
2020
Scheduling with release dates and preemption to minimize multiple max-form objective functions.
Eur. J. Oper. Res., 2020
Asia Pac. J. Oper. Res., 2020
New retail versus traditional retail in e-commerce: channel establishment, price competition, and consumer recognition.
Ann. Oper. Res., 2020
Single Bounded Parallel-Batch Machine Scheduling with an Unavailability Constraint and Job Delivery.
Proceedings of the Algorithmic Aspects in Information and Management, 2020
2019
A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan.
Eur. J. Oper. Res., 2019
2018
Comput. Ind. Eng., 2018
2017
Fast approximation algorithms for uniform machine scheduling with processing set restrictions.
Eur. J. Oper. Res., 2017
Proceedings of the 2017 IEEE International Conference on Smart Computing, 2017
2016
Eur. J. Oper. Res., 2016
2015
Theor. Comput. Sci., 2015
Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness.
J. Sched., 2015
2014
Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan.
Optim. Lett., 2014
J. Oper. Res. Soc., 2014
A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines.
J. Oper. Res. Soc., 2014
Flexible capacity strategy with multiple market periods under demand uncertainty and investment constraint.
Eur. J. Oper. Res., 2014
2013
An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan.
Oper. Res. Lett., 2013
2012
IEEE Trans. Autom. Control., 2012
On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time.
J. Sched., 2012
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times.
Discret. Appl. Math., 2012
2011
Online scheduling on unbounded parallel-batch machines with incompatible job families.
Theor. Comput. Sci., 2011
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan.
J. Sched., 2011
J. Syst. Sci. Complex., 2011
Eur. J. Oper. Res., 2011
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan.
Eur. J. Oper. Res., 2011
Discret. Appl. Math., 2011
A closed-form solution for the optimal release times for the F2 deteriorating jobs ∑w<sub>j</sub>C<sub>j</sub> problem.
Discret. Appl. Math., 2011
Comput. Ind. Eng., 2011
2010
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting.
Theor. Comput. Sci., 2010
Theor. Comput. Sci., 2010
J. Sched., 2010
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan.
Inf. Process. Lett., 2010
Evaluating the effects of distribution centres on the performance of vendor-managed inventory systems.
Eur. J. Oper. Res., 2010
Eur. J. Oper. Res., 2010
A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure.
Eur. J. Oper. Res., 2010
"Product Partition" and related problems of scheduling and systems reliability: Computational complexity and approximation.
Eur. J. Oper. Res., 2010
A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs.
Comput. Oper. Res., 2010
2009
Theor. Comput. Sci., 2009
Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness.
Oper. Res. Lett., 2009
Inf. Process. Lett., 2009
Discret. Math., 2009
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications.
Discret. Appl. Math., 2009
Discret. Appl. Math., 2009
Comput. Oper. Res., 2009
Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications.
Comput. Ind. Eng., 2009
Asia Pac. J. Oper. Res., 2009
2008
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan.
Oper. Res. Lett., 2008
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines.
Oper. Res. Lett., 2008
Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times.
Eur. J. Oper. Res., 2008
Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time.
Eur. J. Oper. Res., 2008
Eur. J. Oper. Res., 2008
Discret. Math., 2008
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint.
Comput. Oper. Res., 2008
2007
Scheduling jobs with agreeable processing times and due dates on a single batch processing machine.
Theor. Comput. Sci., 2007
J. Oper. Res. Soc., 2007
Approximability of single machine scheduling with fixed jobs to minimize total completion time.
Eur. J. Oper. Res., 2007
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time.
Eur. J. Oper. Res., 2007
Fixed interval scheduling: Models, applications, computational complexity and algorithms.
Eur. J. Oper. Res., 2007
The Ramsey numbers for a cycle of length six or seven versus a clique of order seven.
Discret. Math., 2007
Comput. Oper. Res., 2007
2006
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs.
Theor. Comput. Sci., 2006
Single machine batch scheduling problem with family setup times and release dates to minimize makespan.
J. Sched., 2006
An O(n<sup>2</sup>) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness.
J. Sched., 2006
J. Comb. Optim., 2006
Inf. Process. Lett., 2006
Discret. Appl. Math., 2006
Appl. Math. Comput., 2006
2005
J. Glob. Optim., 2005
Single machine due-date scheduling of jobs with decreasing start-time dependent processing times.
Int. Trans. Oper. Res., 2005
Eur. J. Oper. Res., 2005
Appl. Math. Lett., 2005
Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time.
Ann. Oper. Res., 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
2004
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan.
Theor. Comput. Sci., 2004
J. Oper. Res. Soc., 2004
Single machine batch scheduling with jointly compressible setup and processing times.
Eur. J. Oper. Res., 2004
2003
J. Sched., 2003
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs.
J. Sched., 2003
The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard.
J. Sched., 2003
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
Batch scheduling with controllable setup and processing times to minimize total completion time.
J. Oper. Res. Soc., 2003
Single machine scheduling with a variable common due date and resource-dependent processing times.
Comput. Oper. Res., 2003
2002
A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints.
Oper. Res. Lett., 2002
J. Oper. Res. Soc., 2002
Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
Inf. Process. Lett., 2002
Three scheduling problems with deteriorating jobs to minimize the total completion time.
Inf. Process. Lett., 2002
1999
Int. J. Comput. Integr. Manuf., 1999