Approximability of Average Completion Time Scheduling on Unrelated Machines.
René A. SittersPublished in: ESA (2008)
Keyphrases
- parallel machines
- identical machines
- scheduling problem
- manufacturing cell
- resource constraints
- polynomial time approximation
- parallel processors
- dynamic scheduling
- scheduling algorithm
- approximation algorithms
- neural network
- round robin
- processing times
- information systems
- information retrieval
- databases
- learning machines
- standard deviation
- resource allocation
- scheduling policies
- flexible manufacturing systems
- data mining
- identical parallel machines
- wafer fabrication