Improved optimal algorithms for scheduling unit-length independent tasks on uniform machines

DOI10.1080/00207729408928982zbMath0796.68045OpenAlexW2036925619WikidataQ126248959 ScholiaQ126248959MaRDI QIDQ4294390

Alekos Triantafyllakis, Spyros G. Tzafestas

Publication date: 24 May 1994

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729408928982

zbMATH Keywords

scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Scheduling subject to resource constraints: Classification and complexity
• Minimizing mean flow time with parallel processors and resource constraints
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Improved optimal algorithms for scheduling unit-length independent tasks on uniform machines