16 citations · 28 across the 4 of their papers we have counts for
5 papers
On the Complexity of Robust Stable Marriage
Begum Genc, Mohamed Siala, Gilles Simonin +1
Robust Stable Marriage (RSM) is a variant of the classical Stable Marriage problem, where the robustness of a given stable matching is measured by the number of modifications requi…
Some complexity and approximation results for coupled-tasks scheduling problem according to topology
Benoit Darties, Rodolphe Giroudeau, Jean-Claude König +1
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,…
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
Gilles Simonin, Benoit Darties, Rodolphe Giroudeau +1
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…
Bounds and approximation results for scheduling coupled-tasks with compatibility constraints
Rodolphe Giroudeau, Jean-Claude König, Benoit Darties +1
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 h…
Finding Robust Solutions to Stable Marriage
Begum Genc, Mohamed Siala, Barry O'Sullivan +1
We study the notion of robustness in stable matching problems. We first define robustness by introducing (a,b)-supermatches. An -supermatch is a stable matching in which if…