An approximation result for a duo-processor task scheduling problem (Q286992)
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 approximation result for a duo-processor task scheduling problem |
scientific article; zbMATH DE number 6585376
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation result for a duo-processor task scheduling problem |
scientific article; zbMATH DE number 6585376 |
Statements
An approximation result for a duo-processor task scheduling problem (English)
0 references
26 May 2016
0 references
parallel processing
0 references
scheduling
0 references
coloring
0 references
computational complexity
0 references
approximation algorithms
0 references
