Pierre Pereira
Pierre Pereira has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Antoine Jacquet
Jolibrain Toulouse France
2 shared publications - Emmanuel Benazera
Jolibrain Toulouse France
2 shared publications - Guillaume Infantes
DTIS/ONERA Jolibrain Toulouse France
2 shared publications - Stéphanie Roussel
Université de Toulouse France
2 shared publications
Latest Publications
- 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.