Add to ORKGAbstract We consider single machine batching and scheduling problem in which the processing time of each job is known, but the setup time is a random variable from the distribution with an unknown parameter. Batch sizes are determined sequentially, that is, the size and jobs of the rst batch are determined by using the prior knowledge and observed the value of a setup time, then the size and jobs of the second batch are determined by using the value of the rst setup time, and so on. Since this problem is a sequential decision problem, it is formulated by dynamic programming and several properties are obtained
International audienceThis paper addresses single-machine scheduling problem with resource allocatio...
We consider a scheduling problem in which two classes of independent jobs have to be processed non-p...
This paper addresses the non-preemptive single machine scheduling problem to minimize total tardines...
In this work, we study a stochastic single machine scheduling problem in which the features of learn...
Communicated by Ph. Chretienne Abstract. We study the problem of scheduling jobs on a serial batch-i...
A batch processing machine is a single machine which can process multiple jobs (up to some capacity)...
We study a problem in which a set of n jobs has to be batched as well as scheduled for processing on...
We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jo...
A scheduling problem in a real production line with uncertain sequence-dependent set-up times and a ...
Batch processing machines that can process a group of jobs simultaneously are often encountered in s...
WOS: 000445126100021For the past few years, learning effect has been receiving wide attention in the...
This paper addresses single-machine scheduling problem with resource allocation and learni...
We consider the problem of scheduling n jobs with random processing times on a single machine in ord...
The problem of partitioning a set of independent and simultaneously available jobs into batches and ...
We consider a scheduling problem in which two classes of independent jobs have to be processed non-p...
International audienceThis paper addresses single-machine scheduling problem with resource allocatio...
We consider a scheduling problem in which two classes of independent jobs have to be processed non-p...
This paper addresses the non-preemptive single machine scheduling problem to minimize total tardines...
In this work, we study a stochastic single machine scheduling problem in which the features of learn...
Communicated by Ph. Chretienne Abstract. We study the problem of scheduling jobs on a serial batch-i...
A batch processing machine is a single machine which can process multiple jobs (up to some capacity)...
We study a problem in which a set of n jobs has to be batched as well as scheduled for processing on...
We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jo...
A scheduling problem in a real production line with uncertain sequence-dependent set-up times and a ...
Batch processing machines that can process a group of jobs simultaneously are often encountered in s...
WOS: 000445126100021For the past few years, learning effect has been receiving wide attention in the...
This paper addresses single-machine scheduling problem with resource allocation and learni...
We consider the problem of scheduling n jobs with random processing times on a single machine in ord...
The problem of partitioning a set of independent and simultaneously available jobs into batches and ...
We consider a scheduling problem in which two classes of independent jobs have to be processed non-p...
International audienceThis paper addresses single-machine scheduling problem with resource allocatio...
We consider a scheduling problem in which two classes of independent jobs have to be processed non-p...
This paper addresses the non-preemptive single machine scheduling problem to minimize total tardines...