Pages that link to "Item:Q1910619"
From MaRDI portal
The following pages link to On the complexity of multiprocessor task scheduling (Q1910619):
Displaying 26 items.
- A composite algorithm for multiprocessor scheduling (Q544815) (← links)
- On multiprocessor task scheduling using efficient state space search approaches (Q852871) (← links)
- Multiprocessor scheduling with communication delays (Q922681) (← links)
- Computational complexity of some scheduling problems with multiprocessor tasks (Q1019301) (← links)
- On the worst-case ratio of a compound multiprocessor scheduling algorithm (Q1097028) (← links)
- Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
- Scheduling multiprocessor tasks with chain constraints (Q1278298) (← links)
- Analysis of scheduling problems with typed task systems (Q1331888) (← links)
- Complexity of scheduling problems with multi-purpose machines (Q1374420) (← links)
- Scheduling multiprocessor tasks on parallel processors with limited availability. (Q1399581) (← links)
- On maximizing the throughput of multiprocessor tasks. (Q1401335) (← links)
- Complexity and approximation results for scheduling multiprocessor tasks on a ring. (Q1417558) (← links)
- Complexity analysis of new task allocation problem using network flow method on multicore clusters (Q1719030) (← links)
- Scheduling multiprocessor tasks on hypercubes (Q1892273) (← links)
- Shop scheduling problems with multiprocessor tasks on dedicated processors (Q1897372) (← links)
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion (Q2149611) (← links)
- A comparison of multiprocessor task scheduling algorithms with communication costs (Q2456658) (← links)
- Scheduling in the presence of processor networks : complexity and approximation (Q2893338) (← links)
- Online scheduling of two type parallel jobs on identical machines (Q3170006) (← links)
- The Research of Method Based on Complex Multi-task Parallel Scheduling Problem (Q3399925) (← links)
- Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325) (← links)
- Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms (Q3453298) (← links)
- Rescheduling to minimize makespan on a changing number of identical processors (Q3767116) (← links)
- (Q4011997) (← links)
- (Q4535977) (← links)
- Bounding the running time of algorithms for scheduling and packing problems (Q5890508) (← links)