Minimizing mean flow time with error constraint

DOI10.1007/PL00009185MaRDI QIDQ1386356zbMATH OpenOpenAlexFDO

Authors 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

imprecise computation modelpreemptive schedule

Mathematics Subject Classification ID

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

Recommendations

• Publication:4862352
• Minimizing the number of late tasks with error constraint
• Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
• On-Line Scheduling of Imprecise Computations to Minimize Error
• Algorithms for Scheduling Imprecise Computations with Timing Constraints

Cited in

(6)

• Minimizing the number of late tasks with error constraint
• Minimizing Mean Flow Time With Release Time and Deadline Constraints
• IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS
• scientific article; zbMATH DE number 842892 (Why is no real title available?)
• Mean‐standard deviation model for minimum cost flow problem
• Preemptive scheduling to minimize mean weighted flow time

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

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