Zobrazeno 1 - 10
of 108
pro vyhledávání: '"Giroudeau, Rodolphe"'
Publikováno v:
In Computers and Operations Research January 2023 149
Autor:
Davot, Tom1 (AUTHOR) tom.davot@hds.utc.fr, Giroudeau, Rodolphe2 (AUTHOR) giroudeau@lirmm.fr, König, Jean-Claude2 (AUTHOR) konig@lirmm.fr
Publikováno v:
International Journal of Foundations of Computer Science. Sep2024, Vol. 35 Issue 6, p741-756. 16p.
Some complexity and approximation results for coupled-tasks scheduling problem according to topology
Publikováno v:
RAIRO - Operations Research, EDP Sciences, 2016, 50, pp.781 - 795
We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle t
Externí odkaz:
http://arxiv.org/abs/1706.02214
Publikováno v:
Journal of Scheduling, Springer Verlag, 2011, 14 (5), pp.501-509
The problem presented in this paper is a generalization of the usual coupled-tasks scheduling problem in presence of compatibility constraints. The reason behind this study is the data acquisition problem for a submarine torpedo. We investigate a par
Externí odkaz:
http://arxiv.org/abs/1706.02202
Publikováno v:
15th International Conference on Project Management and Scheduling, pp.94-97, 2016
This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints according to classical complexity hypothesis ($\mathcal{P} \neq \mathcal{NP}$, $\mathcal{ETH}$). Moreover
Externí odkaz:
http://arxiv.org/abs/1706.02200
Autor:
Giroudeau, Rodolphe
Cette HDR concerne l'ordonnancement en présence de divers communications
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00797855
http://tel.archives-ouvertes.fr/docs/00/79/78/55/PDF/main_these.pdf
http://tel.archives-ouvertes.fr/docs/00/79/78/55/PDF/main_these.pdf
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol. 19 no. 4, FCT '15, special issue FCT'15 (December 20, 2017) dmtcs:1331
In this article we focus on the parameterized complexity of the Multidimensional Binary Vector Assignment problem (called \BVA). An input of this problem is defined by $m$ disjoint sets $V^1, V^2, \dots, V^m$, each composed of $n$ binary vectors of s
Externí odkaz:
http://arxiv.org/abs/1506.03282
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In European Journal of Operational Research 1 March 2016 249(2):551-559
Publikováno v:
In Theoretical Computer Science 26 June 2014 540-541:143-155