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
On scheduling an unbounded batch machine
On scheduling an unbounded batch machine
2003
A batch machine is a machine that can process up to c jobs simultaneously as a batch,...
Approximability of two-machine no-wait flowshop scheduling with availability constraints
Approximability of two-machine no-wait flowshop scheduling with availability constraints
2003
We consider in this paper the two-machine no-wait flowshop scheduling problem in which...
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times
2003
We consider the single machine, serial batching, total completion time scheduling...
Scheduling start time dependent jobs to minimize the total weighted completion time
Scheduling start time dependent jobs to minimize the total weighted completion time
2002
This paper deals with a single machine scheduling problem with start time dependent...
A note on the complexity of family scheduling to minimize the number of late jobs
A note on the complexity of family scheduling to minimize the number of late jobs
2001
The single-machine family scheduling problem of minimizing the number of late jobs has...
Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
2001
This paper studies a single machine scheduling problem to minimize the weighted number...
Single supplier scheduling for multiple deliveries
Single supplier scheduling for multiple deliveries
2001
The problem of scheduling the production and delivery of a supplier to feed the...
Modelling the benefits of information sharing-based partnerships in a two-level supply chain
Modelling the benefits of information sharing-based partnerships in a two-level supply chain
2002
This paper presents a study aimed at quantifying the benefits of information...
Single machine scheduling with step-deteriorating processing times
Single machine scheduling with step-deteriorating processing times
2001
We study in this paper a scheduling model in which each task has a normal processing...
Single machine batch scheduling with resource dependent setup and processing times
Single machine batch scheduling with resource dependent setup and processing times
2001
Jobs are processed by a single machine in batches. A batch is a set of jobs processed...
Scheduling the fabrication and assembly of components in a two-machine flowshop
Scheduling the fabrication and assembly of components in a two-machine flowshop
1999
In this paper we study the problem of scheduling the fabrication and assembly of...
Due-date determination with resequencing
Due-date determination with resequencing
1999
Traditional scheduling and due-date determination models assume that the production...
Single machine scheduling with learning effect considerations
Single machine scheduling with learning effect considerations
2000
In this paper we study a single machine scheduling problem in which the job processing...
An approximation algorithm for parallel machine scheduling with a common server
An approximation algorithm for parallel machine scheduling with a common server
2001
In this paper we study the scheduling of a given set of jobs on several identical...
Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
2001
We consider a scheduling problem where a set of jobs are simultaneously available for...
Two and three stage flowshop scheduling with no wait in process
Two and three stage flowshop scheduling with no wait in process
2000
In this paper we study the time complexities of some two- and three-stage no-wait...
Parallel machine batching and scheduling with deadlines
Parallel machine batching and scheduling with deadlines
2000
In this paper, we study the problem of scheduling n independent jobs non-preemptively...
Single-machine scheduling with a common due window
Single-machine scheduling with a common due window
2001
We study several single-machine non-preemptive scheduling problems to minimize the sum...
Parallel machine scheduling with batch delivery costs
Parallel machine scheduling with batch delivery costs
2000
We consider a scheduling problem in which n independent and simultaneously available...
A review of flowshop scheduling research with setup times
A review of flowshop scheduling research with setup times
2000
Flowshop scheduling problems with setup times arise naturally in many practical...
Proportionate flow shop with controllable processing times
Proportionate flow shop with controllable processing times
1999
This paper considers a special class of flow-shop problems, known as the proportionate...
One-operator–two-machine flowshop scheduling with setup and dismounting times
One-operator–two-machine flowshop scheduling with setup and dismounting times
1999
In this paper we study the problem of scheduling n jobs in a...
The time dependent machine makespan problem is strongly NP-complete
The time dependent machine makespan problem is strongly NP-complete
1999
The computational complexity of the problem of scheduling a set of start-time...
Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties
Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties
1999
The paper considers the problem of scheduling n independent and simultaneously...
Papers per page: