Minimizing total completion time in multiprocessor job systems with energy constraint

DOI10.1007/978-3-030-77876-7_18zbMath1485.90044arXiv2107.10142OpenAlexW3183251510MaRDI QIDQ2117638

Alexander Kononov, Julia Viktorovna Kovalenko

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2107.10142

zbMATH Keywords

schedulingapproximation algorithmNP-hardnessspeed scalingmultiprocessor job

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Cites Work

• Scheduling for parallel processing
• Power-aware scheduling for makespan and flow
• Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Scheduling multiprocessor tasks for mean flow time criterion
• Parallel machine scheduling with a convex resource consumption function
• Makespan minimization for parallel jobs with energy constraint
• Speed-Scaling with No Preemptions
• The NP-Completeness of Edge-Coloring
• Smart SMART Bounds for Weighted Response Time Scheduling
• Minimizing total completion time in two-processor task systems with prespecified processor allocations
• Energy-efficient algorithms for flow time minimization
• Getting the best response for your erg