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]

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

Della Croce F.;T'kindt V.;
2021

Abstract

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.
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S0096300320308419-main.pdf

non disponibili

Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 1.51 MB
Formato Adobe PDF
1.51 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2948116