Pages that link to "Item:Q922681"

The following pages link to Multiprocessor scheduling with communication delays (Q922681):

Displaying 50 items.

• A note on scheduling multiprocessor tasks with precedence constraints on parallel processors (Q287150) (← links)
• Reducing the solution space of optimal task scheduling (Q336912) (← links)
• Maximizing the throughput of parallel jobs on hypercubes (Q846023) (← links)
• On contiguous and non-contiguous parallel task scheduling (Q892906) (← links)
• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness (Q1261479) (← links)
• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems (Q1266535) (← links)
• Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
• Scheduling multiprocessor tasks with chain constraints (Q1278298) (← links)
• On the complexity of scheduling with large communication delays (Q1278302) (← links)
• A versatile cost modelling approach for multicomputer task scheduling: Special issue on task scheduling problems for parallel and distributed systems (Q1285551) (← links)
• Three, four, five, six, or the complexity of scheduling with communication delays (Q1342284) (← links)
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations (Q1343144) (← links)
• Scheduling complete intrees on two uniform processors with communication delays (Q1349970) (← links)
• Real-time scheduling of linear speedup parallel tasks (Q1350756) (← links)
• Efficiency and effectiveness of normal schedules on three dedicated processors (Q1356693) (← links)
• Scheduling problems in parallel systems for telecommunications (Q1362359) (← links)
• Distributed processing of divisible jobs with communication startup costs (Q1363737) (← links)
• Scheduling UET-UCT series-parallel graphs on two processors (Q1365936) (← links)
• Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors (Q1372768) (← links)
• Performance of Coffman-Graham schedules in the presence of unit communication delays (Q1382255) (← links)
• Using duplication for scheduling unitary tasks on m processors with unit communication delays (Q1391530) (← links)
• Scheduling multiprocessor tasks on parallel processors with limited availability. (Q1399581) (← links)
• Complexity and approximation results for scheduling multiprocessor tasks on a ring. (Q1417558) (← links)
• Scheduling groups of tasks with precedence constraints on three dedicated processors. (Q1421466) (← links)
• A very difficult scheduling problem with communication delays (Q1604057) (← links)
• Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays (Q1631647) (← links)
• Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays (Q1631999) (← links)
• Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
• Scheduling unitary task systems with zero--one communication delays for quasi-interval orders (Q1811068) (← links)
• Scheduling rooted forests with communication delays (Q1842095) (← links)
• Unconstrained static scheduling with communication weights (Q1850709) (← links)
• An approximation algorithm for scheduling on three dedicated machines (Q1897367) (← links)
• Shop scheduling problems with multiprocessor tasks on dedicated processors (Q1897372) (← links)
• Scheduling tasks with communication delays on parallel processors (Q1904382) (← links)
• Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors (Q1904737) (← links)
• Scheduling multiprocessor tasks for mean flow time criterion (Q1977621) (← links)
• Scheduling of pipelined operator graphs (Q2434287) (← links)
• A comparison of multiprocessor task scheduling algorithms with communication costs (Q2456658) (← links)
• Scheduling trees with large communication delays on two identical processors (Q2464442) (← links)
• A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks (Q2503351) (← links)
• Single machine scheduling subject to precedence delays (Q2563923) (← links)
• Tabu search method for multiprocessor scheduling with communication delays (Q2713147) (← links)
• MPI parallelization of variable neighborhood search (Q2840781) (← links)
• Scheduling multiprocessor tasks on two parallel processors (Q3148375) (← links)
• C.P.M. Scheduling with Small Communication Delays and Task Duplication (Q3980521) (← links)
• A Heuristic for a Scheduling Problem with Communication Delays (Q4367272) (← links)
• New MIP model for multiprocessor scheduling problem with communication delays (Q5915741) (← links)
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays (Q5929309) (← links)
• New applications of the Muntz and Coffman algorithm (Q5946720) (← links)
• Some models for scheduling parallel programs with communication delays (Q5961603) (← links)