Approximating the discrete resource sharing scheduling problem
From MaRDI portal
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Solving SAT in a distributed cloud: a portfolio approach
- Learning parallel portfolios of algorithms
- Resource level minimization in the discrete-continuous scheduling
- Local search metaheuristics for discrete-continuous scheduling problems
- Approximate algorithms for the \(P\parallel C_{\max}\) problem
Cites work
- A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
- Algorithm portfolios
- Asynchronous teams: cooperation schemes for autonomous agents
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On the influence of lookahead in competitive paging algorithms
- PYTHIA
Cited in
(6)- Approximate solution of a resource-constrained scheduling problem
- Real-time solving of computationally hard problems using optimal algorithm portfolios
- Solving SAT in a distributed cloud: a portfolio approach
- Parallel algorithm portfolio with market trading-based time allocation
- Combining Multiple Heuristics
- A unified approach to approximating resource allocation and scheduling
This page was built for publication: Approximating the discrete resource sharing scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997925)
