Hierarchies for classes of priority algorithms for job scheduling

DOI10.1016/J.TCS.2005.10.045zbMath1090.90091OpenAlexW1999518031MaRDI QIDQ818127

Periklis A. Papakonstantinou

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

zbMATH Keywords

greedy algorithmclassesalgorithmic paradigms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Models of greedy algorithms for graph problems ⋮ On the Structure of Optimal Greedy Computation (for Job Scheduling) ⋮ Advice complexity of adaptive priority algorithms ⋮ Characterizing sets of jobs that admit optimal greedy-like algorithms ⋮ Randomized priority algorithms

Cites Work

• Priority algorithms for makespan minimization in the subset model.
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Approximation and Online Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hierarchies for classes of priority algorithms for job scheduling