Scheduling Flat Graphs
From MaRDI portal
Publication:3741045
DOI10.1137/0214047zbMath0604.68038OpenAlexW2000431286MaRDI QIDQ3741045
Danny Dolev, Manfred K. Warmuth
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0214047
optimal scheduleidentical processorsintreesouttreesscheduling a partially ordered set of unit length tasksstructure of the precedence graph
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Nearly on line scheduling of preemptive independent tasks ⋮ Scheduling jobs in open shops with limited machine availability ⋮ A pumping result for 2-context-free languages ⋮ Scheduling unit-length jobs with precedence constraints of small height ⋮ Scheduling with limited machine availability ⋮ Hierarchy of k-context-free languages part 1 ⋮ Hierarchy ofk-context-free languages ⋮ Preemptive scheduling with variable profile, precedence constraints and due dates ⋮ Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors ⋮ Manipulating derivation forests by scheduling techniques ⋮ Minimizing the number of machines for minimum length schedules
