Ng C T

C T Ng

Information about the author C T Ng will soon be added to the site.
Found 11 papers in total
Multi‐period empty container repositioning with stochastic demand and lost sales
Multi‐period empty container repositioning with stochastic demand and lost sales
2014
This paper considers repositioning empty containers between multi‐ports over...
The unbounded parallel‐batch scheduling with rejection
The unbounded parallel‐batch scheduling with rejection
2012
In this paper, we consider the unbounded parallel‐batch scheduling with...
Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine
Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine
2011
This paper considers the problem of scheduling deteriorating jobs and due date...
Optimal algorithms for single‐machine scheduling with rejection to minimize the makespan
Optimal algorithms for single‐machine scheduling with rejection to minimize the makespan
2011
In this paper we consider the single‐machine scheduling problem with rejection....
Group scheduling and due date assignment on a single machine
Group scheduling and due date assignment on a single machine
2011
We consider a single‐machine scheduling problem involving both the due date...
Inverse scheduling: applications in shipping
Inverse scheduling: applications in shipping
2011
Optimisation problems are concerned with finding optimal solutions with respect to...
Two‐agent scheduling to minimize the total cost
Two‐agent scheduling to minimize the total cost
2011
Two agents, each having his own set of jobs, compete to perform their own jobs on a...
Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
2009
We consider the problem of scheduling n preemptive jobs on a single machine to...
Two-machine flow-shop minimum-length scheduling with interval processing times
Two-machine flow-shop minimum-length scheduling with interval processing times
2009
The flow-shop minimum-length scheduling problem with n jobs processed on two machines...
The loader problem: formulation, complexity and algorithms
The loader problem: formulation, complexity and algorithms
2010
In this paper we consider a new transportation model, called the loader problem, which...
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
2008
We consider the problem of on-line scheduling a set of n jobs on two parallel batch...
Papers per page: