A nonidentical parallel processor scheduling problem (Q3783824)
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: A nonidentical parallel processor scheduling problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A nonidentical parallel processor scheduling problem |
scientific article |
Statements
1988
0 references
makespan
0 references
schedule length
0 references
parallel processors
0 references
heuristic
0 references
first fit decreasing bin-packing approximation
0 references
A nonidentical parallel processor scheduling problem (English)
0 references
