The problem of scheduling identical jobs with chain precedence constraints on two uniform machines is considered. It is shown that the corresponding makespan problem can be solved in linear time
AbstractThis paper deals with single-machine scheduling problems with decreasing linear deterioratio...
We address the problem of scheduling n identical jobs on m uniform parallel machines to optimize sch...
International audienceThis paper deals with the mathematical modeling of a scheduling problem for un...
We consider a special case of the precedence constrained scheduling problem of n unit execution time...
In a recent paper, Chekuri and Bender (Proceedings of IPCO’98, pp. 383–393) derive (among other resu...
This paper considers a problem of scheduling s-precedence constrained jobs on machines in parallel w...
We consider the problem of scheduling n tasks subject to chain-precedence constraints on two identic...
For s-precedence constraints, job i cannot start processing until all jobs that precede i start. Thi...
International audienceTwo-dedicated-parallel-machine scheduling problem with precedence constraints ...
We consider a scheduling problem with two identical parallel machines and n jobs. For each...
The paper studies the problem of scheduling tasks on two machines to minimize the makespan. The task...
This paper considers a deterministic scheduling problem where multiple jobs with s-precedence relati...
We obtain a new efficient approximation algorithm for scheduling precedence constrained jobs on mach...
We investigate one-machine scheduling problems subject to generalized prece-dence constraints. A pre...
International audience We consider a m uniform parallel machines scheduling problem with two jobs A ...
AbstractThis paper deals with single-machine scheduling problems with decreasing linear deterioratio...
We address the problem of scheduling n identical jobs on m uniform parallel machines to optimize sch...
International audienceThis paper deals with the mathematical modeling of a scheduling problem for un...
We consider a special case of the precedence constrained scheduling problem of n unit execution time...
In a recent paper, Chekuri and Bender (Proceedings of IPCO’98, pp. 383–393) derive (among other resu...
This paper considers a problem of scheduling s-precedence constrained jobs on machines in parallel w...
We consider the problem of scheduling n tasks subject to chain-precedence constraints on two identic...
For s-precedence constraints, job i cannot start processing until all jobs that precede i start. Thi...
International audienceTwo-dedicated-parallel-machine scheduling problem with precedence constraints ...
We consider a scheduling problem with two identical parallel machines and n jobs. For each...
The paper studies the problem of scheduling tasks on two machines to minimize the makespan. The task...
This paper considers a deterministic scheduling problem where multiple jobs with s-precedence relati...
We obtain a new efficient approximation algorithm for scheduling precedence constrained jobs on mach...
We investigate one-machine scheduling problems subject to generalized prece-dence constraints. A pre...
International audience We consider a m uniform parallel machines scheduling problem with two jobs A ...
AbstractThis paper deals with single-machine scheduling problems with decreasing linear deterioratio...
We address the problem of scheduling n identical jobs on m uniform parallel machines to optimize sch...
International audienceThis paper deals with the mathematical modeling of a scheduling problem for un...
DOI
Add to ORKG