Minimizing Maximum Weighted Error for Imprecise Computation Tasks
From MaRDI portal
Publication:4290916
DOI10.1006/jagm.1994.1020zbMath0804.68015OpenAlexW2014808299MaRDI QIDQ4290916
No author found.
Publication date: 5 May 1994
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1994.1020
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Scheduling imprecise computation tasks on uniform processors, Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, Open shop scheduling problems with late work criteria., Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS, IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS, The two-machine flow-shop problem with weighted late work criterion and common due date, Real-time scheduling algorithm for minimizing maximum weighted error with \(O(N \log N+cN)\) complexity
