C. T. Ng
Affiliations: Hong Kong Polytechnic University, Department of Logistics and Maritime Studies, Logistics Research Centre, Kowloon
According to our database^{1},
C. T. Ng
authored at least 112 papers
between 1999 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2021
Optim. Lett., 2021
Twoagent preemptive Paretoscheduling to minimize the number of tardy jobs and total late work.
J. Comb. Optim., 2021
Singlemachine 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 IoTenabled 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 bicriterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm.
Ann. Oper. Res., 2021
Ann. Oper. Res., 2021
2020
Scheduling with release dates and preemption to minimize multiple maxform objective functions.
Eur. J. Oper. Res., 2020
Asia Pac. J. Oper. Res., 2020
New retail versus traditional retail in ecommerce: channel establishment, price competition, and consumer recognition.
Ann. Oper. Res., 2020
Single Bounded ParallelBatch Machine Scheduling with an Unavailability Constraint and Job Delivery.
Proceedings of the Algorithmic Aspects in Information and Management, 2020
2019
A further study on twoagent parallelbatch 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
Ann. Oper. Res., 2016
2015
Theor. Comput. Sci., 2015
Twoagent singlemachine scheduling with release dates and preemption to minimize the maximum lateness.
J. Sched., 2015
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 graphtheoretic 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
J. Sched., 2013
An optimal online algorithm for single parallelbatch machine scheduling with incompatible job families to minimize makespan.
Oper. Res. Lett., 2013
2012
IEEE Trans. Autom. Control., 2012
Online integrated production and outbound distribution scheduling to minimize the maximum delivery completion time.
J. Sched., 2012
J. Oper. Res. Soc., 2012
Discret. Math., 2012
An improved online algorithm for single parallelbatch machine scheduling with delivery times.
Discret. Appl. Math., 2012
Ann. Oper. Res., 2012
2011
Online scheduling on unbounded parallelbatch machines with incompatible job families.
Theor. Comput. Sci., 2011
A best online algorithm for unbounded parallelbatch scheduling with restarts to minimize makespan.
J. Sched., 2011
J. Syst. Sci. Complex., 2011
Optimal production strategy under demand fluctuations: Technology versus capacity.
Eur. J. Oper. Res., 2011
Eur. J. Oper. Res., 2011
Parallelbatch scheduling of deteriorating jobs with release dates to minimize the makespan.
Eur. J. Oper. Res., 2011
Discret. Appl. Math., 2011
A closedform 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 polynomialtime algorithm for the weighted link ring loading problem with integer demand splitting.
Theor. Comput. Sci., 2010
Theor. Comput. Sci., 2010
J. Sched., 2010
J. Oper. Res. Soc., 2010
Online scheduling on two parallelbatching machines with limited restarts to minimize the makespan.
Inf. Process. Lett., 2010
Evaluating the effects of distribution centres on the performance of vendormanaged inventory systems.
Eur. J. Oper. Res., 2010
Eur. J. Oper. Res., 2010
A simple FPTAS for a singleitem capacitated economic lotsizing 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 branchandbound algorithm for solving a twomachine flow shop problem with deteriorating jobs.
Comput. Oper. Res., 2010
Comput. Ind. Eng., 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 multifacility ordered median problem in networks and algorithmic applications.
Comput. Ind. Eng., 2009
Appl. Math. Lett., 2009
Asia Pac. J. Oper. Res., 2009
2008
J. Sched., 2008
The bounded singlemachine parallelbatching scheduling problem with family jobs and release dates to minimize makespan.
Oper. Res. Lett., 2008
An improved online algorithm for scheduling on two unrestrictive parallel batch processing machines.
Oper. Res. Lett., 2008
Optim. Lett., 2008
Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times.
Eur. J. Oper. Res., 2008
Eur. J. Oper. Res., 2008
Singlemachine scheduling of multioperation jobs without missing operations to minimize the total completion time.
Eur. J. Oper. Res., 2008
Eur. J. Oper. Res., 2008
Eur. J. Oper. Res., 2008
Discret. Math., 2008
Discret. Optim., 2008
Singlemachine scheduling with deteriorating jobs under a seriesparallel 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. Sched., 2007
J. Oper. Res. Soc., 2007
Approximability of single machine scheduling with fixed jobs to minimize total completion time.
Eur. J. Oper. Res., 2007
NPhardness of the singlevariableresource 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
Discret. Appl. Math., 2007
An improved algorithm for the pcenter problem on interval graphs with unit lengths.
Comput. Oper. Res., 2007
2006
Multiagent 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 equallength preemptive jobs on a single machine to minimize total tardiness.
J. Sched., 2006
A note on the complexity of the problem of twoagent scheduling on a single machine.
J. Comb. Optim., 2006
Inf. Process. Lett., 2006
Discret. Appl. Math., 2006
Minimizing total completion time in a twomachine flow shop with deteriorating jobs.
Appl. Math. Comput., 2006
2005
J. Glob. Optim., 2005
Single machine duedate scheduling of jobs with decreasing starttime dependent processing times.
Int. Trans. Oper. Res., 2005
Eur. J. 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 MultiOperation 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 NPHard.
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 resourcedependent 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
Scheduling start time dependent jobs to minimize the total weighted completion time.
J. Oper. Res. Soc., 2002
Strong NPhardness of the single machine multioperation 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