Pages that link to "Item:Q3358218"

The following pages link to Algorithms for Scheduling Imprecise Computations with Timing Constraints (Q3358218):

Displaying 23 items.

• Approximation algorithms for scheduling real-time jobs with multiple feasible intervals (Q853634) (← links)
• Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
• Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610) (← links)
• Scheduling two agents with controllable processing times (Q976351) (← links)
• Real-time scheduling algorithm for minimizing maximum weighted error with \(O(N \log N+cN)\) complexity (Q1274741) (← links)
• Minimizing the number of late tasks with error constraint (Q1308984) (← links)
• Minimizing the weighted number of tardy task units (Q1329790) (← links)
• Scheduling imprecise computation tasks with \(0/1\)-constraint (Q1377660) (← links)
• Minimizing mean flow time with error constraint (Q1386356) (← links)
• Open shop scheduling problems with late work criteria. (Q1421458) (← links)
• Real-time task scheduling with fuzzy deadlines and processing times (Q1595194) (← links)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
• On computing the latest starting times and floats of activities in a network with imprecise durations (Q1770714) (← links)
• The two-machine flow-shop problem with weighted late work criterion and common due date (Q1772844) (← links)
• Jitter minimization in scheduling computations in real-time systems (Q2017765) (← links)
• Scheduling imprecise computation tasks on uniform processors (Q2379995) (← links)
• Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines (Q2806872) (← links)
• (Q3035154) (← links)
• Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (Q3541133) (← links)
• A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS (Q4667920) (← links)
• IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS (Q4667921) (← links)
• On-Line Scheduling of Imprecise Computations to Minimize Error (Q4714561) (← links)
• Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints (Q5131701) (← links)