3 papers
math.OC2026
Heuristic approaches for solving a bilevel optimistic scheduling problem on parallel machines
Quentin Schau, Federico Della Croce, Olivier Ploton +1
This work addresses the uniform parallel machine scheduling problem within an optimistic bilevel optimization framework. The leader seeks to minimize the weighted number of tardy j…
math.OC2026
Solution of a bilevel optimistic scheduling problem on parallel machines
Quentin Schau, Olivier Ploton, Vincent T'kindt +3
We consider the uniform parallel machines scheduling problem in the context of optimistic bilevel optimization, where two speed options are considered. In this scenario, the leader…
quant-ph2024
Moderate Exponential-time Quantum Dynamic Programming Across the Subsets for Scheduling Problems
Camille Grange, Michael Poss, Eric Bourreau +2
Grover Search is currently one of the main quantum algorithms leading to hybrid quantum-classical methods that reduce the worst-case time complexity for some combinatorial optimiza…