A note on posterior tight worst-case bounds for longest processing time schedules (Q2423296)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on posterior tight worst-case bounds for longest processing time schedules |
scientific article |
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
