Add to ORKGNational audienceThe minimization of the amount of initial tokens in a Timed Event Graph (in short TEG) under throughput constraint is a crucial problem in industrial area such as the design of manufacturing systems or embedded systems. We show in this paper that this problem is strongly related to the K-colorability of a graph. Its NP-completeness and complexity results for other particular cyclic scheduling problems are then derived
International audienceIn this paper we tackle an important point of combinatorial optimisation: that...
This work examines the complexity of scheduling for high level synthesis. It has been shown that the...
A comparability graph is a graph which admits a transitive orientation. In this paper we consider th...
AbstractThe minimization of the amount of initial tokens in a Weighted Timed Event Graph (in short W...
precedence constraints graph In this paper we investigate the complexity of various cyclic schedulin...
In this thesis we study several graph problems. In the first part, we study the ‘gonality’ of graphs...
We consider the problem of scheduling unit-length jobs on identical machines subject to precedence c...
We analyse the problem of executing periodic operations on a minimum number of identical processors ...
AbstractA problem of no-wait scheduling of zero–one time operations without allowing inserted idle t...
We show a close connection between structural hardness for k-partite graphs and tight inapproximabil...
Abstract In this paper we deal with the problem of allocating a given number of tokens in a cyclic t...
Given a graph G and a parameter k, the k-Biclique problem asks whether G contains a complete biparti...
A version of weighted coloring of a graph is introduced which is motivated by some types of scheduli...
Abstract. This paper investigates the complexity of scheduling bipro-cessor tasks on dedicated proce...
AbstractA comparability graph is a graph which admits a transitive orientation. In this paper we con...
International audienceIn this paper we tackle an important point of combinatorial optimisation: that...
This work examines the complexity of scheduling for high level synthesis. It has been shown that the...
A comparability graph is a graph which admits a transitive orientation. In this paper we consider th...
AbstractThe minimization of the amount of initial tokens in a Weighted Timed Event Graph (in short W...
precedence constraints graph In this paper we investigate the complexity of various cyclic schedulin...
In this thesis we study several graph problems. In the first part, we study the ‘gonality’ of graphs...
We consider the problem of scheduling unit-length jobs on identical machines subject to precedence c...
We analyse the problem of executing periodic operations on a minimum number of identical processors ...
AbstractA problem of no-wait scheduling of zero–one time operations without allowing inserted idle t...
We show a close connection between structural hardness for k-partite graphs and tight inapproximabil...
Abstract In this paper we deal with the problem of allocating a given number of tokens in a cyclic t...
Given a graph G and a parameter k, the k-Biclique problem asks whether G contains a complete biparti...
A version of weighted coloring of a graph is introduced which is motivated by some types of scheduli...
Abstract. This paper investigates the complexity of scheduling bipro-cessor tasks on dedicated proce...
AbstractA comparability graph is a graph which admits a transitive orientation. In this paper we con...
International audienceIn this paper we tackle an important point of combinatorial optimisation: that...
This work examines the complexity of scheduling for high level synthesis. It has been shown that the...
A comparability graph is a graph which admits a transitive orientation. In this paper we consider th...