We consider the solution of some NP-hard parallel machine scheduling problems involving the minimization of the weighted or unweighted number of tardy jobs. We first show that these problems cannot be approximated in polynomial time. Then we propose exponential-time approximation algorithms and fixed parameter tractable exact algorithms to solve them.
Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms / Della Croce, F.; T'kindt, V.; Ploton, O.. - In: APPLIED MATHEMATICS AND COMPUTATION. - ISSN 0096-3003. - ELETTRONICO. - 397:(2021), p. 125888. [10.1016/j.amc.2020.125888]
Titolo: | Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms | |
Autori: | ||
Data di pubblicazione: | 2021 | |
Rivista: | ||
Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/j.amc.2020.125888 | |
Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
1-s2.0-S0096300320308419-main.pdf | 2a Post-print versione editoriale / Version of Record | Non Pubblico - Accesso privato/ristretto | Administrator Richiedi una copia |
http://hdl.handle.net/11583/2948116