Approximate solving of speed scaling scheduling problem with static and dynamic energy consumption

MaRDI QIDQ7318095zbMATH OpenFDO

Authors Julia Viktorovna Kovalenko, Alekseĭ Olegovich Zakharov

Publication date 24 August 2026

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites work

• A survey of offline algorithms for energy minimization under deadline constraints
• Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems
• Approximation algorithms for energy-efficient scheduling of parallel jobs
• Approximation algorithms for open shop variations subject to energy consumption
• APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
• Bounds on Multiprocessing Timing Anomalies
• Dynamic scheduling on parallel machines
• Geometric algorithms and combinatorial optimization.
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• Lectures on convex optimization
• Optimal on-line scheduling of parallel jobs with dependencies
• Scheduling for parallel processing

This page was built for publication: Approximate solving of speed scaling scheduling problem with static and dynamic energy consumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318095)