The following pages link to Scheduling Interval-Ordered Tasks (Q3854618):
Displayed 50 items.
- A note on scheduling multiprocessor tasks with precedence constraints on parallel processors (Q287150) (← links)
- Modeling recreational systems using optimization techniques and information technologies (Q478052) (← links)
- An efficient parallel algorithm for scheduling interval ordered tasks (Q652455) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- Parallel interval order recognition and construction of interval representations (Q673637) (← links)
- A linear time and space algorithm to recognize interval orders (Q689975) (← links)
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (Q703281) (← links)
- Mixed unit interval graphs (Q713160) (← links)
- Some aspects of perfect elimination orderings in chordal graphs (Q792351) (← links)
- Chain dominated orders (Q862975) (← links)
- Preemptive scheduling of interval orders is polynomial (Q913500) (← links)
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571) (← links)
- Some approximation algorithms for the clique partition problem in weighted interval graphs (Q995565) (← links)
- Preemptive scheduling and antichain polyhedra (Q1003473) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- A polynomial algorithm for recognizing the \(\mathcal A\)-order class (Q1043599) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- A setup heuristic for interval orders (Q1064975) (← links)
- Schedule-induced posets (Q1081529) (← links)
- Applications of scheduling theory to formal language theory (Q1082085) (← links)
- Adamant digraphs (Q1104933) (← links)
- Rational preemptive scheduling (Q1105366) (← links)
- A linear-time recognition algorithm for interval dags (Q1149762) (← links)
- Some aspects of the semi-perfect elimination (Q1175796) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- UET-scheduling with constrained processor allocations (Q1185984) (← links)
- Minimal vertex separators of chordal graphs (Q1281392) (← links)
- Optimal scheduling on parallel machines for a new order class (Q1306374) (← links)
- Analysis of scheduling problems with typed task systems (Q1331888) (← links)
- New linear time algorithms for generating perfect elimination orderings of chordal graphs (Q1350607) (← links)
- Simultaneous representation of interval and interval-containment orders (Q1362579) (← links)
- Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
- Parallel \(N\)-free order recognition (Q1392213) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Scheduling unit-length jobs with precedence constraints of small height (Q1667212) (← links)
- Scheduling chained multiprocessor tasks onto large multiprocessor system (Q1700868) (← links)
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders (Q1811068) (← links)
- Scheduling preemptive jobs with precedence constraints on parallel machines (Q1847175) (← links)
- Review of properties of different precedence graphs for scheduling problems (Q1847252) (← links)
- Algorithms for dynamic scheduling of unit execution time tasks (Q1869578) (← links)
- The jump number problem on interval orders: A 3/2 approximation algorithm (Q1898347) (← links)
- Scheduling tasks with communication delays on parallel processors (Q1904382) (← links)
- Integral mixed unit interval graphs (Q1949108) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Scheduling with constrained processor allocation for interval orders (Q2367418) (← links)
- Can transitive orientation make sandwich problems easier? (Q2370442) (← links)
- Batch processing with interval graph compatibilities between tasks (Q2476244) (← links)
- Optimal preemptive scheduling on a fixed number of identical parallel machines (Q2488216) (← links)
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)