Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms. - Federico Della Croce; Vincent T'kindt; Olivier Ploton (Appl. Math. Comput., 2021)

Exponential-time algorithms for parallel machine scheduling problems. - Olivier Ploton; Vincent T'kindt (J. Comb. Optim., 2022)

Contributions of Inclusion-Exclusion to exact or approximate solution of scheduling problems. (Apports de l'Inclusion-Exclusion à la résolution exacte ou approchée de problèmes d'ordonnancement). - Olivier Ploton (2022)

Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion-Exclusion. - Olivier Ploton; Vincent T'kindt (J. Sched., 2023)

Contributions of Inclusion-Exclusion to exact or approximate solution of scheduling problems. - Olivier Ploton (4OR, 2023)

Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems. - Camille Grange 002; Michael Poss; Eric Bourreau; Vincent T'kindt; Olivier Ploton (Eur. J. Oper. Res., 2025)