Approximating the discrete resource sharing scheduling problem
DOI10.1142/S0129054111008271zbMATH Open1211.68377MaRDI QIDQ2997925FDOQ2997925
Authors: Marin Bougeret, Pierre-Francois Dutot, Alfredo Goldman, Yanik Ngoko, Denis Trystram
Publication date: 10 May 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
Cited In (6)
- Combining Multiple Heuristics
- Solving SAT in a distributed cloud: a portfolio approach
- A unified approach to approximating resource allocation and scheduling
- Real-time solving of computationally hard problems using optimal algorithm portfolios
- Parallel algorithm portfolio with market trading-based time allocation
- Approximate solution of a resource-constrained scheduling problem
Uses Software
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)