APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM

DOI10.1142/S0129054111008271zbMath1211.68377MaRDI QIDQ2997925

Alfredo Goldman, Pierre-Francois Dutot, Marin Bougeret, Yanik Ngoko, Denis Trystram

Publication date: 10 May 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

resource allocationapproximation schemesSAT solvercombining algorithmsoracle-guess approximation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Uses Software

• SatEx

Cites Work

• Unnamed Item
• A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
• On the influence of lookahead in competitive paging algorithms
• Asynchronous teams: cooperation schemes for autonomous agents
• PYTHIA
• Algorithm portfolios

This page was built for publication: APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM