Approximation and Online Algorithms
From MaRDI portal
Publication:5898482
DOI10.1007/11671411zbMath1177.68035OpenAlexW4210634114MaRDI QIDQ5898482
Patchrawat Uthaisombut, Rob van Stee, Kirk R. Pruhs
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671411
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (5)
Scheduling algorithms for procrastinators ⋮ Power and performance management for parallel computations in clouds and data centers ⋮ Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan ⋮ Power-aware scheduling for makespan and flow ⋮ Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
This page was built for publication: Approximation and Online Algorithms
