Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs.
Sven JägerPhilipp WarodePublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- precedence constraints
- open shop
- processing times
- np hard
- strongly np hard
- vertex cover
- worst case
- identical parallel machines
- release dates
- special case
- scheduling problem
- parallel machines
- maximum lateness
- single machine scheduling problem
- single machine
- completion times
- minimum cost
- release times
- flowshop
- constant factor
- set cover
- primal dual
- undirected graph
- approximation ratio
- combinatorial auctions
- approximation schemes
- branch and bound algorithm
- parallel machine scheduling problem
- computational complexity