A note on posterior tight worst-case bounds for longest processing time schedules (Q2423296)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7070345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on posterior tight worst-case bounds for longest processing time schedules |
scientific article; zbMATH DE number 7070345 |
Statements
A note on posterior tight worst-case bounds for longest processing time schedules (English)
0 references
21 June 2019
0 references
multiprocessor scheduling
0 references
parallel machines
0 references
LPT algorithm
0 references
worst-case analysis
0 references
0 references
0 references
0.8417631983757019
0 references
0.841183066368103
0 references
0.8357446789741516
0 references
0.8349000811576843
0 references
