Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms

Federico Della Croce (1) , Vincent t'Kindt (2, 3) , Olivier Ploton (2, 3)

1 DIGEP - Department of Management and Production Engineering [Politecnico di Torino]
2 LIFAT - Laboratoire d'Informatique Fondamentale et Appliquée de Tours
3 ROOT - Recherche Opérationnelle, Ordonnancement, Transport ERL 7002

Domaines: Recherche opérationnelle [math.OC]

Federico Della Croce, Vincent t'Kindt, Olivier Ploton. Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms. Applied Mathematics and Computation, 2021, 397, ⟨10.1016/j.amc.2020.125888⟩. ⟨hal-03064408⟩