Approximability of average completion time scheduling on unrelated machines.
René SittersPublished in: Math. Program. (2017)
Keyphrases
- parallel machines
- scheduling problem
- identical machines
- scheduling algorithm
- parallel processors
- manufacturing cell
- polynomial time approximation
- wafer fabrication
- identical parallel machines
- approximation algorithms
- resource constraints
- flowshop
- standard deviation
- information systems
- precedence constraints
- flexible manufacturing systems
- dynamic scheduling
- np hard
- data sets
- real time