The problem of makespan minimization in a flow shop with two-machines when the input buffer of the second machine can only host a limited number c of parts is known to be NP-hard for any c>0 and c⩽n, where n is the number of jobs. In this paper we analyze this problem in the context of batch scheduling, i.e. when identical parts must be processed consecutively. In particular we study the case in which each batch requires sequence independent setup times and removal times. We then show that, if the size of the ith batch is larger than a value b*_i, then the makespan minimization problem can be formulated as a special case of TSP and solved in polynomial time. The cost structure of this TSP can be reduced to the one defined for the two-machin...
We consider the the two-machine flow-shop serial-batching scheduling problem where thebatches have l...
We consider in this paper a two-machine flowshop scheduling problem in which the first machine proce...
n this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-...
The problem of makespan minimization in a flow shop with two-machines when the input buffer of the s...
The problem of makespan minimization in a flow shop with two-machines when the input buffer of the s...
This paper deals with the problem of makespan minimization in a flow shop with two machines when the...
This paper deals with the problem of makespan minimization in a flow shop with two machines when the...
This paper deals with the problem of makespan minimization in a flow shop with two machines when the...
This paper deals with the problem of makespan minimization in a flow shop with two ma-chines when th...
This paper deals with the problem of makespan minimization in a flow shop with two ma-chines when th...
International audienceThis paper deals with the problem of task scheduling in a no-wait flowshop wit...
We consider a scheduling problem where a set of jobs are simultaneously available for processing in ...
We study a batch scheduling problem on a 2-machine flowshop. We assume unit processing time jobs, ba...
In many practical situations, batching of similar jobs to avoid setups is performed while constructi...
Colloque avec actes et comité de lecture. internationale.International audienceWe study a problem of...
We consider the the two-machine flow-shop serial-batching scheduling problem where thebatches have l...
We consider in this paper a two-machine flowshop scheduling problem in which the first machine proce...
n this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-...
The problem of makespan minimization in a flow shop with two-machines when the input buffer of the s...
The problem of makespan minimization in a flow shop with two-machines when the input buffer of the s...
This paper deals with the problem of makespan minimization in a flow shop with two machines when the...
This paper deals with the problem of makespan minimization in a flow shop with two machines when the...
This paper deals with the problem of makespan minimization in a flow shop with two machines when the...
This paper deals with the problem of makespan minimization in a flow shop with two ma-chines when th...
This paper deals with the problem of makespan minimization in a flow shop with two ma-chines when th...
International audienceThis paper deals with the problem of task scheduling in a no-wait flowshop wit...
We consider a scheduling problem where a set of jobs are simultaneously available for processing in ...
We study a batch scheduling problem on a 2-machine flowshop. We assume unit processing time jobs, ba...
In many practical situations, batching of similar jobs to avoid setups is performed while constructi...
Colloque avec actes et comité de lecture. internationale.International audienceWe study a problem of...
We consider the the two-machine flow-shop serial-batching scheduling problem where thebatches have l...
We consider in this paper a two-machine flowshop scheduling problem in which the first machine proce...
n this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-...