Pages that link to "Item:Q1977621"
From MaRDI portal
The following pages link to Scheduling multiprocessor tasks for mean flow time criterion (Q1977621):
Displaying 13 items.
- Scheduling semi-malleable jobs to minimize mean flow time (Q892832) (← links)
- Computational complexity of some scheduling problems with multiprocessor tasks (Q1019301) (← links)
- Minimizing mean flow time with parallel processors and resource constraints (Q1084859) (← links)
- Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
- A note on scheduling multiprocessor tasks with identical processing times. (Q1413834) (← links)
- Multi-rate fluid scheduling of mixed-criticality systems on multiprocessors (Q1645215) (← links)
- Lower bounds for a bin packing problem with linear usage cost (Q1755229) (← links)
- Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
- Minimizing total completion time in multiprocessor job systems with energy constraint (Q2117638) (← links)
- A polynomial algorithm for some preemptive multiprocessor task scheduling problems (Q2432888) (← links)
- Scheduling multiprocessor tasks on two parallel processors (Q3148375) (← links)
- (Q4840097) (← links)
- (Q4917916) (← links)