Performance of the LPT algorithm in multiprocessor scheduling (Q583889)
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: Publication:583889 |
scientific article; zbMATH DE number 4133494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance of the LPT algorithm in multiprocessor scheduling |
scientific article; zbMATH DE number 4133494 |
Statements
Performance of the LPT algorithm in multiprocessor scheduling (English)
0 references
1990
0 references
LPT algorithm
0 references
multiprocessor scheduling
0 references
NP-complete
0 references
heuristics
0 references
probabilistic analysis
0 references
makespans
0 references
worst-case analysis
0 references
deterministic models
0 references
stochastic model
0 references
0 references
0 references
0.898583173751831
0 references
0.8915888667106628
0 references
0.8849831819534302
0 references
0.8822961449623108
0 references
0.8794289827346802
0 references
