A note on posterior tight worst-case bounds for longest processing time schedules.
Johnny C. HoIvar MassabòGiuseppe PalettaAlex J. Ruiz-TorresPublished in: 4OR (2019)
Keyphrases
- worst case bounds
- worst case
- lower bound
- scheduling problem
- upper bound
- batch processing
- np hard
- machine learning
- decision making
- gaussian process
- probabilistic model
- bayesian framework
- state space
- probability distribution
- data sets
- training set
- data structure
- posterior distribution
- multiscale
- computer vision
- neural network