Ng C.T.

C.T. Ng

Information about the author C.T. Ng will soon be added to the site.
Found 32 papers in total
Single-machine scheduling with a time-dependent learning effect
2008
In this paper we consider the single-machine scheduling problem with a time-dependent...
Batch scheduling of step deteriorating jobs
2008
In this paper we consider the problem of scheduling n jobs on a single machine, where...
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
2008
We consider the problem of scheduling family jobs with release dates on a bounded...
Approximability of single machine scheduling with fixed jobs to minimize total completion time
2007
We consider the single machine scheduling problem to minimize total completion time...
Fixed interval scheduling: models, applications, computational complexity and algorithms
2007
The defining characteristic of fixed interval scheduling problems is that each job has...
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
2007
Baker and Nuttle studied the following single-variable-resource scheduling problem:...
Batching and scheduling in a multi-machine flow shop
2007
We study the problem of batching and scheduling n jobs in a flow shop comprising m , m...
An improved algorithm for the p-center problem on interval graphs with unit lengths
2007
The p -center problem is to locate p facilities in a network of n demand points so as...
Due-date assignment and parallel-machine scheduling with deteriorating jobs
2007
In this paper we study the problem of scheduling n deteriorating jobs on m identical...
A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs
2007
In this paper we study the NP-hard problem of scheduling n deteriorating jobs on m...
An O(n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
2006
In this paper, we study the problem of scheduling n equal-length preemptive jobs on a...
Single machine batch scheduling problem with family setup times and release dates to minimize makespan
2006
In this paper we consider the single machine batch scheduling problem with family...
Concurrent open shop scheduling to minimize the weighted number of tardy jobs
2003
We consider a relaxed version of the open shop scheduling problem – the...
The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
2003
In this paper, we consider the single machine batching problem with family setup times...
A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
2003
We consider the single machine multi-operation jobs scheduling problem to minimize the...
Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables
2007
The problem of scheduling the production of new and recovering defective items of the...
Single machine serial-batching scheduling problem with a common batch size to minimize total weighted completion time
2007
In this paper we consider the single machine serial-batching scheduling problem to...
The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times
2007
We address the three-machine flowshop scheduling problem to minimise maximum lateness,...
Single machine due-date scheduling of jobs with decreasing start-time dependent processing times
2005
We study the problem of scheduling jobs whose processing times are decreasing...
A note on the complexity of the problem of two-agent scheduling on a single machine
2006
We consider a two-agent scheduling problem on a single machine, where the objective is...
Scheduling of multi-buyer joint replenishments
2006
It is a common practice for a multi-branch firm to have its branches ordering a group...
Single machine scheduling to minimize total weighted tardiness
2005
The problem of minimizing the total weighted tardiness in single machine scheduling is...
On the single machine total tardiness problem
2005
In this paper we study the single machine total tardiness problem. We first identify...
Minimizing completion time variance with compressible processing times
2005
We introduce a new formulation of the standard completion time variance problem with n...
Papers per page: