AbstractWe present here a new deterministic parallel algorithm for the two-processor scheduling problem. The algorithm uses only O(n3) processors and takes O(log2n) time on a CREW PRAM. In order to prove the above bounds we show how to compute in NC the lexicographically first matching for a special kind of convex bipartite graphs
AbstractWe study the problem of scheduling a single machine with the precedence relation on the set ...
The main problem studied in this thesis is that of parallel machine scheduling with precedence const...
International audienceIn this paper, we consider two dedicated parallel machines scheduling problem ...
AbstractWe present here a new deterministic parallel algorithm for the two-processor scheduling prob...
The final publication is available at link.springer.comPeer ReviewedPostprint (author's final draft
An efficient parallel algorithm $(RNC^{2})$ for the two-processor scheduling problem is presented. ...
AbstractWe present an efficient parallel algorithm for scheduling n unit length tasks on m identical...
A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular ...
We consider the problem of scheduling n tasks subject to chain-precedence constraints on two identic...
We present a polynomial time algorithm for precedence-constrained scheduling problems in which the t...
Consider a set of n jobs to be processed on a set of μ unrelated parallel machines subject to preced...
This paper considers a deterministic scheduling problem where multiple jobs with s-precedence relati...
AbstractWe present a polynomial time algorithm for precedence-constrained scheduling problems in whi...
International audienceThis paper presents different methods for solving parallel machine scheduling ...
We consider a scheduling problem with two identical parallel machines and n jobs. For each...
AbstractWe study the problem of scheduling a single machine with the precedence relation on the set ...
The main problem studied in this thesis is that of parallel machine scheduling with precedence const...
International audienceIn this paper, we consider two dedicated parallel machines scheduling problem ...
AbstractWe present here a new deterministic parallel algorithm for the two-processor scheduling prob...
The final publication is available at link.springer.comPeer ReviewedPostprint (author's final draft
An efficient parallel algorithm $(RNC^{2})$ for the two-processor scheduling problem is presented. ...
AbstractWe present an efficient parallel algorithm for scheduling n unit length tasks on m identical...
A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular ...
We consider the problem of scheduling n tasks subject to chain-precedence constraints on two identic...
We present a polynomial time algorithm for precedence-constrained scheduling problems in which the t...
Consider a set of n jobs to be processed on a set of μ unrelated parallel machines subject to preced...
This paper considers a deterministic scheduling problem where multiple jobs with s-precedence relati...
AbstractWe present a polynomial time algorithm for precedence-constrained scheduling problems in whi...
International audienceThis paper presents different methods for solving parallel machine scheduling ...
We consider a scheduling problem with two identical parallel machines and n jobs. For each...
AbstractWe study the problem of scheduling a single machine with the precedence relation on the set ...
The main problem studied in this thesis is that of parallel machine scheduling with precedence const...
International audienceIn this paper, we consider two dedicated parallel machines scheduling problem ...
DOI
Add to ORKG