Minimizing mean flow time with error constraint

DOI10.1007/PL00009185zbMath0899.68008OpenAlexW3163580487MaRDI QIDQ1386356

D. Massart

Publication date: 1 November 1998

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009185

zbMATH Keywords

preemptive scheduleimprecise computation model

Mathematics Subject Classification ID

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

Related Items (2)

Preemptive scheduling to minimize mean weighted flow time ⋮ IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS

This page was built for publication: Minimizing mean flow time with error constraint