Nonpreemptive scheduling of independent tasks with prespecified processor allocations (Q4319223)
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: Nonpreemptive scheduling of independent tasks with prespecified processor allocations |
scientific article; zbMATH DE number 709820
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonpreemptive scheduling of independent tasks with prespecified processor allocations |
scientific article; zbMATH DE number 709820 |
Statements
26 March 1996
0 references
nonpreemptive
0 references
scheduling independent tasks
0 references
makespan
0 references
graph-theoretic approach
0 references
polynomial instances
0 references
comparability graphs
0 references
maximum weighted clique
0 references
branch-and-bound algorithm
0 references
Nonpreemptive scheduling of independent tasks with prespecified processor allocations (English)
0 references
0.92611897
0 references
0.92195034
0 references
0.9132737
0 references
0.9126031
0 references
0 references
0.9033395
0 references
0.9025513
0 references
