Minimizing worst-case and average-case makespan over scenarios.
Esteban FeuersteinAlberto Marchetti-SpaccamelaFrans SchalekampRené SittersSuzanne van der SterLeen StougieAnke van ZuylenPublished in: J. Sched. (2017)
Keyphrases
- average case
- worst case
- lower bound
- np hard
- worst case analysis
- learning curves
- upper bound
- scheduling problem
- uniform distribution
- greedy algorithm
- approximation algorithms
- average case complexity
- sample complexity bounds
- competitive ratio
- online algorithms
- optimal solution
- dynamic programming
- completion times
- data sets
- vc dimension
- flowshop
- computational complexity
- feature selection
- machine learning