A note on LPT scheduling (Q5906502)
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 550416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on LPT scheduling |
scientific article; zbMATH DE number 550416 |
Statements
A note on LPT scheduling (English)
0 references
12 April 1994
0 references
identical parallel machines
0 references
heuristics
0 references
worst-case performance
0 references
largest processing-time-first
0 references
parallel-machine scheduling
0 references
0.8964151
0 references
0.87403333
0 references
0.87275314
0 references
0.86804897
0 references
0.86632645
0 references
0.8661221
0 references
0.85630465
0 references
0.85630465
0 references
