Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs.
Sven JägerPhilipp WarodePublished in: SOSA (2024)
Keyphrases
- approximation algorithms
- open shop
- precedence constraints
- processing times
- np hard
- completion times
- scheduling problem
- release dates
- special case
- single machine scheduling problem
- maximum lateness
- strongly np hard
- minimum cost
- flowshop
- single machine
- identical parallel machines
- parallel machines
- vertex cover
- worst case
- approximation ratio
- release times
- constant factor
- approximation schemes
- set cover
- disjoint paths
- search algorithm
- constant factor approximation
- identical machines
- randomized algorithms
- approximation guarantees
- primal dual
- fixed number
- lower bound