Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
From MaRDI portal
Publication:1889769
DOI10.1007/s00236-003-0134-7zbMath1072.68022OpenAlexW1992125546MaRDI QIDQ1889769
Publication date: 9 December 2004
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-003-0134-7
Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (10)
Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines ⋮ Semi-online scheduling: a survey ⋮ The online knapsack problem: advice and randomization ⋮ Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information ⋮ Semi-online preemptive scheduling: one algorithm for all variants ⋮ Preemptive online algorithms for scheduling with machine cost ⋮ Optimal online algorithms for scheduling on two identical machines under a grade of service ⋮ Preemptive semi-online algorithms for parallel machine scheduling with known total size ⋮ OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES ⋮ Preemptive machine covering on parallel machines
This page was built for publication: Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
