Scheduling MapReduce Jobs under Multi-Round Precedences.
Dimitris FotakisIoannis MilisOrestis PapadigenopoulosVasilis VassalosGeorgios ZoisPublished in: CoRR (2016)
Keyphrases
- precedence constraints
- scheduling problem
- parallel machines
- release dates
- branch and bound algorithm
- precedence relations
- identical machines
- approximation algorithms
- maximum lateness
- scheduling strategy
- identical parallel machines
- setup times
- unrelated parallel machines
- sequence dependent setup times
- release times
- single machine scheduling problem
- minimize total
- processing times
- job scheduling
- single machine
- deteriorating jobs
- scheduling algorithm
- optimal scheduling
- scheduling jobs
- partial order
- wafer fabrication
- parallel computing
- np hard
- weighted tardiness
- computational grids
- flowshop
- lower bound
- partially ordered
- cloud computing
- upper bound
- fixed number
- global constraints
- distributed computing
- branch and bound
- combinatorial optimization
- response time
- high performance data mining
- batch processing machines