AbstractIn this note, we give a polynomial algorithm for solving 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 monotonic
We give a polynomial approximation scheme for the problem of scheduling on uniformly related paralle...
We study the problems of scheduling a set of nonpreemptive jobs on a single machine and identical pa...
In a recent article, Kuo et al study an unrelated parallel machine scheduling problem in which the p...
In this paper, we give a polynomial algorithm for problem P | rj, pj = p | � fj(Cj), where fj is an...
AbstractIn this note, we give a polynomial algorithm for solving problem P∣rj,pj=p∣∑fj(Cj), where fj...
AbstractWe study the situation where a set of n jobs with release dates and equal processing times h...
In this paper, we consider a parallel machine environment when all jobs have the same processing tim...
We consider a scheduling problem where a set of jobs is a-priori distributed over parallel machines....
We consider a scheduling problem with two parallel machines to minimize the sum of total weighted co...
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was o...
We consider parallel-machine scheduling problems in which the processing time of a job is a simple l...
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was o...
The basic scheduling problem we are dealing with in this paper is the fol-lowing one. A set of jobs ...
We consider the following scheduling problem. There arem parallel machines andn independent jobs. Ea...
In this paper we give a polynomial algorithm for problem Q | rj, pj = p, pmtn | ∑Cj whose complexity...
We give a polynomial approximation scheme for the problem of scheduling on uniformly related paralle...
We study the problems of scheduling a set of nonpreemptive jobs on a single machine and identical pa...
In a recent article, Kuo et al study an unrelated parallel machine scheduling problem in which the p...
In this paper, we give a polynomial algorithm for problem P | rj, pj = p | � fj(Cj), where fj is an...
AbstractIn this note, we give a polynomial algorithm for solving problem P∣rj,pj=p∣∑fj(Cj), where fj...
AbstractWe study the situation where a set of n jobs with release dates and equal processing times h...
In this paper, we consider a parallel machine environment when all jobs have the same processing tim...
We consider a scheduling problem where a set of jobs is a-priori distributed over parallel machines....
We consider a scheduling problem with two parallel machines to minimize the sum of total weighted co...
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was o...
We consider parallel-machine scheduling problems in which the processing time of a job is a simple l...
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was o...
The basic scheduling problem we are dealing with in this paper is the fol-lowing one. A set of jobs ...
We consider the following scheduling problem. There arem parallel machines andn independent jobs. Ea...
In this paper we give a polynomial algorithm for problem Q | rj, pj = p, pmtn | ∑Cj whose complexity...
We give a polynomial approximation scheme for the problem of scheduling on uniformly related paralle...
We study the problems of scheduling a set of nonpreemptive jobs on a single machine and identical pa...
In a recent article, Kuo et al study an unrelated parallel machine scheduling problem in which the p...
DOI
Add to ORKG