Algorithms and Data Structures

DOI10.1007/11534273zbMath1161.90390OpenAlexW3010016474MaRDI QIDQ5394262

Jian-Jia Chen, Tei-Wei Kuo, Hsueh-I Lu

Publication date: 25 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11534273

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (7)

Energy efficient voltage scheduling for multi-core processors with software controlled dynamic voltage scaling ⋮ A Monte Carlo algorithm for real time task scheduling on multi-core processors with software controlled dynamic voltage scaling ⋮ Non-preemptive speed scaling ⋮ Speed scaling of tasks with precedence constraints ⋮ Speed scaling on parallel processors ⋮ Resource cost aware scheduling ⋮ Power-aware scheduling for makespan and flow

This page was built for publication: Algorithms and Data Structures