Yuan J.J.

J.J. Yuan

Information about the author J.J. Yuan will soon be added to the site.
Found 17 papers in total
The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
2007
In this paper, we consider the single machine batching problem with family setup times...
Approximability of single machine scheduling with fixed jobs to minimize total completion time
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...
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
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:...
Single machine batch scheduling problem with family setup times and release dates to minimize makespan
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...
A note on the scheduling with two families of jobs
A note on the scheduling with two families of jobs
2005
Baker and Smith introduced a new model of scheduling in which there are two or more...
Concurrent open shop scheduling to minimize the weighted number of tardy jobs
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
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
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...
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 note on the complexity of the problem of two-agent scheduling on a single machine
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...
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...
Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
2005
We consider the single machine parallel-batching scheduling problem with precedence...
A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
2004
We consider the single machine, serial batching scheduling problem 1|prec; p j...
Single machine parallel batch scheduling subject to precedence constraints
Single machine parallel batch scheduling subject to precedence constraints
2004
We consider the single machine parallel batch scheduling problems to minimize makespan...
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...
Minimum fill-in problem of graphs
Minimum fill-in problem of graphs
1996
The computational complexity of the minimum fill-in problem of graphs is discussed in...
Minimum fill-in problem of graphs
Minimum fill-in problem of graphs
1996
The computational complexity of the minimum fill-in problem of graphs is discussed in...
Papers per page: