Cheng T.C. Edwin

T.C. Edwin Cheng

Information about the author T.C. Edwin Cheng will soon be added to the site.
Found 82 papers in total
Customer order scheduling to minimize total weighted completion time
Customer order scheduling to minimize total weighted completion time
2007
In this paper we study the scheduling problem in which each customer order consists of...
Scheduling problems with the effects of deterioration and learning
Scheduling problems with the effects of deterioration and learning
2007
This paper deals with the machine scheduling problems with the effects of...
Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
2007
This paper studies the two-machine flowshop scheduling problem with anticipatory setup...
Single machine serial-batching scheduling problem with a common batch size to minimize total weighted completion time
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...
A fully polynomial-time approximation scheme (FPTAS) for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
A fully polynomial-time approximation scheme (FPTAS) for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
2007
We study the problems of scheduling a set of nonpreemptive jobs on a single machine...
The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times
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,...
Two-machine flowshop scheduling with conditional deteriorating second operations
Two-machine flowshop scheduling with conditional deteriorating second operations
2006
This paper considers a flowshop-scheduling problem with a waiting time constraint...
Supply chain management in the logistics industry: the case of Hong Kong
Supply chain management in the logistics industry: the case of Hong Kong
2005
This paper has three main objectives: to examine supply chain management (SCM) in the...
Single machine scheduling with a restricted rate-modifying activity
Single machine scheduling with a restricted rate-modifying activity
2005
In this paper we consider the problem of scheduling a set of jobs on a single machine...
Single machine scheduling to minimize total weighted tardiness
Single machine scheduling to minimize total weighted tardiness
2005
The problem of minimizing the total weighted tardiness in single machine scheduling is...
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
2005
In this paper we study both the non-preemptive and preemptive versions of the popular...
On the single machine total tardiness problem
On the single machine total tardiness problem
2005
In this paper we study the single machine total tardiness problem. We first identify...
Scheduling with step-improving processing times
Scheduling with step-improving processing times
2006
We consider the scheduling problem of minimizing the makespan on a single machine with...
Two-machine flowshop batching and scheduling
Two-machine flowshop batching and scheduling
2005
We consider in this paper a two-machine flowshop scheduling problem in which the first...
Group scheduling with controllable setup and processing times: minimizing total weighted completion time
Group scheduling with controllable setup and processing times: minimizing total weighted completion time
2005
The following single machine scheduling problem is studied. A partition of a set of n...
An improved heuristic for two-machine flowshop scheduling with an availability constraint
An improved heuristic for two-machine flowshop scheduling with an availability constraint
2000
In this paper we study the two-machine flowshop scheduling problem with an...
A concise survey of scheduling with time-dependent processing times
A concise survey of scheduling with time-dependent processing times
2004
We consider a class of machine scheduling problems in which the processing time of a...
Single machine batch scheduling with jointly compressible setup and processing times
Single machine batch scheduling with jointly compressible setup and processing times
2004
A single machine batch scheduling problem is addressed. A batch is a set of jobs...
Due-date assignment and single machine scheduling with deteriorating jobs
Due-date assignment and single machine scheduling with deteriorating jobs
2004
We study a scheduling problem with deteriorating jobs, that is, jobs whose processing...
Scheduling a single server in a two-machine flow shop
Scheduling a single server in a two-machine flow shop
2003
We study the problem of scheduling a single server that processes n jobs in a...
Two-stage flowshop earliness and tardiness machine scheduling involving a common due window
Two-stage flowshop earliness and tardiness machine scheduling involving a common due window
2004
This paper studies a non-preemptive two-stage flowshop scheduling problem to minimize...
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
2004
We consider shop problems with transportation delays where not only the jobs on the...
Single machine scheduling with a variable common due date and resource-dependent processing times
Single machine scheduling with a variable common due date and resource-dependent processing times
2003
The problem of scheduling n jobs with a variable common due date on a single machine...
Scheduling jobs with piecewise linear decreasing processing times
Scheduling jobs with piecewise linear decreasing processing times
2003
We study the problems of scheduling a set of nonpreemptive jobs on a single or...
Papers per page: