Orchestrating an Ensemble of MapReduce Jobs for Minimizing Their Makespan.
Abhishek VermaLudmila CherkasovaRoy H. CampbellPublished in: IEEE Trans. Dependable Secur. Comput. (2013)
Keyphrases
- processing times
- single machine
- completion times
- weighted number of tardy jobs
- scheduling problem
- flowshop
- release dates
- scheduling jobs
- open shop
- permutation flowshop
- batch processing
- single machine scheduling problem
- unrelated parallel machines
- minimizing makespan
- strongly np hard
- sequence dependent setup times
- maximum lateness
- setup times
- batch processing machines
- release times
- ensemble learning
- neural network
- ensemble methods
- identical machines
- identical parallel machines
- weighted sum
- precedence constraints
- cloud computing
- random forests
- parallel machine scheduling problem
- job processing times
- deteriorating jobs
- learning algorithm
- parallel machines
- random forest
- base classifiers
- tabu search
- training data
- classifier ensemble
- ensemble classifier
- parallel processing
- production system
- np hard
- high performance data mining
- resource consumption
- multi class
- special case
- lower bound
- optimal solution