Minimizing mean flow time for UET tasks

DOI10.1145/1150334.1150340MaRDI QIDQ2944515zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmsintreesmean flow timeprecedence constraintsscheduling

Mathematics Subject Classification ID

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

Recommendations

• Scheduling UET task systems with concurrency on two parallel identical processors
• scientific article; zbMATH DE number 784432
• Minimizing mean flow time with release time constraint
• Scheduling multiprocessor tasks for mean flow time criterion
• The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders

Cited in

(6)

• Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
• Ideal schedules in parallel machine settings
• Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time
• A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time
• Minimizing total completion time for UET tasks with release time and outtree precedence constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944515)