Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions (Q280185)
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: Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions |
scientific article; zbMATH DE number 6577829
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions |
scientific article; zbMATH DE number 6577829 |
Statements
Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions (English)
0 references
4 May 2016
0 references
scheduling
0 references
worst-case analysis
0 references
time restrictions
0 references
LPT algorithm
0 references
longest processing time first
0 references
0.887837827205658
0 references
0.8609827756881714
0 references
0.8579916954040527
0 references
0.8407577872276306
0 references
