Minimizing the number of late tasks with error constraint

DOI10.1006/INCO.1993.1050zbMath0784.68016OpenAlexW2091496798MaRDI QIDQ1308984

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

heuristicoptimal schedulepreemptive schedulesingle processorpseudo-polynomial time algorithmNP- hardimprecise computation model

Mathematics Subject Classification ID

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

Related Items (1)

IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS

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