Sequential predictive scheduling in partitioned data domains
DOI10.1007/978-3-319-59861-1_1zbMATH Open1384.90053OpenAlexW2634386619MaRDI QIDQ4609764FDOQ4609764
Authors: Jörg Bremer, Christian Hinrichs, Sönke Martens, Michael Sonnenschein
Publication date: 26 March 2018
Published in: Recent Advances in Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-59861-1_1
Recommendations
Case-oriented studies in operations research (90B90) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Optimization by simulated annealing
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Monte Carlo sampling methods using Markov chains and their applications
- Equation of state calculations by fast computing machines
- Support vector data description
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- Hybrid parallel tempering and simulated annealing method
- Dynamic weighting in Monte Carlo and optimization
This page was built for publication: Sequential predictive scheduling in partitioned data domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4609764)