C. T. Ng

Affiliations:
  • Hong Kong Polytechnic University, Department of Logistics and Maritime Studies, Logistics Research Centre, Kowloon


According to our database1, C. T. Ng authored at least 112 papers between 1999 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A note on competing-agent Pareto-scheduling.
Optim. Lett., 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

Effect of free-riding behavior on vaccination coverage with customer regret.
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

Scheduling an autonomous robot searching for hidden targets.
Ann. Oper. Res., 2021

2020
Scheduling with release dates and preemption to minimize multiple max-form objective functions.
Eur. J. Oper. Res., 2020

Quantity Leadership for a Dual-Channel Supply Chain with Retail Service.
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
A multi-criterion approach to optimal vaccination planning: Method and solution.
Comput. Ind. Eng., 2018

2017
Fast approximation algorithms for uniform machine scheduling with processing set restrictions.
Eur. J. Oper. Res., 2017

A Fast Algorithm for Detecting Hidden Objects by Smart Mobile Robots.
Proceedings of the 2017 IEEE International Conference on Smart Computing, 2017

2016
An alternative approach for proving the NP-hardness of optimization problems.
Eur. J. Oper. Res., 2016

Sustainability investment under cap-and-trade regulation.
Ann. Oper. Res., 2016

2015
Single-machine batch scheduling with job processing time compatibility.
Theor. Comput. Sci., 2015

Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness.
J. Sched., 2015

How small are shifts required in optimal preemptive schedules?
J. Sched., 2015

2014
Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan.
Optim. Lett., 2014

Multi-period empty container repositioning with stochastic demand and lost sales.
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
A note on reverse scheduling with maximum lateness objective.
J. Sched., 2013

An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan.
Oper. Res. Lett., 2013

2012
Optimal Policy for Inventory Transfer Between Two Depots With Backlogging.
IEEE Trans. Autom. Control., 2012

On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time.
J. Sched., 2012

The unbounded parallel-batch scheduling with rejection.
J. Oper. Res. Soc., 2012

A theorem on cycle-wheel Ramsey number.
Discret. Math., 2012

An improved on-line algorithm for single parallel-batch machine scheduling with delivery times.
Discret. Appl. Math., 2012

Preemptive repayment policy for multiple loans.
Ann. Oper. Res., 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

Multi-facility ordered median problems in directed networks.
J. Syst. Sci. Complex., 2011

Optimal production strategy under demand fluctuations: Technology versus capacity.
Eur. J. Oper. Res., 2011

Two-agent scheduling to minimize the total cost.
Eur. J. Oper. Res., 2011

Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan.
Eur. J. Oper. Res., 2011

Best semi-online algorithms for unbounded parallel batch scheduling.
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

Flowshop scheduling of deteriorating jobs on dominating machines.
Comput. Ind. Eng., 2011

2010
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting.
Theor. Comput. Sci., 2010

Preemptive scheduling with simple linear deterioration on a single machine.
Theor. Comput. Sci., 2010

On the complexity of bi-criteria scheduling on a single batch processing machine.
J. Sched., 2010

The loader problem: formulation, complexity and algorithms.
J. Oper. Res. Soc., 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

Pricing problem in wireless telecommunication product and service bundling.
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

On scheduling unbounded batch processing machine(s).
Comput. Ind. Eng., 2010

2009
Two semi-online scheduling problems on two uniform machines.
Theor. Comput. Sci., 2009

Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness.
Oper. Res. Lett., 2009

Online scheduling on unbounded parallel-batch machines to minimize the makespan.
Inf. Process. Lett., 2009

Codiameters of 3-domination critical graphs with toughness more than one.
Discret. Math., 2009

The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications.
Discret. Appl. Math., 2009

Scheduling jobs with release dates on parallel batch processing machines.
Discret. Appl. Math., 2009

Bicriterion scheduling with equal processing times on a batch processing machine.
Comput. Oper. Res., 2009

Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications.
Comput. Ind. Eng., 2009

The Ramsey numbers for cycles versus wheels of odd order.
Appl. Math. Lett., 2009

Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times.
Asia Pac. J. Oper. Res., 2009

2008
Batch scheduling of step deteriorating jobs.
J. Sched., 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

Exact <i>L</i> <sub>2</sub>-norm plane separation.
Optim. Lett., 2008

Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times.
Eur. J. Oper. Res., 2008

A discrete EOQ problem is solvable in O(logn) time.
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

Multi-agent scheduling on a single machine with max-form criteria.
Eur. J. Oper. Res., 2008

A survey of scheduling problems with setup times or costs.
Eur. J. Oper. Res., 2008

Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5.
Discret. Math., 2008

Group sequencing around a common due date.
Discret. Optim., 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

Batching and scheduling in a multi-machine flow shop.
J. Sched., 2007

Due-date assignment and parallel-machine scheduling with deteriorating jobs.
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

Paired domination on interval and circular-arc graphs.
Discret. Appl. Math., 2007

An improved algorithm for the p-center problem on interval graphs with unit lengths.
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

A note on the complexity of the problem of two-agent scheduling on a single machine.
J. Comb. Optim., 2006

A new algorithm for online uniform-machine scheduling to minimize the makespan.
Inf. Process. Lett., 2006

A note on acyclic domination number in graphs of diameter two.
Discret. Appl. Math., 2006

Minimizing total completion time in a two-machine flow shop with deteriorating jobs.
Appl. Math. Comput., 2006

2005
Minimizing Completion Time Variance with Compressible Processing Times.
J. Glob. Optim., 2005

Single machine due-date scheduling of jobs with decreasing start-time dependent processing times.
Int. Trans. Oper. Res., 2005

On the single machine total tardiness problem.
Eur. J. Oper. Res., 2005

Single machine scheduling to minimize total weighted tardiness.
Eur. J. Oper. Res., 2005

A note on domination and minus domination numbers in cubic graphs.
Appl. Math. Lett., 2005

Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time.
Ann. Oper. Res., 2005

Scheduling to Minimize Makespan with Time-Dependent Processing Times.
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

Due-date assignment and single machine scheduling with deteriorating jobs.
J. Oper. Res. Soc., 2004

Single machine batch scheduling with jointly compressible setup and processing times.
Eur. J. Oper. Res., 2004

2003
Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs.
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

Scheduling start time dependent jobs to minimize the total weighted completion time.
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
Data reduction in integrated reverse engineering and rapid prototyping.
Int. J. Comput. Integr. Manuf., 1999


  Loading...