The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders
From MaRDI portal
(Redirected from Publication:5317601)
Recommendations
- Optimal scheduling for UET/UET-UCT generalized \(n\)-dimensional grid task graphs
- Improved analysis of an algorithm for the coupled task problem with UET jobs
- Approximation algorithms for UET scheduling problems with exact delays
- Scheduling UET-UCT tasks: Branch-and-bound search in the priority space
- Bounds and algorithms for a practical task allocation model (extended abstract)
- A New Insight into the Coffman–Graham Algorithm
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
- Minimizing total completion time for UET tasks with release time and outtree precedence constraints
- UET-scheduling with constrained processor allocations
Cited in
(8)- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
- A polynomial algorithm for recognizing the \(\mathcal A\)-order class
- Performance of Coffman-Graham schedules in the presence of unit communication delays
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Non-preemptive profile scheduling and quasi-interval orders
- Minimizing mean flow time for UET tasks
- scientific article; zbMATH DE number 4199946 (Why is no real title available?)
- A New Insight into the Coffman–Graham Algorithm
This page was built for publication: The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317601)
