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
Consider the problem of scheduling a set of tasks of length p without preemption on $m$ identical ma...
We consider the following scheduling problem. There arem parallel machines andn independent jobs. Ea...
Submitted to 13th IFAC Symposium on Information Control Problems in ManufacturingInternational audie...
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 give a polynomial algorithm for problem P | rj, pj = p | � fj(Cj), where fj is an...
In this paper, we consider a parallel machine environment when all jobs have the same processing tim...
International audienceIn this paper, we are interested in parallel identical machine scheduling prob...
AbstractWe consider a problem of scheduling n jobs on two uniform parallel machines. For each job we...
AbstractWe consider parallel-machine scheduling problems in which the processing time of a job is a ...
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was o...
AbstractIn the literature, most of the parallel-machine scheduling problems, in which the processing...
AbstractIn a recent paper [Discrete Appl. Math. 130 (2003) 449–467], Yang, Ye, and Zhang investigate...
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...
Consider the problem of scheduling a set of tasks of length p without preemption on $m$ identical ma...
We consider the following scheduling problem. There arem parallel machines andn independent jobs. Ea...
Submitted to 13th IFAC Symposium on Information Control Problems in ManufacturingInternational audie...
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 give a polynomial algorithm for problem P | rj, pj = p | � fj(Cj), where fj is an...
In this paper, we consider a parallel machine environment when all jobs have the same processing tim...
International audienceIn this paper, we are interested in parallel identical machine scheduling prob...
AbstractWe consider a problem of scheduling n jobs on two uniform parallel machines. For each job we...
AbstractWe consider parallel-machine scheduling problems in which the processing time of a job is a ...
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was o...
AbstractIn the literature, most of the parallel-machine scheduling problems, in which the processing...
AbstractIn a recent paper [Discrete Appl. Math. 130 (2003) 449–467], Yang, Ye, and Zhang investigate...
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...
Consider the problem of scheduling a set of tasks of length p without preemption on $m$ identical ma...
We consider the following scheduling problem. There arem parallel machines andn independent jobs. Ea...
Submitted to 13th IFAC Symposium on Information Control Problems in ManufacturingInternational audie...
DOI
Add to ORKG