Approximation Algorithms for Scheduling under Non-Uniform Machine-Dependent Delays.
Rajmohan RajaramanDavid StalfaSheng YangPublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- precedence constraints
- batch processing
- np hard
- scheduling problem
- parallel machines
- flowshop
- special case
- strongly np hard
- sequence dependent setup times
- manufacturing cell
- wafer fabrication
- worst case
- vertex cover
- minimum cost
- scheduling algorithm
- facility location problem
- randomized algorithms
- primal dual
- release dates
- network design problem
- resource allocation
- job shop scheduling
- np hardness
- open shop
- set cover
- undirected graph
- single machine
- dynamic programming
- combinatorial auctions
- approximation schemes
- constant factor
- polynomial time approximation
- completion times