Approximation and Online Algorithms
From MaRDI portal
Publication:5896927
DOI10.1007/b95598zbMath1173.68405MaRDI QIDQ5896927
Erlebach, Thomas, Vanessa Kääb, Rolf H. Möhring
Publication date: 11 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95598
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Related Items
A General Framework for Approximating Min Sum Ordering Problems, Precedence-Constrained Min Sum Set Cover, Coping with Incomplete Information in Scheduling — Stochastic and Online Models, Makespan minimization with OR-precedence constraints