Approximating in exponential time identical parallel machine scheduling with minimum number of tardy jobs - Archive ouverte HAL Access content directly
Conference Papers Year : 2019
No file

Dates and versions

hal-03001106 , version 1 (12-11-2020)

Identifiers

  • HAL Id : hal-03001106 , version 1

Cite

Federico Della Croce, Vincent t'Kindt. Approximating in exponential time identical parallel machine scheduling with minimum number of tardy jobs. 10ème congrés de la Société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF’19), Feb 2019, Le Havre, France. ⟨hal-03001106⟩
17 View
0 Download

Share

Gmail Facebook X LinkedIn More