Cheng T.C.E.

T.C.E. Cheng

Information about the author T.C.E. Cheng will soon be added to the site.
Found 71 papers in total
Solvable cases of permutation flowshop scheduling with dominating machines
Solvable cases of permutation flowshop scheduling with dominating machines
2000
In this paper we study the permutation flowshop scheduling problem with an increasing...
Makespan minimization in the two-machine flowshop batch scheduling problem
Makespan minimization in the two-machine flowshop batch scheduling problem
2000
In this paper we consider a practical scheduling problem commonly arising from batch...
Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
1999
Scheduling a set of n jobs on a single machine so as to minimize the completion time...
A tight lower bound for the completion time variance problem
A tight lower bound for the completion time variance problem
1996
We consider the completion time variance problem. Our main result is a tight lower...
The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
1998
The makespan problem on a single machine for a set of tasks with two distinct...
Scheduling to minimize the total compression and late costs
Scheduling to minimize the total compression and late costs
1998
We consider a single-machine scheduling model in which the job processing times are...
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
1996
We consider a single-machine scheduling problem in which job processing times are...
Due-data assignment and single machine scheduling with compressible processing times
Due-data assignment and single machine scheduling with compressible processing times
1996
In this paper the authors consider a due-date assignment and single-machine scheduling...
Scheduling 2 job classes on parallel machines
Scheduling 2 job classes on parallel machines
1995
The problem of scheduling n jobs on m parallel machines is considered where the jobs...
Due-date assignment and single machine scheduling with compressible processing times
Due-date assignment and single machine scheduling with compressible processing times
1996
In this paper the authors consider a due-date assignment and single machine scheduling...
Scheduling to minimize release-time resource consumption and tardiness penalties
Scheduling to minimize release-time resource consumption and tardiness penalties
1995
The authors consider the problem of scheduling a set of jobs with a common due-date on...
A review of stochastic modelling of delay and capacity at unsignalized priority intersections
A review of stochastic modelling of delay and capacity at unsignalized priority intersections
1992
Priority intersections are road junctions where at least one stream of vehicles must...
The cutting stock problem-A survey
The cutting stock problem-A survey
1994
This paper surveys the literature on the cutting stock problem, also known as the...
Batch delivery scheduling on a single machine
Batch delivery scheduling on a single machine
1994
The problem of partitioning a set of independent and simultaneously available jobs...
Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
1995
The authors consider a single-machine scheduling problem in which every job has a...
Parallel-machine scheduling problems with earliness and tardiness penalties
Parallel-machine scheduling problems with earliness and tardiness penalties
1994
This paper considers the problem of assigning a common due-date and sequencing a set...
One-machine batching and sequencing of multiple-type items
One-machine batching and sequencing of multiple-type items
1994
The authors consider a single-machine scheduling problem in which a given number of...
Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
1993
The authors discuss the problem of scheduling a set of n independent jobs on m...
Optimal due-date assignment in an assembly shop
Optimal due-date assignment in an assembly shop
1994
Under intensified pressure from both domestic and foreign competition, today’s...
The parallel machine min-max weighted absolute lateness scheduling problem
The parallel machine min-max weighted absolute lateness scheduling problem
1994
Given a set of jobs, a processing time and a weight for each job, several parallel and...
The assessment of reservation prices of an intermediate R&D result and patent reward under oligopolistic competitive behaviour
The assessment of reservation prices of an intermediate R&D result and patent reward under oligopolistic competitive behaviour
1993
One of the shortcomings of R&D evaluation is a lack of emphasis on analytical...
On the complexity of completion time variance minimization problem
On the complexity of completion time variance minimization problem
1993
The complexity of the completion time variance problem has been open for a long time....
An economic manufacturing quantity model with learning effects
An economic manufacturing quantity model with learning effects
1994
This paper considers the calculation of economic manufacturing quantity (EMQ) under...
A note on one-processor scheduling with asymmetric earliness and tardiness penalties
A note on one-processor scheduling with asymmetric earliness and tardiness penalties
1993
The authors consider the problem of scheduling n independent and simultaneously...
Papers per page: