Near-Optimal Scheduling Mechanisms for Deadline-Sensitive Jobs in Large Computing Clusters.
Navendu JainIshai MenacheJoseph NaorJonathan YanivPublished in: ACM Trans. Parallel Comput. (2015)
Keyphrases
- scheduling algorithm
- scheduling strategy
- job scheduling
- identical parallel machines
- parallel machines
- scheduling problem
- release dates
- identical machines
- resource constraints
- minimize total
- computational grids
- scheduling jobs
- deteriorating jobs
- precedence relations
- precedence constraints
- release times
- clustering algorithm
- processing times
- single machine
- hierarchical clustering
- optimal scheduling
- maximum lateness
- unrelated parallel machines
- batch processing
- scheduling policies
- single machine scheduling problem
- fixed number
- weighted tardiness
- cluster analysis
- setup times
- round robin
- sequence dependent setup times
- wafer fabrication
- response time
- flowshop
- data points
- resource allocation
- fuzzy clustering
- scheduling decisions
- flexible manufacturing systems
- limited capacity
- lot sizing
- mechanism design
- resource consumption
- timing constraints
- special case