Scheduling Flat Graphs

DOI10.1137/0214047MaRDI QIDQ3741045zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

optimal scheduleidentical processorsintreesouttreesscheduling a partially ordered set of unit length tasksstructure of the precedence graph

Mathematics Subject Classification ID

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)

Recommendations

• Scheduling precedence graphs of bounded height
• Profile Scheduling of Opposing Forests and Level Orders
• scientific article; zbMATH DE number 3900151
• Scheduling Graphs on Two Processors
• Scheduling loosely connected task graphs.

Cited in

(21)

• Multiprocessor scheduling and combinatorial configurations
• Scheduling loosely connected task graphs.
• A pumping result for 2-context-free languages
• A Graphical Foundation for Schedules
• Nearly on line scheduling of preemptive independent tasks
• Scheduling jobs in open shops with limited machine availability
• Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
• Scheduling Graphs on Two Processors
• Minimum flow time graph ordering.
• Scheduling with limited machine availability
• Profile Scheduling of Opposing Forests and Level Orders
• Scheduling unit-length jobs with precedence constraints of small height
• Manipulating derivation forests by scheduling techniques
• Scheduling precedence graphs of bounded height
• Hierarchy ofk-context-free languages
• A polynomial algorithm for recognizing the \(\mathcal A\)-order class
• Preemptive scheduling with variable profile, precedence constraints and due dates
• Minimizing the number of machines for minimum length schedules
• Hierarchy of k-context-free languages part 1
• scientific article; zbMATH DE number 1884457 (Why is no real title available?)
• scientific article; zbMATH DE number 4057269 (Why is no real title available?)

This page was built for publication: Scheduling Flat Graphs

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