Add to ORKGWe deal with a single machine scheduling problem in which each job has a release date, a delivery time and a controllable processing time. The fact that the jobs have a controllable processing time means that it is allowed to compress (a part of) the processing time of the job, in return for compression cost. The objective is to find a schedule that minimizes the total cost, that is, the latest delivery time of any job plus the total compression cost. In this note we discuss how the techniques of Hall and Shmoys [3] and Hall [1] can directly be applied to design a polynomial time approximation scheme for this problem
We consider the well known problem of scheduling jobs with release dates to minimize their average w...
Scheduling on Unrelated Machines is a classical optimization problem where $n$ jobs have to be distr...
Abstract. Most papers in scheduling research ave treated individual job processing times as fixed pa...
Abstract: We deal with a single machine scheduling problem in which each job has a release date, a d...
We consider the single-machine scheduling problem with release dates and job delivery to minimize ma...
International audienceWe consider a natural generalization of classical scheduling problems in which...
We consider a single-machine scheduling problem, in which the job processing times are controllable ...
We consider a range of scheduling problems with controllable processing times, in which the jobs mus...
International audienceThis paper is the first attempt to successfully design efficient approximation...
A classical scheduling problem is to find schedules that minimize average weighted completion time o...
The single machine scheduling problem with two types of controllable parameters, job processing time...
AbstractThis paper considers single machine scheduling problems in which the job processing times an...
An important objective function in the scheduling literature is to minimize the sum of weighted flow...
International audienceAbstract We consider a natural generalization of classical scheduling problems...
We consider the problem of scheduling n independent jobs on m identical machines that operate in par...
We consider the well known problem of scheduling jobs with release dates to minimize their average w...
Scheduling on Unrelated Machines is a classical optimization problem where $n$ jobs have to be distr...
Abstract. Most papers in scheduling research ave treated individual job processing times as fixed pa...
Abstract: We deal with a single machine scheduling problem in which each job has a release date, a d...
We consider the single-machine scheduling problem with release dates and job delivery to minimize ma...
International audienceWe consider a natural generalization of classical scheduling problems in which...
We consider a single-machine scheduling problem, in which the job processing times are controllable ...
We consider a range of scheduling problems with controllable processing times, in which the jobs mus...
International audienceThis paper is the first attempt to successfully design efficient approximation...
A classical scheduling problem is to find schedules that minimize average weighted completion time o...
The single machine scheduling problem with two types of controllable parameters, job processing time...
AbstractThis paper considers single machine scheduling problems in which the job processing times an...
An important objective function in the scheduling literature is to minimize the sum of weighted flow...
International audienceAbstract We consider a natural generalization of classical scheduling problems...
We consider the problem of scheduling n independent jobs on m identical machines that operate in par...
We consider the well known problem of scheduling jobs with release dates to minimize their average w...
Scheduling on Unrelated Machines is a classical optimization problem where $n$ jobs have to be distr...
Abstract. Most papers in scheduling research ave treated individual job processing times as fixed pa...