Pages that link to "Item:Q1278299"
From MaRDI portal
The following pages link to Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (Q1278299):
Displaying 10 items.
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints (Q967430) (← links)
- Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
- Multicoloring trees. (Q1401922) (← links)
- Minimizing total completion time in multiprocessor job systems with energy constraint (Q2117638) (← links)
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion (Q2149611) (← links)
- Algorithms for data migration (Q2379927) (← links)
- Minimum sum multicoloring on the edges of trees (Q2503344) (← links)
- On Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies (Q2806947) (← links)
- Min Sum Edge Coloring in Multigraphs Via Configuration LP (Q3503859) (← links)
