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

Federico Della Croce, T’kindt, Vincent and Olivier Ploton

Applied Mathematics and Computation, 2021, vol. 397, issue C

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.

Keywords: Number of tardy jobs; Identical parallel machines scheduling; Exponential time approximation (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320308419
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:397:y:2021:i:c:s0096300320308419

DOI: 10.1016/j.amc.2020.125888

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().