Pages that link to "Item:Q2556224"

The following pages link to Optimal scheduling for two-processor systems (Q2556224):

Displaying 50 items.

• A note on scheduling multiprocessor tasks with precedence constraints on parallel processors (Q287150) (← links)
• Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization (Q336513) (← links)
• Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules (Q345532) (← links)
• `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
• An efficient parallel algorithm for scheduling interval ordered tasks (Q652455) (← links)
• Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (Q703281) (← links)
• Scheduling two-machine no-wait open shops to minimize makespan (Q707009) (← links)
• A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints (Q714856) (← links)
• Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan (Q721932) (← links)
• An efficient algorithm for finding ideal schedules (Q766186) (← links)
• A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
• Online scheduling of equal-processing-time task systems (Q935146) (← links)
• Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal (Q955345) (← links)
• Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298) (← links)
• Minimizing the number of machines for minimum length schedules (Q1042210) (← links)
• Applications of scheduling theory to formal language theory (Q1082085) (← links)
• UET scheduling with unit interprocessor communication delays (Q1097163) (← links)
• Multiprocessor scheduling with interprocessor communication delays (Q1102743) (← links)
• Computing the bump number with techniques from two-processor scheduling (Q1106865) (← links)
• Scheduling tree-structured tasks with restricted execution times (Q1111371) (← links)
• Worst-case analysis of heuristics for the local microcode optimization problem (Q1119463) (← links)
• Complexity results for scheduling chains on a single machine (Q1142687) (← links)
• Coffman-Graham scheduling of UET task systems with 0-1 resources (Q1149763) (← links)
• Task splitting for three machine preemptive scheduling (Q1177707) (← links)
• NP-complete scheduling problems (Q1220386) (← links)
• A note on optimal scheduling for two-processor systems (Q1222022) (← links)
• Optimal scheduling of homogeneous job systems (Q1236493) (← links)
• A graph model for scheduling processes in systems with parallel computations (Q1238748) (← links)
• A note on optimal preemptive scheduling for two-processor systems (Q1240156) (← links)
• Antwortzeitgesteuerte Prozessorzuteilung unter strengen Zeitbedingungen (Q1241289) (← links)
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450) (← links)
• Bounds on list scheduling of UET tasks with restricted resource constraints (Q1259426) (← links)
• Methods for task allocation via agent coalition formation (Q1274277) (← links)
• The complexity of a cyclic scheduling problem with identical machines and precedence constraints (Q1278237) (← links)
• Scheduling multiprocessor tasks with chain constraints (Q1278298) (← links)
• List schedules for cyclic scheduling (Q1293196) (← links)
• Optimal scheduling on parallel machines for a new order class (Q1306374) (← links)
• Optimal multiprocessor task scheduling using dominance and equivalence relations (Q1318466) (← links)
• A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations (Q1333456) (← links)
• Multi-processor scheduling and expanders (Q1336770) (← links)
• On two-processor scheduling and maximum matching in permutation graphs (Q1351633) (← links)
• Performance of Coffman-Graham schedules in the presence of unit communication delays (Q1382255) (← links)
• Planar stage graphs: Characterizations and applications (Q1392202) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• Scheduling loosely connected task graphs. (Q1401986) (← links)
• Width-restricted layering of acyclic digraphs with consideration of dummy nodes (Q1603521) (← links)
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
• Scheduling chained multiprocessor tasks onto large multiprocessor system (Q1700868) (← links)
• Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
• A flow formulation for horizontal coordinate assignment with prescribed width (Q1725752) (← links)