Minimizing mean flow time for UET tasks

DOI10.1145/1150334.1150340zbMath1321.68120OpenAlexW2086519761MaRDI QIDQ2944515

Yumei Huo, Joseph Y.-T. Leung

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1150334.1150340

zbMATH Keywords

schedulingprecedence constraintsapproximation algorithmsmean flow timeintrees

Mathematics Subject Classification ID

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

Related Items (4)

A survey on how the structure of precedence constraints may change the complexity class of scheduling problems ⋮ Ideal schedules in parallel machine settings ⋮ A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time ⋮ Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time

This page was built for publication: Minimizing mean flow time for UET tasks