Stéphanie Roussel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Stéphanie Roussel has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
Cédric Pralet
ONERA/DTIS, Université de Toulouse
5 shared publications- Anouck Chan
ONERA
3 shared publications - Antoine Jacquet
Jolibrain Toulouse France
3 shared publications Claude Cuiller
AIRBUS, Blagnac, France
3 shared publications- Cédric Pralet
Université de Toulouse
3 shared publications - Emmanuel Benazera
Jolibrain Toulouse France
3 shared publications
Latest Publications
- Open Access
Learning to Solve Resource-Constrained Project Scheduling Problems with Duration Uncertainty using Graph Neural Networks
The Resource-Constrained Project Scheduling Problem (RCPSP) is a classical scheduling problem that has received significant attention due to of its numerous applications in industry. However, in practice, task durations are subject to uncertainty that must be considered in order to propose resilient scheduling. In this paper, we address the RCPSP variant with uncertain tasks duration (modeled using known probabilities) and aim to minimize the overall expected project duration. Our objective is to produce a baseline schedule that can be reused multiple times in an industrial setting regardless of the actual duration scenario. We leverage Graph Neural Networks in conjunction with Deep Reinforcement Learning (DRL) to develop an effective policy for task scheduling. This policy operates similarly to a priority dispatch rule and is paired with a Serial Schedule Generation Scheme to produce a schedule. Our empirical evaluation on standard benchmarks demonstrates the approach's superiority in terms of performance and its ability to generalize. The developed framework, Wheatley, is made publicly available online to facilitate further research and reproducibility.
Open AccessLearning to Solve Resource-Constrained Project Scheduling Problems with Duration Uncertainty using Graph Neural Networks
The Resource-Constrained Project Scheduling Problem (RCPSP) is a classical scheduling problem that has received significant attention due to of its numerous applications in industry. However, in practice, task durations are subject to uncertainty that must be considered in order to propose resilient scheduling. In this paper, we address the RCPSP variant with uncertain tasks duration (modeled using known probabilities) and aim to minimize the overall expected project duration. Our objective is to produce a baseline schedule that can be reused multiple times in an industrial setting regardless of the actual duration scenario. We leverage Graph Neural Networks in conjunction with Deep Reinforcement Learning (DRL) to develop an effective policy for task scheduling. This policy operates similarly to a priority dispatch rule and is paired with a Serial Schedule Generation Scheme to produce a schedule. Our empirical evaluation on standard benchmarks demonstrates the approach's superiority in terms of performance and its ability to generalize. The developed framework, Wheatley, is made publicly available online to facilitate further research and reproducibility.
- 3 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1073-1080
Learning to Solve Resource-Constrained Project Scheduling Problems with Duration Uncertainty Using Graph Neural Networks
The Resource-Constrained Project Scheduling Problem (RCPSP) is a classical scheduling problem that has received significant attention due to of its numerous applications in industry. However, in practice, task durations are subject to uncertainty that must be considered in order to propose resilient scheduling. In this paper, we address the RCPSP variant with uncertain tasks duration (modeled using known probabilities) and aim to minimize the overall expected project duration. Our objective is to produce a baseline schedule that can be reused multiple times in an industrial setting regardless of the actual duration scenario. We leverage Graph Neural Networks in conjunction with Deep Reinforcement Learning (DRL) to develop an effective policy for task scheduling. This policy operates similarly to a priority dispatch rule and is paired with a Serial Schedule Generation Scheme to produce a schedule. Our empirical evaluation on standard benchmarks demonstrates the approach's superiority in terms of performance and its ability to generalize. The developed framework, Wheatley, is made publicly available online to facilitate further research and reproducibility.
- 3 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1073-1080
Learning to Solve Resource-Constrained Project Scheduling Problems with Duration Uncertainty Using Graph Neural Networks
The Resource-Constrained Project Scheduling Problem (RCPSP) is a classical scheduling problem that has received significant attention due to of its numerous applications in industry. However, in practice, task durations are subject to uncertainty that must be considered in order to propose resilient scheduling. In this paper, we address the RCPSP variant with uncertain tasks duration (modeled using known probabilities) and aim to minimize the overall expected project duration. Our objective is to produce a baseline schedule that can be reused multiple times in an industrial setting regardless of the actual duration scenario. We leverage Graph Neural Networks in conjunction with Deep Reinforcement Learning (DRL) to develop an effective policy for task scheduling. This policy operates similarly to a priority dispatch rule and is paired with a Serial Schedule Generation Scheme to produce a schedule. Our empirical evaluation on standard benchmarks demonstrates the approach's superiority in terms of performance and its ability to generalize. The developed framework, Wheatley, is made publicly available online to facilitate further research and reproducibility.
- 23 June 2024
- Published by Springer Nature
- p. 3-17
Exploring Goal Relationships in Satellite Assembly Line Design
- 23 June 2024
- Published by Springer Nature
- p. 3-17
Exploring Goal Relationships in Satellite Assembly Line Design
- 25 May 2024
- Published by Springer Nature
- p. 329-345
Learning to Solve Job Shop Scheduling Under Uncertainty
- 25 May 2024
- Published by Springer Nature
- p. 329-345
Learning to Solve Job Shop Scheduling Under Uncertainty
- Open Access
Learning to Solve Job Shop Scheduling under Uncertainty
Job-Shop Scheduling Problem (JSSP) is a combinatorial optimization problem where tasks need to be scheduled on machines in order to minimize criteria such as makespan or delay. To address more realistic scenarios, we associate a probability distribution with the duration of each task. Our objective is to generate a robust schedule, i.e. that minimizes the average makespan. This paper introduces a new approach that leverages Deep Reinforcement Learning (DRL) techniques to search for robust solutions, emphasizing JSSPs with uncertain durations. Key contributions of this research include: (1) advancements in DRL applications to JSSPs, enhancing generalization and scalability, (2) a novel method for addressing JSSPs with uncertain durations. The Wheatley approach, which integrates Graph Neural Networks (GNNs) and DRL, is made publicly available for further research and applications.
Open AccessLearning to Solve Job Shop Scheduling under Uncertainty
Job-Shop Scheduling Problem (JSSP) is a combinatorial optimization problem where tasks need to be scheduled on machines in order to minimize criteria such as makespan or delay. To address more realistic scenarios, we associate a probability distribution with the duration of each task. Our objective is to generate a robust schedule, i.e. that minimizes the average makespan. This paper introduces a new approach that leverages Deep Reinforcement Learning (DRL) techniques to search for robust solutions, emphasizing JSSPs with uncertain durations. Key contributions of this research include: (1) advancements in DRL applications to JSSPs, enhancing generalization and scalability, (2) a novel method for addressing JSSPs with uncertain durations. The Wheatley approach, which integrates Graph Neural Networks (GNNs) and DRL, is made publicly available for further research and applications.
- Open Access
Conflicting Bundle Allocation with Preferences in Weighted Directed Acyclic Graphs: Application to Orbit Slot Allocation Problems
We introduce resource allocation techniques for problems where (i) the agents express requests for obtaining item bundles as compact edge-weighted directed acyclic graphs (each path in such a graph is a bundle whose valuation is the sum of the weights of the traversed edges), and (ii) the agents do not bid on the exact same items but may bid on conflicting items that cannot be both assigned or that require accessing a specific resource with limited capacity. This setting is motivated by real applications such as Earth observation slot allocation, virtual network functions, or multi-agent path finding. We model several directed path allocation problems (vertex-constrained and resource-constrained), investigate several solution methods (qualified as exact or approximate, and utilitarian or fair), and analyze their performances on an orbit slot ownership problem, for realistic requests and constellation configurations.
Open AccessConflicting Bundle Allocation with Preferences in Weighted Directed Acyclic Graphs: Application to Orbit Slot Allocation Problems
We introduce resource allocation techniques for problems where (i) the agents express requests for obtaining item bundles as compact edge-weighted directed acyclic graphs (each path in such a graph is a bundle whose valuation is the sum of the weights of the traversed edges), and (ii) the agents do not bid on the exact same items but may bid on conflicting items that cannot be both assigned or that require accessing a specific resource with limited capacity. This setting is motivated by real applications such as Earth observation slot allocation, virtual network functions, or multi-agent path finding. We model several directed path allocation problems (vertex-constrained and resource-constrained), investigate several solution methods (qualified as exact or approximate, and utilitarian or fair), and analyze their performances on an orbit slot ownership problem, for realistic requests and constellation configurations.
- 23 May 2023
- Published by Springer Nature
- p. 3-18
Goal Modelling: Design and Manufacturing in Aeronautics
- 23 May 2023
- Published by Springer Nature
- p. 3-18
Goal Modelling: Design and Manufacturing in Aeronautics
- 23 May 2023
- Published by Springer Nature
- p. 443-459
Scheduling Complex Observation Requests for a Constellation of Satellites: Large Neighborhood Search Approaches
- 23 May 2023
- Published by Springer Nature
- p. 443-459
Scheduling Complex Observation Requests for a Constellation of Satellites: Large Neighborhood Search Approaches
- 13 October 2022
- Published by Springer Nature
- p. 280-293
Bundle Allocation with Conflicting Preferences Represented as Weighted Directed Acyclic Graphs
- 13 October 2022
- Published by Springer Nature
- p. 280-293
Bundle Allocation with Conflicting Preferences Represented as Weighted Directed Acyclic Graphs
- Open Access
- 15 July 2022
- Published by IOS Press
- p. 100-113
Parallel Scheduling of Complex Requests for a Constellation of Earth Observing Satellites
Nowadays, the Earth observation systems involve multiple satellites, multiple ground stations, and multiple end-users that formulate various observation requests. These requests might be heterogeneous (stereoscopic observations, periodic observations, systematic observations, etc.), and one difficulty is that the search space defined by the possible ways of performing the requests given the multiple satellites and ground stations available is huge. This paper studies several combinatorial optimization techniques for solving such an operational problem, including a constraint programming approach and parallel scheduling techniques that take advantage of the problem structure. These algorithms are evaluated on realistic instances involving various request types and objective functions depending on the cloud cover conditions, that highly impact the quality of the images collected.
- 15 July 2022
- Published by IOS Press
- p. 100-113
Open AccessParallel Scheduling of Complex Requests for a Constellation of Earth Observing Satellites
Nowadays, the Earth observation systems involve multiple satellites, multiple ground stations, and multiple end-users that formulate various observation requests. These requests might be heterogeneous (stereoscopic observations, periodic observations, systematic observations, etc.), and one difficulty is that the search space defined by the possible ways of performing the requests given the multiple satellites and ground stations available is huge. This paper studies several combinatorial optimization techniques for solving such an operational problem, including a constraint programming approach and parallel scheduling techniques that take advantage of the problem structure. These algorithms are evaluated on realistic instances involving various request types and objective functions depending on the cloud cover conditions, that highly impact the quality of the images collected.