Pages that link to "Item:Q4152013"
From MaRDI portal
The following pages link to Worst Case Analysis of Two Scheduling Algorithms (Q4152013):
Displaying 18 items.
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- Online scheduling of equal-processing-time task systems (Q935146) (← links)
- Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal (Q955345) (← links)
- UET scheduling with unit interprocessor communication delays (Q1097163) (← links)
- Multiprocessor scheduling with interprocessor communication delays (Q1102743) (← links)
- Coffman-Graham scheduling of UET task systems with 0-1 resources (Q1149763) (← links)
- Optimal multiprocessor task scheduling using dominance and equivalence relations (Q1318466) (← links)
- Performance of Coffman-Graham schedules in the presence of unit communication delays (Q1382255) (← links)
- An iterative algorithm for scheduling UET tasks with due dates and release times. (Q1399585) (← links)
- Scheduling loosely connected task graphs. (Q1401986) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- Scheduling preemptive jobs with precedence constraints on parallel machines (Q1847175) (← links)
- An EPTAS for scheduling fork-join graphs with communication delay (Q1998847) (← links)
- Non-preemptive profile scheduling and quasi-interval orders (Q2741353) (← links)
- Approximation scheduling algorithms: a survey (Q4207781) (← links)
- A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies (Q4997320) (← links)
- Quasi-PTAS for scheduling with precedences using LP hierarchies (Q5002735) (← links)
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES (Q5716131) (← links)
