Scheduling Interval-Ordered Tasks
From MaRDI portal
Cited in
(66)- Preemptive scheduling and antichain polyhedra
- A linear time recognition algorithm for proper interval graphs
- A polynomial algorithm for recognizing the \(\mathcal A\)-order class
- A linear-time algorithm for a special case of disjoint set union
- A setup heuristic for interval orders
- Schedule-induced posets
- Applications of scheduling theory to formal language theory
- Adamant digraphs
- Rational preemptive scheduling
- A linear-time recognition algorithm for interval dags
- Some aspects of the semi-perfect elimination
- Transitive closure for restricted classes of partial orders
- UET-scheduling with constrained processor allocations
- Minimal vertex separators of chordal graphs
- Optimal scheduling on parallel machines for a new order class
- Analysis of scheduling problems with typed task systems
- New linear time algorithms for generating perfect elimination orderings of chordal graphs
- Simultaneous representation of interval and interval-containment orders
- Satisfiability problems on intervals and unit intervals
- Parallel \(N\)-free order recognition
- Perfect edge domination and efficient edge domination in 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
- Scheduling chained multiprocessor tasks onto large multiprocessor system
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders
- Scheduling preemptive jobs with precedence constraints on parallel machines
- Review of properties of different precedence graphs for scheduling problems
- Algorithms for dynamic scheduling of unit execution time tasks
- The jump number problem on interval orders: A 3/2 approximation algorithm
- Scheduling tasks with communication delays on parallel processors
- Integral mixed unit interval graphs
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
- Scheduling with constrained processor allocation for interval orders
- Can transitive orientation make sandwich problems easier?
- Batch processing with interval graph compatibilities between tasks
- Optimal preemptive scheduling on a fixed number of identical parallel machines
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable
- Non-preemptive profile scheduling and quasi-interval orders
- Unit interval graphs: a story with open ends
- A note on scheduling multiprocessor tasks with precedence constraints on parallel processors
- Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
- Profile Scheduling of Opposing Forests and Level Orders
- Scheduling Opposing Forests
- Modeling recreational systems using optimization techniques and information technologies
- ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS
- SCHEDULING INTERVAL ORDERS IN PARALLEL
- Unit interval graphs of open and closed intervals
- Interval approximations of message causality in distributed executions
- Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs
- Interval graphs with side (and size) constraints
- A characterization of unit interval bigraphs of open and closed intervals
- Tree-width and path-width of comparability graphs of interval orders
- On domination elimination orderings and domination graphs
- Scheduling interval ordered tasks with non-uniform deadlines
- Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
- An efficient parallel algorithm for scheduling interval ordered tasks
- Restrictions of graph partition problems. I
- Parallel interval order recognition and construction of interval representations
- A linear time and space algorithm to recognize interval orders
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
- Mixed unit interval graphs
- Some aspects of perfect elimination orderings in chordal graphs
- Chain dominated orders
- Preemptive scheduling of interval orders is polynomial
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
- Some approximation algorithms for the clique partition problem in weighted interval graphs
This page was built for publication: Scheduling Interval-Ordered Tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3854618)
