We consider the problem of scheduling n preemptive jobs with deadlines on in identical parallel machines so as to minimize total completion time. We show that the problem is polynomially solvable when the processing times and deadlines are agreeable
In this paper, we study the problem of scheduling n independent jobs non-preemptively on m unrelated...
We consider the problem of preemptively scheduling a set of $n$ jobs on $m$ (identical, uniformly ...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We consider a problem of scheduling n jobs on two uniform parallel machines. For each job we are giv...
AbstractWe consider a problem of scheduling n jobs on two uniform parallel machines. For each job we...
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring ...
We consider the problem of preemptive scheduling n jobs on two uniform parallel machines. All jobs...
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring ...
Abstract. Consider n independent jobs and m uniform machines in parallel. Each job has a processing ...
University of Technology Sydney. Faculty of Science.This work examines in depth a collection of rela...
International audienceWe consider preemptive machine scheduling problems on identical parallel machi...
We present hardness and approximation results for the problem of preemptive scheduling of n independ...
We consider the problem of scheduling n preemptive jobs on a single machine to minimize total tardin...
AbstractWe study the situation where a set of n jobs with release dates and equal processing times h...
Abstract. We study the problem of processor scheduling for n parallel jobs applying the method of co...
In this paper, we study the problem of scheduling n independent jobs non-preemptively on m unrelated...
We consider the problem of preemptively scheduling a set of $n$ jobs on $m$ (identical, uniformly ...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We consider a problem of scheduling n jobs on two uniform parallel machines. For each job we are giv...
AbstractWe consider a problem of scheduling n jobs on two uniform parallel machines. For each job we...
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring ...
We consider the problem of preemptive scheduling n jobs on two uniform parallel machines. All jobs...
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring ...
Abstract. Consider n independent jobs and m uniform machines in parallel. Each job has a processing ...
University of Technology Sydney. Faculty of Science.This work examines in depth a collection of rela...
International audienceWe consider preemptive machine scheduling problems on identical parallel machi...
We present hardness and approximation results for the problem of preemptive scheduling of n independ...
We consider the problem of scheduling n preemptive jobs on a single machine to minimize total tardin...
AbstractWe study the situation where a set of n jobs with release dates and equal processing times h...
Abstract. We study the problem of processor scheduling for n parallel jobs applying the method of co...
In this paper, we study the problem of scheduling n independent jobs non-preemptively on m unrelated...
We consider the problem of preemptively scheduling a set of $n$ jobs on $m$ (identical, uniformly ...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
DOI
Add to ORKG