Scheduling MapReduce Jobs Under Multi-round Precedences.
Dimitris FotakisIoannis MilisOrestis PapadigenopoulosVasilis VassalosGeorgios ZoisPublished in: Euro-Par (2016)
Keyphrases
- precedence constraints
- scheduling problem
- parallel machines
- release dates
- precedence relations
- branch and bound algorithm
- identical machines
- unrelated parallel machines
- job scheduling
- single machine scheduling problem
- sequence dependent setup times
- maximum lateness
- scheduling strategy
- setup times
- approximation algorithms
- optimal scheduling
- partial order
- minimize total
- processing times
- weighted tardiness
- identical parallel machines
- partially ordered
- release times
- round robin
- flowshop
- computational grids
- deteriorating jobs
- cloud computing
- scheduling decisions
- scheduling policies
- global constraints
- resource allocation
- scheduling algorithm
- scheduling jobs
- batch processing machines
- high performance data mining
- single machine
- parallel computing
- resource constraints
- wafer fabrication
- job processing times
- list scheduling
- real time database systems
- flexible manufacturing systems
- data sets
- distributed computing
- parallel processing
- combinatorial optimization
- tabu search
- response time
- optimal solution