A Note on "Orchestrating an Ensemble of MapReduce Jobs for Minimizing Their Makespan".
Wenhong TianYu ChenXinyang WangPublished in: IEEE Trans. Dependable Secur. Comput. (2014)
Keyphrases
- completion times
- processing times
- single machine
- weighted number of tardy jobs
- scheduling problem
- flowshop
- release dates
- scheduling jobs
- open shop
- unrelated parallel machines
- permutation flowshop
- batch processing
- release times
- single machine scheduling problem
- minimizing makespan
- deteriorating jobs
- strongly np hard
- neural network
- setup times
- maximum lateness
- ensemble learning
- identical machines
- batch processing machines
- training set
- high performance data mining
- cloud computing
- np hard
- distributed computing
- parallel machines
- parallel machine scheduling problem
- precedence constraints
- identical parallel machines
- lower bound
- job shop
- classifier ensemble
- ensemble classifier
- queue length
- random forests
- ensemble methods
- tabu search
- sequence dependent setup times
- resource consumption
- job scheduling
- parallel computing
- weighted sum
- random forest
- production system