Minimizing the number of late tasks with error constraint

DOI10.1006/INCO.1993.1050MaRDI QIDQ1308984zbMATH OpenOpenAlexFDO

Authors V. Pereyra

Publication date 8 December 1993

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/586bb63de4b3610cc70f1536bfe57d6da8f49c62

zbMATH Keywords

heuristicimprecise computation modelNP- hardoptimal schedulepreemptive schedulepseudo-polynomial time algorithmsingle processor

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing mean flow time with error constraint
• On-Line Scheduling of Imprecise Computations to Minimize Error
• Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
• Algorithms for Scheduling Imprecise Computations with Timing Constraints
• Scheduling imprecise computation tasks with \(0/1\)-constraint

Cited in

(4)

• Scheduling imprecise computation tasks with \(0/1\)-constraint
• Minimizing mean flow time with error constraint
• IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS
• scientific article; zbMATH DE number 842892 (Why is no real title available?)

This page was built for publication: Minimizing the number of late tasks with error constraint

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