Hierarchies for classes of priority algorithms for job scheduling
From MaRDI portal
Publication:818127
DOI10.1016/j.tcs.2005.10.045zbMath1090.90091MaRDI QIDQ818127
Publication date: 24 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.045
68W05: Nonnumerical algorithms
68M10: Network design and communication in computer systems
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
90B35: Deterministic scheduling theory in operations research
Related Items
Advice complexity of adaptive priority algorithms, Models of greedy algorithms for graph problems, Characterizing sets of jobs that admit optimal greedy-like algorithms, Randomized priority algorithms, On the Structure of Optimal Greedy Computation (for Job Scheduling)
Cites Work