An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube (Q917300)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube |
scientific article; zbMATH DE number 4155890
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube |
scientific article; zbMATH DE number 4155890 |
Statements
An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube (English)
0 references
1990
0 references
preemptive scheduling
0 references
hypercube
0 references
balanced search tree
0 references
