Scheduling precedence graphs of bounded height
From MaRDI portal
Recommendations
Cited in
(29)- Preemptive scheduling and antichain polyhedra
- 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
- Applications of scheduling theory to formal language theory
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
- Optimal scheduling on parallel machines for a new order class
- Scheduling loosely connected task graphs.
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Scheduling unit-length jobs with precedence constraints of small height
- Preemptive scheduling with variable profile, precedence constraints and due dates
- Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time
- Non-preemptive profile scheduling and quasi-interval orders
- Precedence constrained scheduling: A case in \({\mathbf P}\)
- A Simplified Anomaly and Reduction for Precedence Constrained Multiprocessor Scheduling
- Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
- Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
- Profile Scheduling of Opposing Forests and Level Orders
- Scheduling Flat Graphs
- scientific article; zbMATH DE number 4072371 (Why is no real title available?)
- scientific article; zbMATH DE number 512916 (Why is no real title available?)
- A New Insight into the Coffman–Graham Algorithm
- scientific article; zbMATH DE number 2050889 (Why is no real title available?)
- Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines
- Improved parameterized algorithms for scheduling with precedence constraints and time windows
- Streaming algorithms for scheduling jobs with priorities
- Sublinear time approximation schemes for makespan minimization on parallel machines
- Parameterized algorithms and complexity for scheduling with precedence constraints and time windows
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows
- Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search
This page was built for publication: Scheduling precedence graphs of bounded height
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3339283)
