Algorithms for Scheduling Imprecise Computations with Timing Constraints

DOI10.1137/0220035MaRDI QIDQ3358218zbMATH OpenOpenAlexFDO

Authors Wei-Kuan Shih, Jane W. S. Liu, Jen-Yao Chung

Publication date 1991

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0220035

zbMATH Keywords

deterministic schedulingreal-time systemscheduling to meet deadlines

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
• Scheduling imprecise computation tasks with \(0/1\)-constraint
• Scheduling imprecise computation tasks on uniform processors
• Approximation algorithms for time constrained scheduling
• scientific article; zbMATH DE number 16428
• Approximation Algorithms for Scheduling Problems with Exact Delays
• Approximation algorithms for multiprocessor scheduling under uncertainty
• Approximation algorithms for scheduling with resource and precedence constraints
• Algorithms and complexity for periodic real-time scheduling

Cited in

(26)

• Real-time scheduling algorithm for minimizing maximum weighted error with \(O(N \log N+cN)\) complexity
• Minimizing the number of late tasks with error constraint
• Minimizing the weighted number of tardy task units
• Scheduling imprecise computation tasks with \(0/1\)-constraint
• Minimizing mean flow time with error constraint
• Open shop scheduling problems with late work criteria.
• Real-time task scheduling with fuzzy deadlines and processing times
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
• On computing the latest starting times and floats of activities in a network with imprecise durations
• The two-machine flow-shop problem with weighted late work criterion and common due date
• Jitter minimization in scheduling computations in real-time systems
• Scheduling imprecise computation tasks on uniform processors
• Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
• scientific article; zbMATH DE number 4133846 (Why is no real title available?)
• Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
• Minimizing Maximum Weighted Error for Imprecise Computation Tasks
• Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
• A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
• IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS
• On-Line Scheduling of Imprecise Computations to Minimize Error
• Machine speed scaling by adapting methods for convex optimization with submodular constraints
• Resource estimation algorithm under impreciseness using inclusion scheduling
• Approximation algorithms for scheduling real-time jobs with multiple feasible intervals
• Pre-emptive scheduling problems with controllable processing times
• Preemptive scheduling on uniform parallel machines with controllable job processing times
• Scheduling two agents with controllable processing times

This page was built for publication: Algorithms for Scheduling Imprecise Computations with Timing Constraints

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