Approximation schemes for machine scheduling with resource (in-)dependent processing times.
Klaus JansenMarten MaackMalin RauPublished in: SODA (2016)
Keyphrases
- processing times
- approximation schemes
- resource consumption
- single machine
- scheduling problem
- approximation algorithms
- setup times
- scheduling jobs
- polynomially solvable
- release dates
- precedence relations
- assembly line
- worst case performance ratio
- identical parallel machines
- numerical methods
- resource allocation
- single machine scheduling problem
- competitive ratio
- earliness tardiness
- identical machines
- completion times