In this paper, we give a polynomial algorithm for problem P | rj, pj = p | � fj(Cj), where fj is any non-decreasing function such that for any indices i and j, function fi − fj is monotonous, and a polynomial algorithm for problem P | rj, pj = p, Dj | max ϕj(Cj), where ϕj is any non-decreasing function for any j
The following multiprocessor scheduling problem was motivated by scheduling maintenance periods for ...
This thesis addresses the scheduling problems on parallel machines, with and without nonavailability...
We give a polynomial approximation scheme for the problem of scheduling on uniformly related paralle...
AbstractIn this note, we give a polynomial algorithm for solving problem P∣rj,pj=p∣∑fj(Cj), where fj...
In this paper, we consider a parallel machine environment when all jobs have the same processing tim...
This paper considers the nonpreemptive scheduling of a given set of jobs on several identical, paral...
AbstractWe study the situation where a set of n jobs with release dates and equal processing times h...
We consider parallel-machine scheduling problems in which the processing time of a job is a simple l...
We consider the following scheduling problem. There are m parallel machines and n ipdependent jobs. ...
We consider a scheduling problem with two parallel machines to minimize the sum of total weighted co...
AbstractThe paper considers scheduling problems for parallel dedicated machines subject to resource ...
We consider a scheduling problem where a set of jobs is a-priori distributed over parallel machines....
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was o...
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was o...
We study the problem of assigning sporadic tasks to unrelated machines such that the tasks on each m...
The following multiprocessor scheduling problem was motivated by scheduling maintenance periods for ...
This thesis addresses the scheduling problems on parallel machines, with and without nonavailability...
We give a polynomial approximation scheme for the problem of scheduling on uniformly related paralle...
AbstractIn this note, we give a polynomial algorithm for solving problem P∣rj,pj=p∣∑fj(Cj), where fj...
In this paper, we consider a parallel machine environment when all jobs have the same processing tim...
This paper considers the nonpreemptive scheduling of a given set of jobs on several identical, paral...
AbstractWe study the situation where a set of n jobs with release dates and equal processing times h...
We consider parallel-machine scheduling problems in which the processing time of a job is a simple l...
We consider the following scheduling problem. There are m parallel machines and n ipdependent jobs. ...
We consider a scheduling problem with two parallel machines to minimize the sum of total weighted co...
AbstractThe paper considers scheduling problems for parallel dedicated machines subject to resource ...
We consider a scheduling problem where a set of jobs is a-priori distributed over parallel machines....
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was o...
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was o...
We study the problem of assigning sporadic tasks to unrelated machines such that the tasks on each m...
The following multiprocessor scheduling problem was motivated by scheduling maintenance periods for ...
This thesis addresses the scheduling problems on parallel machines, with and without nonavailability...
We give a polynomial approximation scheme for the problem of scheduling on uniformly related paralle...
DOI
Add to ORKG