Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time.
Mingyang GongZhi-Zhong ChenKuniteru HayashiPublished in: Algorithmica (2024)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- set cover
- facility location problem
- np hardness
- primal dual
- open shop
- network design problem
- approximation schemes
- precedence constraints
- constant factor
- randomized algorithms
- undirected graph
- polynomial time approximation
- flowshop
- theoretical analysis
- disjoint paths
- single machine scheduling problem
- approximation ratio
- search algorithm
- processing times
- search space